|
2410 |
P1151E Number of Components
|
0 / 0 |
(无) |
|
2409 |
P1151F Sonya and Informatics
|
0 / 0 |
(无) |
|
2408 |
P1152A Neko Finds Grapes
|
0 / 0 |
(无) |
|
2407 |
P1152B Neko Performs Cat Furrier Transform
|
0 / 0 |
(无) |
|
2406 |
P1152C Neko does Maths
|
0 / 0 |
(无) |
|
2405 |
P1152D Neko and Aki's Prank
|
0 / 0 |
(无) |
|
2404 |
P1152E Neko and Flashback
|
0 / 0 |
(无) |
|
2403 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
(无) |
|
2402 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
(无) |
|
2401 |
P1153A Serval and Bus
|
0 / 0 |
(无) |
|
2400 |
P1153B Serval and Toy Bricks
|
0 / 0 |
(无) |
|
2399 |
P1153C Serval and Parenthesis Sequence
|
0 / 0 |
(无) |
|
2398 |
P1153D Serval and Rooted Tree
|
0 / 0 |
(无) |
|
2397 |
P1153E Serval and Snake
|
0 / 0 |
(无) |
|
2396 |
P1153F Serval and Bonus Problem
|
0 / 0 |
(无) |
|
2395 |
P1154A Restoring Three Numbers
|
0 / 0 |
(无) |
|
2394 |
P1154B Make Them Equal
|
0 / 0 |
(无) |
|
2393 |
P1154C Gourmet Cat
|
0 / 0 |
(无) |
|
2392 |
P1154D Walking Robot
|
0 / 0 |
(无) |
|
2391 |
P1154E Two Teams
|
0 / 0 |
(无) |
|
2390 |
P1154F Shovels Shop
|
0 / 0 |
(无) |
|
2389 |
P1154G Minimum Possible LCM
|
0 / 0 |
(无) |
|
2388 |
P1155A Reverse a Substring
|
0 / 0 |
(无) |
|
2387 |
P1155B Game with Telephone Numbers
|
0 / 0 |
(无) |
|
2386 |
P1155C Alarm Clocks Everywhere
|
0 / 0 |
(无) |
|
2385 |
P1155D Beautiful Array
|
0 / 0 |
(无) |
|
2384 |
P1155E Guess the Root
|
0 / 0 |
(无) |
|
2383 |
P1155F Delivery Oligopoly
|
0 / 0 |
(无) |
|
2382 |
P1156A Inscribed Figures
|
0 / 0 |
(无) |
|
2381 |
P1156B Ugly Pairs
|
0 / 0 |
(无) |
|
2380 |
P1156C Match Points
|
0 / 0 |
(无) |
|
2379 |
P1156D 0-1-Tree
|
0 / 0 |
(无) |
|
2378 |
P1156E Special Segments of Permutation
|
0 / 0 |
(无) |
|
2377 |
P1156F Card Bag
|
0 / 0 |
(无) |
|
2376 |
P1156G Optimizer
|
0 / 0 |
(无) |
|
2375 |
P1157A Reachable Numbers
|
0 / 0 |
(无) |
|
2374 |
P1157B Long Number
|
0 / 0 |
(无) |
|
2373 |
P1157C1 Increasing Subsequence (easy version)
|
0 / 0 |
(无) |
|
2372 |
P1157C2 Increasing Subsequence (hard version)
|
0 / 0 |
(无) |
|
2371 |
P1157D N Problems During K Days
|
0 / 0 |
(无) |
|
2370 |
P1157E Minimum Array
|
0 / 0 |
(无) |
|
2369 |
P1157F Maximum Balanced Circle
|
0 / 0 |
(无) |
|
2368 |
P1157G Inverse of Rows and Columns
|
0 / 0 |
(无) |
|
2367 |
P1158A The Party and Sweets
|
0 / 0 |
(无) |
|
2366 |
P1158B The minimal unique substring
|
0 / 0 |
(无) |
|
2365 |
P1158C Permutation recovery
|
0 / 0 |
(无) |
|
2364 |
P1158D Winding polygonal line
|
0 / 0 |
(无) |
|
2363 |
P1158E Strange device
|
0 / 0 |
(无) |
|
2362 |
P1158F Density of subarrays
|
0 / 0 |
(无) |
|
2361 |
P1159A A pile of stones
|
0 / 0 |
(无) |