|
|
2895 |
P1450C1
Errich-Tac-Toe (Easy Version)
|
0 / 0 |
7 |
|
|
2862 |
P1454F
Array Partition
|
0 / 0 |
7 |
|
|
2820 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2778 |
P1472F
New Year's Puzzle
|
0 / 0 |
7 |
|
|
2777 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2738 |
P1479B2
Painting the Array II
|
0 / 0 |
7 |
|
|
2722 |
P1482E
Skyline Photo
|
0 / 0 |
7 |
|
|
2708 |
P1486D
Max Median
|
0 / 0 |
7 |
|
|
2664 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
|
2631 |
P1499D
The Number of Pairs
|
0 / 0 |
7 |
|
|
2583 |
P1510D
Digits
|
0 / 0 |
7 |
|
|
2571 |
P1511E
Colorings and Dominoes
|
0 / 0 |
7 |
|
|
2538 |
P1516D
Cut
|
0 / 0 |
7 |
|
|
2497 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
|
2470 |
P1530E
Minimax
|
0 / 0 |
7 |
|
|
2418 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
|
2416 |
P1538G
Gift Set
|
0 / 0 |
7 |
|
|
2374 |
P1547G
How Many Paths?
|
0 / 0 |
7 |
|
|
2354 |
P1551D2
Domino (hard version)
|
0 / 0 |
7 |
|
|
2338 |
P1553E
Permutation Shift
|
0 / 0 |
7 |
|
|
2324 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
|
2291 |
P1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
|
2224 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
|
2147 |
P1593F
Red-Black Number
|
0 / 0 |
7 |
|
|
2134 |
P1598E
Staircases
|
0 / 0 |
7 |
|
|
2124 |
P1599H
Hidden Fortress
|
0 / 0 |
7 |
|
|
2099 |
P1605D
Treelabeling
|
0 / 0 |
7 |
|
|
2092 |
P1606E
Arena
|
0 / 0 |
7 |
|
|
2034 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
1984 |
P1621D
The Winter Hike
|
0 / 0 |
7 |
|
|
1951 |
P1626D
Martial Arts Tournament
|
0 / 0 |
7 |
|
|
1939 |
P1628D1
Game on Sum (Easy Version)
|
0 / 0 |
7 |
|
|
1893 |
P1637E
Best Pair
|
0 / 0 |
7 |
|
|
1827 |
P1650G
Counting Shortcuts
|
0 / 0 |
7 |
|
|
1817 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
1778 |
P1660F2
Promising String (hard version)
|
0 / 0 |
7 |
|
|
1734 |
P1666J
Job Lookup
|
0 / 0 |
7 |
|
|
1730 |
P1667B
Optimal Partition
|
0 / 0 |
7 |
|
|
1705 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
1627 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1477 |
P1710B
Rain
|
0 / 0 |
7 |
|
|
1399 |
P1725F
Field Photography
|
0 / 0 |
7 |
|
|
1370 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
|
1354 |
P1732C2
Sheikh (Hard Version)
|
0 / 0 |
7 |
|
|
1340 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
1252 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
1203 |
P1761D
Carry Bit
|
0 / 0 |
7 |
|
|
1195 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
1153 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
1132 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
1103 |
P1775E
The Human Equation
|
0 / 0 |
7 |
|
|
1095 |
P1776G
Another Wine Tasting Event
|
0 / 0 |
7 |
|
|
1078 |
P1778D
Flexible String Revisit
|
0 / 0 |
7 |
|
|
1032 |
P1787E
The Harmonization of XOR
|
0 / 0 |
7 |
|
|
1010 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
953 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
936 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
897 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
882 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
873 |
P1811F
Is It Flower?
|
0 / 0 |
7 |
|
|
872 |
P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
|
826 |
P1821E
Rearrange Brackets
|
0 / 0 |
7 |
|
|
768 |
P1832D1
Red-Blue Operations (Easy Version)
|
0 / 0 |
7 |
|
|
734 |
P1838D
Bracket Walk
|
0 / 0 |
7 |
|
|
728 |
P1839D
Ball Sorting
|
0 / 0 |
7 |
|
|
620 |
P1856D
More Wrong
|
0 / 0 |
7 |
|
|
575 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
|
566 |
P1864E
Guess Game
|
0 / 0 |
7 |
|
|
555 |
P1866G
Grouped Carriages
|
0 / 0 |
7 |
|
|
554 |
P1866H
Happy Sets
|
0 / 0 |
7 |
|
|
539 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
|
497 |
P1876C
Autosynthesis
|
0 / 0 |
7 |
|
|
453 |
P1884D
Counting Rhyme
|
0 / 0 |
7 |
|
|
447 |
P1886D
Monocarp and the Set
|
0 / 0 |
7 |
|
|
406 |
P1896E
Permutation Sorting
|
0 / 0 |
7 |
|
|
384 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
345 |
P1906F
Maximize The Value
|
0 / 0 |
7 |
|
|
341 |
P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
|
316 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
309 |
P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
295 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
285 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
251 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
241 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
218 |
P1924B
Space Harbour
|
0 / 0 |
7 |
|
|
180 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
7 |
|
|
155 |
P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
7 |
|
|
150 |
P1934D1
XOR Break — Solo Version
|
0 / 0 |
7 |
|
|
101 |
P1942D
Learning to Paint
|
0 / 0 |
7 |
|
|
68 |
P1948E
Clique Partition
|
0 / 0 |
7 |
|
|
9512 |
P1971H
±1
|
0 / 0 |
7 |
|
|
9492 |
P1975E
Chain Queries
|
0 / 0 |
7 |
