|
|
1134 |
P1530H
Turing's Award
|
0 / 0 |
10 |
|
|
1035 |
P1548E
Gregor and the Two Painters
|
0 / 0 |
10 |
|
|
1010 |
P1552I
Organizing a Music Festival
|
0 / 0 |
10 |
|
|
1001 |
P1553I
Stairs
|
0 / 0 |
10 |
|
|
911 |
P1572F
Stations
|
0 / 0 |
10 |
|
|
863 |
P1580E
Railway Construction
|
0 / 0 |
10 |
|
|
780 |
P1601F
Two Sorts
|
0 / 0 |
10 |
|
|
595 |
P1630F
Making It Bipartite
|
0 / 0 |
10 |
|
|
300 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
252 |
P1693E
Outermost Maximums
|
0 / 0 |
10 |
|
|
251 |
P1693F
I Might Be Wrong
|
1 / 1 |
10 |
|
|
151 |
P1710D
Recover the Tree
|
0 / 0 |
10 |
|
|
8263 |
P1764H
Doremy's Paint 2
|
0 / 0 |
10 |
|
|
8378 |
P1784F
Minimums or Medians
|
0 / 0 |
10 |
|
|
8366 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
8416 |
P1801G
A task for substrings
|
0 / 0 |
10 |
|
|
8542 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
|
8491 |
P1827E
Bus Routes
|
0 / 0 |
10 |
|
|
8655 |
P1844H
Multiple of Three Cycles
|
0 / 0 |
10 |
|
|
8610 |
P1852E
Rivalries
|
0 / 0 |
10 |
|
|
8937 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |