|
29062 |
codeforces#P926E
Merge Equal Elements
|
0 / 0 |
6 |
|
29067 |
codeforces#P926J
Segments
|
0 / 0 |
7 |
|
29079 |
codeforces#P930C
Teodor is not a liar!
|
0 / 0 |
6 |
|
29080 |
codeforces#P930D
Game with Tokens
|
0 / 0 |
9 |
|
29081 |
codeforces#P930E
Coins Exhibition
|
0 / 0 |
10 |
|
29086 |
codeforces#P932B
Recursive Queries
|
0 / 0 |
4 |
|
29090 |
codeforces#P932F
Escape Through Leaf
|
1 / 2 |
10 |
|
29104 |
codeforces#P935F
Fafa and Array
|
0 / 0 |
10 |
|
29114 |
codeforces#P938D
Buy a Ticket
|
1 / 1 |
7 |
|
29117 |
codeforces#P938G
Shortest Path Queries
|
2 / 8 |
10 |
|
29123 |
codeforces#P939F
Cutlet
|
1 / 2 |
9 |
|
29128 |
codeforces#P940E
Cashback
|
2 / 3 |
7 |
|
29129 |
codeforces#P940F
Machine Learning
|
0 / 1 |
10 |
|
29136 |
codeforces#P946G
Almost Increasing Array
|
0 / 0 |
9 |
|
29159 |
codeforces#P954G
Castle Defense
|
0 / 0 |
7 |
|
29173 |
codeforces#P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
29176 |
codeforces#P958C3
Encryption (hard)
|
0 / 0 |
9 |
|
29192 |
codeforces#P960B
Minimize the error
|
0 / 0 |
5 |
|
29196 |
codeforces#P960F
Pathwalks
|
0 / 0 |
7 |
|
29199 |
codeforces#P960H
Santa's Gift
|
0 / 0 |
10 |
|
29201 |
codeforces#P961B
Lecture Sleep
|
0 / 0 |
4 |
|
29204 |
codeforces#P961E
Tufurama
|
2 / 2 |
6 |
|
29210 |
codeforces#P962D
Merge Equals
|
1 / 1 |
5 |
|
29213 |
codeforces#P962G
Visible Black Areas
|
0 / 0 |
10 |
|
29225 |
codeforces#P965E
Short Code
|
0 / 0 |
8 |
|
29250 |
codeforces#P978F
Mentors
|
0 / 0 |
5 |
|
29255 |
codeforces#P979D
Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
29261 |
codeforces#P980E
The Number Games
|
0 / 0 |
8 |
|
29267 |
codeforces#P981E
Addition on Segments
|
0 / 0 |
8 |
|
29269 |
codeforces#P981G
Magic multisets
|
0 / 0 |
9 |
|
29270 |
codeforces#P981H
K Paths
|
0 / 0 |
10 |
|
29272 |
codeforces#P982B
Bus of Characters
|
0 / 0 |
4 |
|
29274 |
codeforces#P982D
Shark
|
0 / 0 |
6 |
|
29280 |
codeforces#P983D
Arkady and Rectangles
|
0 / 0 |
10 |
|
29281 |
codeforces#P983E
NN country
|
1 / 1 |
10 |
|
29288 |
codeforces#P985E
Pencils and Boxes
|
0 / 0 |
7 |
|
29295 |
codeforces#P986E
Prince's Problem
|
0 / 0 |
10 |
|
29328 |
codeforces#P992E
Nastya and King-Shamans
|
0 / 0 |
9 |
|
29339 |
codeforces#P995C
Leaving the Bar
|
0 / 1 |
8 |
|
29349 |
codeforces#P997E
Good Subsegments
|
1 / 1 |
10 |
|
29355 |
codeforces#P999D
Equalize the Remainders
|
0 / 0 |
6 |
|
29360 |
codeforces#P1000C
Covered Points Count
|
1 / 3 |
5 |
|
29363 |
codeforces#P1000F
One Occurrence
|
3 / 6 |
9 |
|
29364 |
codeforces#P1000G
Two-Paths
|
0 / 0 |
10 |
|
29400 |
codeforces#P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
29401 |
codeforces#P1004F
Sonya and Bitwise OR
|
0 / 1 |
10 |
|
29411 |
codeforces#P1006C
Three Parts of the Array
|
0 / 0 |
4 |
|
29415 |
codeforces#P1007A
Reorder the Array
|
0 / 0 |
4 |
|
29418 |
codeforces#P1007D
Ants
|
0 / 0 |
10 |
|
29427 |
codeforces#P1009F
Dominant Indices
|
3 / 7 |
8 |