|
|
4568 |
P1152C
Neko does Maths
|
0 / 0 |
6 |
|
|
4567 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
4566 |
P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
|
4565 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
4564 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
4563 |
P1153A
Serval and Bus
|
0 / 0 |
3 |
|
|
4562 |
P1153B
Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
4561 |
P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
4560 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
4559 |
P1153E
Serval and Snake
|
0 / 0 |
8 |
|
|
4558 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
4557 |
P1154A
Restoring Three Numbers
|
0 / 0 |
3 |
|
|
4556 |
P1154B
Make Them Equal
|
0 / 0 |
4 |
|
|
4555 |
P1154C
Gourmet Cat
|
0 / 0 |
4 |
|
|
4554 |
P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
4553 |
P1154E
Two Teams
|
0 / 0 |
6 |
|
|
4552 |
P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
4551 |
P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
4550 |
P1155A
Reverse a Substring
|
0 / 0 |
3 |
|
|
4549 |
P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
4548 |
P1155C
Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
4547 |
P1155D
Beautiful Array
|
0 / 0 |
6 |
|
|
4546 |
P1155E
Guess the Root
|
0 / 0 |
8 |
|
|
4545 |
P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
4544 |
P1156A
Inscribed Figures
|
0 / 0 |
4 |
|
|
4543 |
P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
4542 |
P1156C
Match Points
|
0 / 0 |
7 |
|
|
4541 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
4540 |
P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
4539 |
P1156F
Card Bag
|
0 / 0 |
8 |
|
|
4538 |
P1156G
Optimizer
|
0 / 0 |
10 |
|
|
4537 |
P1157A
Reachable Numbers
|
0 / 0 |
3 |
|
|
4536 |
P1157B
Long Number
|
0 / 0 |
4 |
|
|
4535 |
P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
4534 |
P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
4533 |
P1157D
N Problems During K Days
|
0 / 0 |
6 |
|
|
4532 |
P1157E
Minimum Array
|
0 / 0 |
5 |
|
|
4531 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
4530 |
P1157G
Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
4529 |
P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
4528 |
P1158B
The minimal unique substring
|
0 / 0 |
8 |
|
|
4527 |
P1158C
Permutation recovery
|
0 / 0 |
7 |
|
|
4526 |
P1158D
Winding polygonal line
|
0 / 0 |
10 |
|
|
4525 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
4524 |
P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
4523 |
P1159A
A pile of stones
|
0 / 0 |
3 |
|
|
4522 |
P1159B
Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
4521 |
P1160A2
Collaboration
|
0 / 0 |
(None) |
|
|
4520 |
P1162A
Zoning Restrictions Again
|
0 / 0 |
3 |
|
|
4519 |
P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
4518 |
P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
4517 |
P1163B1
Cat Party (Easy Edition)
|
0 / 0 |
5 |
|
|
4516 |
P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
4515 |
P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
4514 |
P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
4513 |
P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
4512 |
P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
4511 |
P1163F
Indecisive Taxi Fee
|
0 / 0 |
10 |
|
|
4510 |
P1165A
Remainder
|
0 / 0 |
3 |
|
|
4509 |
P1165B
Polycarp Training
|
0 / 0 |
3 |
|
|
4508 |
P1165C
Good String
|
0 / 0 |
4 |
|
|
4507 |
P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
4506 |
P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
4505 |
P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
4504 |
P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
4503 |
P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
4502 |
P1166B
All the Vowels Please
|
0 / 0 |
3 |
|
|
4501 |
P1166C
A Tale of Two Lands
|
0 / 0 |
5 |
|
|
4500 |
P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
4499 |
P1166E
The LCMs Must be Large
|
0 / 0 |
7 |
|
|
4498 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
4497 |
P1167A
Telephone Number
|
0 / 0 |
3 |
|
|
4496 |
P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
4495 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
|
4494 |
P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
4493 |
P1167E
Range Deleting
|
0 / 0 |
7 |
|
|
4492 |
P1167F
Scalar Queries
|
0 / 0 |
8 |
|
|
4491 |
P1167G
Low Budget Inception
|
0 / 0 |
10 |
|
|
4490 |
P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
4489 |
P1168B
Good Triple
|
0 / 0 |
6 |
|
|
4488 |
P1168C
And Reachability
|
0 / 0 |
8 |
|
|
4487 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
4486 |
P1168E
Xor Permutations
|
0 / 0 |
10 |
|
|
4485 |
P1169A
Circle Metro
|
0 / 0 |
3 |
|
|
4484 |
P1169B
Pairs
|
0 / 0 |
5 |
|
|
4483 |
P1170A
Three Integers Again
|
0 / 0 |
(None) |
|
|
4482 |
P1170B
Bad Days
|
0 / 0 |
(None) |
|
|
4481 |
P1170C
Minus and Minus Give Plus
|
0 / 0 |
(None) |
|
|
4480 |
P1170D
Decoding of Integer Sequences
|
0 / 0 |
(None) |
|
|
4479 |
P1170E
Sliding Doors
|
0 / 0 |
(None) |
|
|
4478 |
P1170F
Wheels
|
0 / 0 |
(None) |
|
|
4477 |
P1170G
Graph Decomposition
|
0 / 0 |
(None) |
|
|
4476 |
P1170H
Longest Saw
|
0 / 0 |
(None) |
|
|
4475 |
P1170I
Good Subsets
|
0 / 0 |
(None) |
|
|
4474 |
P1172A
Nauuo and Cards
|
0 / 0 |
6 |
|
|
4473 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
4472 |
P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
4471 |
P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
4470 |
P1172D
Nauuo and Portals
|
0 / 0 |
10 |
|
|
4469 |
P1172E
Nauuo and ODT
|
0 / 0 |
10 |
