|
2197 |
P1152D Neko and Aki's Prank
|
0 / 0 |
(无) |
|
2196 |
P1152E Neko and Flashback
|
0 / 0 |
(无) |
|
2195 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
(无) |
|
2194 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
(无) |
|
2193 |
P1153A Serval and Bus
|
0 / 0 |
(无) |
|
2192 |
P1153B Serval and Toy Bricks
|
0 / 0 |
(无) |
|
2191 |
P1153C Serval and Parenthesis Sequence
|
0 / 0 |
(无) |
|
2190 |
P1153D Serval and Rooted Tree
|
0 / 0 |
(无) |
|
2189 |
P1153E Serval and Snake
|
0 / 0 |
(无) |
|
2188 |
P1153F Serval and Bonus Problem
|
0 / 0 |
(无) |
|
2187 |
P1154A Restoring Three Numbers
|
0 / 0 |
(无) |
|
2186 |
P1154B Make Them Equal
|
0 / 0 |
(无) |
|
2185 |
P1154C Gourmet Cat
|
0 / 0 |
(无) |
|
2184 |
P1154D Walking Robot
|
0 / 0 |
(无) |
|
2183 |
P1154E Two Teams
|
0 / 0 |
(无) |
|
2182 |
P1154F Shovels Shop
|
0 / 0 |
(无) |
|
2181 |
P1154G Minimum Possible LCM
|
0 / 0 |
(无) |
|
2180 |
P1155A Reverse a Substring
|
0 / 0 |
(无) |
|
2179 |
P1155B Game with Telephone Numbers
|
0 / 0 |
(无) |
|
2178 |
P1155C Alarm Clocks Everywhere
|
0 / 0 |
(无) |
|
2177 |
P1155D Beautiful Array
|
0 / 0 |
(无) |
|
2176 |
P1155E Guess the Root
|
0 / 0 |
(无) |
|
2175 |
P1155F Delivery Oligopoly
|
0 / 0 |
(无) |
|
2174 |
P1156A Inscribed Figures
|
0 / 0 |
(无) |
|
2173 |
P1156B Ugly Pairs
|
0 / 0 |
(无) |
|
2172 |
P1156C Match Points
|
0 / 0 |
(无) |
|
2171 |
P1156D 0-1-Tree
|
0 / 0 |
(无) |
|
2170 |
P1156E Special Segments of Permutation
|
0 / 0 |
(无) |
|
2169 |
P1156F Card Bag
|
0 / 0 |
(无) |
|
2168 |
P1156G Optimizer
|
0 / 0 |
(无) |
|
2167 |
P1157A Reachable Numbers
|
0 / 0 |
(无) |
|
2166 |
P1157B Long Number
|
0 / 0 |
(无) |
|
2165 |
P1157C1 Increasing Subsequence (easy version)
|
0 / 0 |
(无) |
|
2164 |
P1157C2 Increasing Subsequence (hard version)
|
0 / 0 |
(无) |
|
2163 |
P1157D N Problems During K Days
|
0 / 0 |
(无) |
|
2162 |
P1157E Minimum Array
|
0 / 0 |
(无) |
|
2161 |
P1157F Maximum Balanced Circle
|
0 / 0 |
(无) |
|
2160 |
P1157G Inverse of Rows and Columns
|
0 / 0 |
(无) |
|
2159 |
P1158A The Party and Sweets
|
0 / 0 |
(无) |
|
2158 |
P1158B The minimal unique substring
|
0 / 0 |
(无) |
|
2157 |
P1158C Permutation recovery
|
0 / 0 |
(无) |
|
2156 |
P1158D Winding polygonal line
|
0 / 0 |
(无) |
|
2155 |
P1158E Strange device
|
0 / 0 |
(无) |
|
2154 |
P1158F Density of subarrays
|
0 / 0 |
(无) |
|
2153 |
P1159A A pile of stones
|
0 / 0 |
(无) |
|
2152 |
P1159B Expansion coefficient of the array
|
0 / 0 |
(无) |
|
2151 |
P1160A2 Collaboration
|
0 / 0 |
(无) |
|
2150 |
P1162A Zoning Restrictions Again
|
0 / 0 |
(无) |
|
2149 |
P1162B Double Matrix
|
0 / 0 |
(无) |
|
2148 |
P1163A Eating Soup
|
0 / 0 |
(无) |
|
2147 |
P1163B1 Cat Party (Easy Edition)
|
0 / 0 |
(无) |
|
2146 |
P1163B2 Cat Party (Hard Edition)
|
0 / 0 |
(无) |
|
2145 |
P1163C1 Power Transmission (Easy Edition)
|
0 / 0 |
(无) |
|
2144 |
P1163C2 Power Transmission (Hard Edition)
|
0 / 0 |
(无) |
|
2143 |
P1163D Mysterious Code
|
0 / 0 |
(无) |
|
2142 |
P1163E Magical Permutation
|
0 / 0 |
(无) |
|
2141 |
P1163F Indecisive Taxi Fee
|
0 / 0 |
(无) |
|
2140 |
P1165A Remainder
|
0 / 0 |
(无) |
|
2139 |
P1165B Polycarp Training
|
0 / 0 |
(无) |
|
2138 |
P1165C Good String
|
0 / 0 |
(无) |
|
2137 |
P1165D Almost All Divisors
|
0 / 0 |
(无) |
|
2136 |
P1165E Two Arrays and Sum of Functions
|
0 / 0 |
(无) |
|
2135 |
P1165F1 Microtransactions (easy version)
|
0 / 0 |
(无) |
|
2134 |
P1165F2 Microtransactions (hard version)
|
0 / 0 |
(无) |
|
2133 |
P1166A Silent Classroom
|
0 / 0 |
(无) |
|
2132 |
P1166B All the Vowels Please
|
0 / 0 |
(无) |
|
2131 |
P1166C A Tale of Two Lands
|
0 / 0 |
(无) |
|
2130 |
P1166D Cute Sequences
|
0 / 0 |
(无) |
|
2129 |
P1166E The LCMs Must be Large
|
0 / 0 |
(无) |
|
2128 |
P1166F Vicky's Delivery Service
|
0 / 0 |
(无) |
|
2127 |
P1167A Telephone Number
|
0 / 0 |
(无) |
|
2126 |
P1167B Lost Numbers
|
0 / 0 |
(无) |
|
2125 |
P1167C News Distribution
|
0 / 0 |
(无) |
|
2124 |
P1167D Bicolored RBS
|
0 / 0 |
(无) |
|
2123 |
P1167E Range Deleting
|
0 / 0 |
(无) |
|
2122 |
P1167F Scalar Queries
|
0 / 0 |
(无) |
|
2121 |
P1167G Low Budget Inception
|
0 / 0 |
(无) |
|
2120 |
P1168A Increasing by Modulo
|
0 / 0 |
(无) |
|
2119 |
P1168B Good Triple
|
0 / 0 |
(无) |
|
2118 |
P1168C And Reachability
|
0 / 0 |
(无) |
|
2117 |
P1168D Anagram Paths
|
0 / 0 |
(无) |
|
2116 |
P1168E Xor Permutations
|
0 / 0 |
(无) |
|
2115 |
P1169A Circle Metro
|
0 / 0 |
(无) |
|
2114 |
P1169B Pairs
|
0 / 0 |
(无) |
|
2113 |
P1170A Three Integers Again
|
0 / 0 |
(无) |
|
2112 |
P1170B Bad Days
|
0 / 0 |
(无) |
|
2111 |
P1170C Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
2110 |
P1170D Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
2109 |
P1170E Sliding Doors
|
0 / 0 |
(无) |
|
2108 |
P1170F Wheels
|
0 / 0 |
(无) |
|
2107 |
P1170G Graph Decomposition
|
0 / 0 |
(无) |
|
2106 |
P1170H Longest Saw
|
0 / 0 |
(无) |
|
2105 |
P1170I Good Subsets
|
0 / 0 |
(无) |
|
2104 |
P1172A Nauuo and Cards
|
0 / 0 |
(无) |
|
2103 |
P1172B Nauuo and Circle
|
0 / 0 |
(无) |
|
2102 |
P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
(无) |
|
2101 |
P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
(无) |
|
2100 |
P1172D Nauuo and Portals
|
0 / 0 |
(无) |
|
2099 |
P1172E Nauuo and ODT
|
0 / 0 |
(无) |
|
2098 |
P1172F Nauuo and Bug
|
0 / 0 |
(无) |