|
1708 |
P1530H
Turing's Award
|
0 / 0 |
10 |
|
1609 |
P1548E
Gregor and the Two Painters
|
0 / 0 |
10 |
|
1584 |
P1552I
Organizing a Music Festival
|
0 / 0 |
10 |
|
1575 |
P1553I
Stairs
|
0 / 0 |
10 |
|
1485 |
P1572F
Stations
|
0 / 0 |
10 |
|
1437 |
P1580E
Railway Construction
|
0 / 0 |
10 |
|
1354 |
P1601F
Two Sorts
|
0 / 0 |
10 |
|
1169 |
P1630F
Making It Bipartite
|
0 / 0 |
10 |
|
874 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
826 |
P1693E
Outermost Maximums
|
0 / 0 |
10 |
|
825 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
714 |
P1710D
Recover the Tree
|
0 / 0 |
10 |
|
415 |
P1764H
Doremy's Paint 2
|
0 / 0 |
10 |
|
376 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
279 |
P1784F
Minimums or Medians
|
0 / 0 |
10 |
|
267 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
172 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
91 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
40 |
P1827E
Bus Routes
|
0 / 0 |
10 |
|
4814 |
P1852E
Rivalries
|
0 / 0 |
10 |
|
9022 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |