|
|
2510 |
P1521E
Nastia and a Beautiful Matrix
|
0 / 0 |
10 |
|
|
2407 |
P1540C1
Converging Array (Easy Version)
|
0 / 0 |
10 |
|
|
2396 |
P1542E2
Abnormal Permutation Pairs (hard version)
|
0 / 0 |
10 |
|
|
2390 |
P1543E
The Final Pursuit
|
0 / 0 |
10 |
|
|
2360 |
P1550F
Jumping Around
|
0 / 0 |
10 |
|
|
2336 |
P1553G
Common Divisor Graph
|
0 / 0 |
10 |
|
|
2323 |
P1555F
Good Graph
|
0 / 0 |
10 |
|
|
2266 |
P1567F
One-Four Overload
|
0 / 0 |
10 |
|
|
2247 |
P1572C
Paint
|
0 / 0 |
10 |
|
|
2236 |
P1574F
Occurrences
|
0 / 0 |
10 |
|
|
2209 |
P1578M
The Mind
|
0 / 0 |
10 |
|
|
2126 |
P1599F
Mars
|
0 / 0 |
10 |
|
|
2125 |
P1599G
Shortest path
|
0 / 0 |
10 |
|
|
2123 |
P1599I
Desert
|
0 / 0 |
10 |
|
|
2115 |
P1601D
Difficult Mountain
|
0 / 0 |
10 |
|
|
2105 |
P1603F
October 18, 2017
|
0 / 0 |
10 |
|
|
2010 |
P1617E
Christmas Chocolates
|
0 / 0 |
10 |
|
|
1982 |
P1621F
Strange Instructions
|
0 / 0 |
10 |
|
|
1943 |
P1627F
Not Splitting
|
0 / 0 |
10 |
|
|
1920 |
P1632E2
Distance Tree (hard version)
|
0 / 0 |
10 |
|
|
1907 |
P1634F
Fibonacci Additions
|
0 / 0 |
10 |
|
|
1908 |
P1634F
Fibonacci Additions
|
0 / 0 |
10 |
|
|
1864 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
|
1791 |
P1658F
Juju and Binary String
|
0 / 0 |
10 |
|
|
1704 |
P1671F
Permutation Counting
|
0 / 0 |
10 |
|
|
1695 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
1633 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1632 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1567 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
|
1446 |
P1715F
Crop Squares
|
0 / 0 |
10 |
|
|
1418 |
P1720E
Misha and Paintings
|
0 / 0 |
10 |
|
|
1377 |
P1728G
Illumination
|
0 / 0 |
10 |
|
|
1365 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
1364 |
P1730F
Almost Sorted
|
0 / 0 |
10 |
|
|
1345 |
P1733E
Conveyor
|
0 / 0 |
10 |
|
|
1238 |
P1750F
Majority
|
0 / 0 |
10 |
|
|
1111 |
P1774F2
Magician and Pigs (Hard Version)
|
0 / 0 |
10 |
|
|
1056 |
P1781F
Bracket Insertion
|
0 / 0 |
10 |
|
|
1016 |
P1789F
Serval and Brain Power
|
0 / 0 |
10 |
|
|
995 |
P1792F1
Graph Coloring (easy version)
|
0 / 0 |
10 |
|
|
976 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
951 |
P1799F
Halve or Subtract
|
0 / 0 |
10 |
|
|
934 |
P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
|
925 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
855 |
P1814F
Communication Towers
|
0 / 0 |
10 |
|
|
843 |
P1817D
Toy Machine
|
0 / 0 |
10 |
|
|
713 |
P1841F
Monocarp and a Strategic Game
|
0 / 0 |
10 |
|
|
656 |
P1849F
XOR Partition
|
0 / 0 |
10 |
|
|
618 |
P1856E2
PermuTree (hard version)
|
0 / 0 |
10 |
|
|
557 |
P1866E
Elevators of Tamem
|
0 / 0 |
10 |
|
|
542 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
|
442 |
P1887D
Split
|
0 / 0 |
10 |
|
|
314 |
P1910G
Pool Records
|
0 / 0 |
10 |
|
|
312 |
P1910I
Inverse Problem
|
0 / 0 |
10 |
|
|
269 |
P1916H1
Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
|
268 |
P1916H2
Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
|
255 |
P1918G
Permutation of Given
|
0 / 0 |
10 |
|
|
216 |
P1924D
Balanced Subsequences
|
0 / 0 |
10 |
|
|
178 |
P1930F
Maximize the Difference
|
0 / 0 |
10 |
|
|
99 |
P1942F
Farmer John's Favorite Function
|
0 / 0 |
10 |
|
|
9 |
P1956E2
Nene vs
|
0 / 0 |
10 |
