|
|
1654 |
P1450C1
Errich-Tac-Toe (Easy Version)
|
0 / 0 |
7 |
|
|
1621 |
P1454F
Array Partition
|
0 / 0 |
7 |
|
|
1579 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
1537 |
P1472F
New Year's Puzzle
|
0 / 0 |
7 |
|
|
1536 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
1497 |
P1479B2
Painting the Array II
|
0 / 0 |
7 |
|
|
1481 |
P1482E
Skyline Photo
|
0 / 0 |
7 |
|
|
1467 |
P1486D
Max Median
|
0 / 0 |
7 |
|
|
1423 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
|
1390 |
P1499D
The Number of Pairs
|
0 / 0 |
7 |
|
|
1342 |
P1510D
Digits
|
0 / 0 |
7 |
|
|
1330 |
P1511E
Colorings and Dominoes
|
0 / 0 |
7 |
|
|
1297 |
P1516D
Cut
|
0 / 0 |
7 |
|
|
1256 |
P1525E
Assimilation IV
|
0 / 0 |
7 |
|
|
1229 |
P1530E
Minimax
|
0 / 0 |
7 |
|
|
1177 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
|
1175 |
P1538G
Gift Set
|
0 / 0 |
7 |
|
|
1133 |
P1547G
How Many Paths?
|
0 / 0 |
7 |
|
|
1113 |
P1551D2
Domino (hard version)
|
0 / 0 |
7 |
|
|
1097 |
P1553E
Permutation Shift
|
0 / 0 |
7 |
|
|
1083 |
P1555E
Boring Segments
|
0 / 0 |
7 |
|
|
1050 |
P1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
|
983 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
|
906 |
P1593F
Red-Black Number
|
0 / 0 |
7 |
|
|
893 |
P1598E
Staircases
|
0 / 0 |
7 |
|
|
883 |
P1599H
Hidden Fortress
|
0 / 0 |
7 |
|
|
858 |
P1605D
Treelabeling
|
0 / 0 |
7 |
|
|
851 |
P1606E
Arena
|
0 / 0 |
7 |
|
|
793 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
743 |
P1621D
The Winter Hike
|
0 / 0 |
7 |
|
|
710 |
P1626D
Martial Arts Tournament
|
0 / 0 |
7 |
|
|
698 |
P1628D1
Game on Sum (Easy Version)
|
0 / 0 |
7 |
|
|
656 |
P1637E
Best Pair
|
0 / 0 |
7 |
|
|
595 |
P1650G
Counting Shortcuts
|
0 / 0 |
7 |
|
|
585 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
546 |
P1660F2
Promising String (hard version)
|
0 / 0 |
7 |
|
|
502 |
P1666J
Job Lookup
|
0 / 0 |
7 |
|
|
498 |
P1667B
Optimal Partition
|
0 / 0 |
7 |
|
|
473 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
395 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
245 |
P1710B
Rain
|
0 / 0 |
7 |
|
|
167 |
P1725F
Field Photography
|
0 / 0 |
7 |
|
|
138 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
|
128 |
P1732C2
Sheikh (Hard Version)
|
0 / 0 |
7 |
|
|
114 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
26 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
8303 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
8436 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
8468 |
P1808D
Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
|
8453 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
8628 |
P1856D
More Wrong
|
0 / 0 |
7 |
|
|
8707 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
|
8696 |
P1866G
Grouped Carriages
|
0 / 0 |
7 |
|
|
8695 |
P1866H
Happy Sets
|
0 / 0 |
7 |
|
|
8680 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
|
8857 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
8833 |
P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
|
8900 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
8879 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
8869 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
9023 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
9000 |
P1924B
Space Harbour
|
0 / 0 |
7 |
|
|
9081 |
P1934D1
XOR Break — Solo Version
|
0 / 0 |
7 |
|
|
9162 |
P1942D
Learning to Paint
|
0 / 0 |
7 |
|
|
9235 |
P1970B2
Exact Neighbours (Medium)
|
0 / 0 |
7 |
|
|
9230 |
P1970D1
Arithmancy (Easy)
|
0 / 0 |
7 |
|
|
9211 |
P1971H
±1
|
0 / 0 |
7 |
|
|
9346 |
P1975E
Chain Queries
|
0 / 0 |
7 |
