|
|
1935 |
P1450C1
Errich-Tac-Toe (Easy Version)
|
0 / 0 |
7 |
|
|
1902 |
P1454F
Array Partition
|
0 / 0 |
7 |
|
|
1860 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
1818 |
P1472F
New Year's Puzzle
|
0 / 0 |
7 |
|
|
1817 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
1778 |
P1479B2
Painting the Array II
|
0 / 0 |
7 |
|
|
1762 |
P1482E
Skyline Photo
|
0 / 0 |
7 |
|
|
1748 |
P1486D
Max Median
|
0 / 0 |
7 |
|
|
1704 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
|
1671 |
P1499D
The Number of Pairs
|
0 / 0 |
7 |
|
|
1623 |
P1510D
Digits
|
0 / 0 |
7 |
|
|
1611 |
P1511E
Colorings and Dominoes
|
0 / 0 |
7 |
|
|
1578 |
P1516D
Cut
|
0 / 0 |
7 |
|
|
1537 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
|
1510 |
P1530E
Minimax
|
0 / 0 |
7 |
|
|
1458 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
|
1456 |
P1538G
Gift Set
|
0 / 0 |
7 |
|
|
1414 |
P1547G
How Many Paths?
|
0 / 0 |
7 |
|
|
1394 |
P1551D2
Domino (hard version)
|
0 / 0 |
7 |
|
|
1378 |
P1553E
Permutation Shift
|
0 / 0 |
7 |
|
|
1364 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
|
1331 |
P1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
|
1264 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
|
1187 |
P1593F
Red-Black Number
|
0 / 0 |
7 |
|
|
1174 |
P1598E
Staircases
|
0 / 0 |
7 |
|
|
1164 |
P1599H
Hidden Fortress
|
0 / 0 |
7 |
|
|
1139 |
P1605D
Treelabeling
|
0 / 0 |
7 |
|
|
1132 |
P1606E
Arena
|
0 / 0 |
7 |
|
|
1074 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
1024 |
P1621D
The Winter Hike
|
0 / 0 |
7 |
|
|
991 |
P1626D
Martial Arts Tournament
|
0 / 0 |
7 |
|
|
979 |
P1628D1
Game on Sum (Easy Version)
|
0 / 0 |
7 |
|
|
937 |
P1637E
Best Pair
|
0 / 0 |
7 |
|
|
876 |
P1650G
Counting Shortcuts
|
0 / 0 |
7 |
|
|
866 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
827 |
P1660F2
Promising String (hard version)
|
0 / 0 |
7 |
|
|
783 |
P1666J
Job Lookup
|
0 / 0 |
7 |
|
|
779 |
P1667B
Optimal Partition
|
0 / 0 |
7 |
|
|
754 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
676 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
526 |
P1710B
Rain
|
0 / 0 |
7 |
|
|
448 |
P1725F
Field Photography
|
0 / 0 |
7 |
|
|
419 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
|
403 |
P1732C2
Sheikh (Hard Version)
|
0 / 0 |
7 |
|
|
389 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
301 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
252 |
P1761D
Carry Bit
|
0 / 0 |
7 |
|
|
244 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
202 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
181 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
152 |
P1775E
The Human Equation
|
0 / 0 |
7 |
|
|
144 |
P1776G
Another Wine Tasting Event
|
0 / 0 |
7 |
|
|
127 |
P1778D
Flexible String Revisit
|
0 / 0 |
7 |
|
|
81 |
P1787E
The Harmonization of XOR
|
0 / 0 |
7 |
|
|
59 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
7788 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
7773 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
8552 |
P1811F
Is It Flower?
|
0 / 0 |
7 |
|
|
8551 |
P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
|
8573 |
P1821E
Rearrange Brackets
|
0 / 0 |
7 |
|
|
8610 |
P1832D1
Red-Blue Operations (Easy Version)
|
0 / 0 |
7 |
|
|
8681 |
P1838D
Bracket Walk
|
0 / 0 |
7 |
|
|
8675 |
P1839D
Ball Sorting
|
0 / 0 |
7 |
|
|
9058 |
P1896E
Permutation Sorting
|
0 / 0 |
7 |
|
|
9036 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
8999 |
P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
|
9108 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
9087 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
9077 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
9134 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
9169 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
9388 |
P1942D
Learning to Paint
|
0 / 0 |
7 |
|
|
9426 |
P1970B2
Exact Neighbours (Medium)
|
0 / 0 |
7 |
|
|
9421 |
P1970D1
Arithmancy (Easy)
|
0 / 0 |
7 |
|
|
9402 |
P1971H
±1
|
0 / 0 |
7 |
