|
2180 |
P1151E
Number of Components
|
0 / 0 |
(无) |
|
2179 |
P1151F
Sonya and Informatics
|
0 / 0 |
(无) |
|
2178 |
P1152A
Neko Finds Grapes
|
0 / 0 |
(无) |
|
2177 |
P1152B
Neko Performs Cat Furrier Transform
|
0 / 0 |
(无) |
|
2176 |
P1152C
Neko does Maths
|
0 / 0 |
(无) |
|
2175 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
(无) |
|
2174 |
P1152E
Neko and Flashback
|
0 / 0 |
(无) |
|
2173 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
(无) |
|
2172 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
(无) |
|
2171 |
P1153A
Serval and Bus
|
0 / 0 |
(无) |
|
2170 |
P1153B
Serval and Toy Bricks
|
0 / 0 |
(无) |
|
2169 |
P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
(无) |
|
2168 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
(无) |
|
2167 |
P1153E
Serval and Snake
|
0 / 0 |
(无) |
|
2166 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
(无) |
|
2165 |
P1154A
Restoring Three Numbers
|
0 / 0 |
(无) |
|
2164 |
P1154B
Make Them Equal
|
0 / 0 |
(无) |
|
2163 |
P1154C
Gourmet Cat
|
0 / 0 |
(无) |
|
2162 |
P1154D
Walking Robot
|
0 / 0 |
(无) |
|
2161 |
P1154E
Two Teams
|
0 / 0 |
(无) |
|
2160 |
P1154F
Shovels Shop
|
0 / 0 |
(无) |
|
2159 |
P1154G
Minimum Possible LCM
|
0 / 0 |
(无) |
|
2158 |
P1155A
Reverse a Substring
|
0 / 0 |
(无) |
|
2157 |
P1155B
Game with Telephone Numbers
|
0 / 0 |
(无) |
|
2156 |
P1155C
Alarm Clocks Everywhere
|
0 / 0 |
(无) |
|
2155 |
P1155D
Beautiful Array
|
0 / 0 |
(无) |
|
2154 |
P1155E
Guess the Root
|
0 / 0 |
(无) |
|
2153 |
P1155F
Delivery Oligopoly
|
0 / 0 |
(无) |
|
2152 |
P1156A
Inscribed Figures
|
0 / 0 |
(无) |
|
2151 |
P1156B
Ugly Pairs
|
0 / 0 |
(无) |
|
2150 |
P1156C
Match Points
|
0 / 0 |
(无) |
|
2149 |
P1156D
0-1-Tree
|
0 / 0 |
(无) |
|
2148 |
P1156E
Special Segments of Permutation
|
0 / 0 |
(无) |
|
2147 |
P1156F
Card Bag
|
0 / 0 |
(无) |
|
2146 |
P1156G
Optimizer
|
0 / 0 |
(无) |
|
2145 |
P1157A
Reachable Numbers
|
0 / 0 |
(无) |
|
2144 |
P1157B
Long Number
|
0 / 0 |
(无) |
|
2143 |
P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
(无) |
|
2142 |
P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
(无) |
|
2141 |
P1157D
N Problems During K Days
|
0 / 0 |
(无) |
|
2140 |
P1157E
Minimum Array
|
0 / 0 |
(无) |
|
2139 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
(无) |
|
2138 |
P1157G
Inverse of Rows and Columns
|
0 / 0 |
(无) |
|
2137 |
P1158A
The Party and Sweets
|
0 / 0 |
(无) |
|
2136 |
P1158B
The minimal unique substring
|
0 / 0 |
(无) |
|
2135 |
P1158C
Permutation recovery
|
0 / 0 |
(无) |
|
2134 |
P1158D
Winding polygonal line
|
0 / 0 |
(无) |
|
2133 |
P1158E
Strange device
|
0 / 0 |
(无) |
|
2132 |
P1158F
Density of subarrays
|
0 / 0 |
(无) |
|
2131 |
P1159A
A pile of stones
|
0 / 0 |
(无) |