|
|
3424 |
P1152D Neko and Aki's Prank
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3423 |
P1152E Neko and Flashback
|
0 / 0 |
9 |
|
|
3422 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3421 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3420 |
P1153A Serval and Bus
|
0 / 0 |
普及/提高- |
|
|
3419 |
P1153B Serval and Toy Bricks
|
0 / 0 |
普及+/提高 |
|
|
3418 |
P1153C Serval and Parenthesis Sequence
|
0 / 0 |
提高+/省选- |
|
|
3417 |
P1153D Serval and Rooted Tree
|
0 / 0 |
省选/NOI- |
|
|
3416 |
P1153E Serval and Snake
|
0 / 0 |
8 |
|
|
3415 |
P1153F Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3414 |
P1154A Restoring Three Numbers
|
0 / 0 |
普及/提高- |
|
|
3413 |
P1154B Make Them Equal
|
0 / 0 |
普及+/提高 |
|
|
3412 |
P1154C Gourmet Cat
|
0 / 0 |
普及+/提高 |
|
|
3411 |
P1154D Walking Robot
|
0 / 0 |
提高+/省选- |
|
|
3410 |
P1154E Two Teams
|
0 / 0 |
省选/NOI- |
|
|
3409 |
P1154F Shovels Shop
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3408 |
P1154G Minimum Possible LCM
|
0 / 0 |
8 |
|
|
3407 |
P1155A Reverse a Substring
|
0 / 0 |
普及/提高- |
|
|
3406 |
P1155B Game with Telephone Numbers
|
0 / 0 |
普及+/提高 |
|
|
3405 |
P1155C Alarm Clocks Everywhere
|
0 / 0 |
普及+/提高 |
|
|
3404 |
P1155D Beautiful Array
|
0 / 0 |
省选/NOI- |
|
|
3403 |
P1155E Guess the Root
|
0 / 0 |
8 |
|
|
3402 |
P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3401 |
P1156A Inscribed Figures
|
0 / 0 |
普及+/提高 |
|
|
3400 |
P1156B Ugly Pairs
|
0 / 0 |
省选/NOI- |
|
|
3399 |
P1156C Match Points
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3398 |
P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
3397 |
P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3396 |
P1156F Card Bag
|
0 / 0 |
8 |
|
|
3395 |
P1156G Optimizer
|
0 / 0 |
10 |
|
|
3394 |
P1157A Reachable Numbers
|
0 / 0 |
普及/提高- |
|
|
3393 |
P1157B Long Number
|
0 / 0 |
普及+/提高 |
|
|
3392 |
P1157C1 Increasing Subsequence (easy version)
|
0 / 0 |
普及+/提高 |
|
|
3391 |
P1157C2 Increasing Subsequence (hard version)
|
0 / 0 |
提高+/省选- |
|
|
3390 |
P1157D N Problems During K Days
|
0 / 0 |
省选/NOI- |
|
|
3389 |
P1157E Minimum Array
|
0 / 0 |
提高+/省选- |
|
|
3388 |
P1157F Maximum Balanced Circle
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3387 |
P1157G Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
3386 |
P1158A The Party and Sweets
|
0 / 0 |
提高+/省选- |
|
|
3385 |
P1158B The minimal unique substring
|
0 / 0 |
8 |
|
|
3384 |
P1158C Permutation recovery
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3383 |
P1158D Winding polygonal line
|
0 / 0 |
10 |
|
|
3382 |
P1158E Strange device
|
0 / 0 |
10 |
|
|
3381 |
P1158F Density of subarrays
|
0 / 0 |
10 |
|
|
3380 |
P1159A A pile of stones
|
0 / 0 |
普及/提高- |
|
|
3379 |
P1159B Expansion coefficient of the array
|
0 / 0 |
普及+/提高 |
|
|
3378 |
P1160A2 Collaboration
|
0 / 0 |
暂无评定 |
|
|
3377 |
P1162A Zoning Restrictions Again
|
0 / 0 |
普及/提高- |
|
|
3376 |
P1162B Double Matrix
|
0 / 0 |
普及+/提高 |
|
|
3375 |
P1163A Eating Soup
|
0 / 0 |
普及/提高- |
