|
|
3444 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3443 |
P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
|
3442 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3441 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3440 |
P1153A
Serval and Bus
|
0 / 0 |
3 |
|
|
3439 |
P1153B
Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
3438 |
P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
3437 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3436 |
P1153E
Serval and Snake
|
0 / 0 |
8 |
|
|
3435 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3434 |
P1154A
Restoring Three Numbers
|
0 / 0 |
3 |
|
|
3433 |
P1154B
Make Them Equal
|
0 / 0 |
4 |
|
|
3432 |
P1154C
Gourmet Cat
|
0 / 0 |
4 |
|
|
3431 |
P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
3430 |
P1154E
Two Teams
|
0 / 0 |
6 |
|
|
3429 |
P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
3428 |
P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
3427 |
P1155A
Reverse a Substring
|
0 / 0 |
3 |
|
|
3426 |
P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
3425 |
P1155C
Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
3424 |
P1155D
Beautiful Array
|
0 / 0 |
6 |
|
|
3423 |
P1155E
Guess the Root
|
0 / 0 |
8 |
|
|
3422 |
P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3421 |
P1156A
Inscribed Figures
|
0 / 0 |
4 |
|
|
3420 |
P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
3419 |
P1156C
Match Points
|
0 / 0 |
7 |
|
|
3418 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3417 |
P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3416 |
P1156F
Card Bag
|
0 / 0 |
8 |
|
|
3415 |
P1156G
Optimizer
|
0 / 0 |
10 |
|
|
3414 |
P1157A
Reachable Numbers
|
0 / 0 |
3 |
|
|
3413 |
P1157B
Long Number
|
0 / 0 |
4 |
|
|
3412 |
P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
3411 |
P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
3410 |
P1157D
N Problems During K Days
|
0 / 0 |
6 |
|
|
3409 |
P1157E
Minimum Array
|
0 / 0 |
5 |
|
|
3408 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3407 |
P1157G
Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
3406 |
P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
3405 |
P1158B
The minimal unique substring
|
0 / 0 |
8 |
|
|
3404 |
P1158C
Permutation recovery
|
0 / 0 |
7 |
|
|
3403 |
P1158D
Winding polygonal line
|
0 / 0 |
10 |
|
|
3402 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
3401 |
P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
3400 |
P1159A
A pile of stones
|
0 / 0 |
3 |
|
|
3399 |
P1159B
Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
3398 |
P1160A2
Collaboration
|
0 / 0 |
(无) |
|
|
3397 |
P1162A
Zoning Restrictions Again
|
0 / 0 |
3 |
|
|
3396 |
P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
3395 |
P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
3394 |
P1163B1
Cat Party (Easy Edition)
|
0 / 0 |
5 |
|
|
3393 |
P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
3392 |
P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
3391 |
P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
3390 |
P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
3389 |
P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
3388 |
P1163F
Indecisive Taxi Fee
|
0 / 0 |
10 |
|
|
3387 |
P1165A
Remainder
|
0 / 0 |
3 |
|
|
3386 |
P1165B
Polycarp Training
|
0 / 0 |
3 |
|
|
3385 |
P1165C
Good String
|
0 / 0 |
4 |
|
|
3384 |
P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
3383 |
P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
3382 |
P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
3381 |
P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
3380 |
P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
3379 |
P1166B
All the Vowels Please
|
0 / 0 |
3 |
|
|
3378 |
P1166C
A Tale of Two Lands
|
0 / 0 |
5 |
|
|
3377 |
P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
3376 |
P1166E
The LCMs Must be Large
|
0 / 0 |
7 |
|
|
3375 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
3374 |
P1167A
Telephone Number
|
0 / 0 |
3 |
|
|
3373 |
P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
3372 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
|
3371 |
P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
3370 |
P1167E
Range Deleting
|
0 / 0 |
7 |
|
|
3369 |
P1167F
Scalar Queries
|
0 / 0 |
8 |
|
|
3368 |
P1167G
Low Budget Inception
|
0 / 0 |
10 |
|
|
3367 |
P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
3366 |
P1168B
Good Triple
|
0 / 0 |
6 |
|
|
3365 |
P1168C
And Reachability
|
0 / 0 |
8 |
|
|
3364 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3363 |
P1168E
Xor Permutations
|
0 / 0 |
10 |
|
|
3362 |
P1169A
Circle Metro
|
0 / 0 |
3 |
|
|
3361 |
P1169B
Pairs
|
0 / 0 |
5 |
|
|
3360 |
P1170A
Three Integers Again
|
0 / 0 |
(无) |
|
|
3359 |
P1170B
Bad Days
|
0 / 0 |
(无) |
|
|
3358 |
P1170C
Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
|
3357 |
P1170D
Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
|
3356 |
P1170E
Sliding Doors
|
0 / 0 |
(无) |
|
|
3355 |
P1170F
Wheels
|
0 / 0 |
(无) |
|
|
3354 |
P1170G
Graph Decomposition
|
0 / 0 |
(无) |
|
|
3353 |
P1170H
Longest Saw
|
0 / 0 |
(无) |
|
|
3352 |
P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
3351 |
P1172A
Nauuo and Cards
|
0 / 0 |
6 |
|
|
3350 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3349 |
P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3348 |
P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3347 |
P1172D
Nauuo and Portals
|
0 / 0 |
10 |
|
|
3346 |
P1172E
Nauuo and ODT
|
0 / 0 |
10 |
|
|
3345 |
P1172F
Nauuo and Bug
|
0 / 0 |
10 |
