|
2475 |
codeforces#P1450C1 Errich-Tac-Toe (Easy Version)
|
0 / 0 |
7 |
|
2442 |
codeforces#P1454F Array Partition
|
0 / 0 |
7 |
|
2400 |
codeforces#P1466F Euclid's nightmare
|
0 / 0 |
7 |
|
2358 |
codeforces#P1472F New Year's Puzzle
|
0 / 0 |
7 |
|
2357 |
codeforces#P1472G Moving to the Capital
|
0 / 0 |
7 |
|
2318 |
codeforces#P1479B2 Painting the Array II
|
0 / 0 |
7 |
|
2302 |
codeforces#P1482E Skyline Photo
|
0 / 0 |
7 |
|
2288 |
codeforces#P1486D Max Median
|
0 / 0 |
7 |
|
2244 |
codeforces#P1493D GCD of an Array
|
0 / 0 |
7 |
|
2211 |
codeforces#P1499D The Number of Pairs
|
0 / 0 |
7 |
|
2163 |
codeforces#P1510D Digits
|
0 / 0 |
7 |
|
2151 |
codeforces#P1511E Colorings and Dominoes
|
0 / 0 |
7 |
|
2118 |
codeforces#P1516D Cut
|
0 / 0 |
7 |
|
2077 |
codeforces#P1525E Assimilation IV
|
0 / 0 |
7 |
|
2050 |
codeforces#P1530E Minimax
|
0 / 0 |
7 |
|
1998 |
codeforces#P1538E Funny Substrings
|
0 / 0 |
7 |
|
1996 |
codeforces#P1538G Gift Set
|
0 / 0 |
7 |
|
1954 |
codeforces#P1547G How Many Paths?
|
0 / 0 |
7 |
|
1934 |
codeforces#P1551D2 Domino (hard version)
|
0 / 0 |
7 |
|
1918 |
codeforces#P1553E Permutation Shift
|
0 / 0 |
7 |
|
1904 |
codeforces#P1555E Boring Segments
|
0 / 0 |
7 |
|
1871 |
codeforces#P1560F2 Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
1804 |
codeforces#P1575L Longest Array Deconstruction
|
0 / 0 |
7 |
|
1727 |
codeforces#P1593F Red-Black Number
|
0 / 0 |
7 |
|
1714 |
codeforces#P1598E Staircases
|
0 / 0 |
7 |
|
1704 |
codeforces#P1599H Hidden Fortress
|
0 / 0 |
7 |
|
1679 |
codeforces#P1605D Treelabeling
|
0 / 0 |
7 |
|
1672 |
codeforces#P1606E Arena
|
0 / 0 |
7 |
|
1614 |
codeforces#P1614D1 Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
1564 |
codeforces#P1621D The Winter Hike
|
0 / 0 |
7 |
|
1531 |
codeforces#P1626D Martial Arts Tournament
|
0 / 0 |
7 |
|
1519 |
codeforces#P1628D1 Game on Sum (Easy Version)
|
0 / 0 |
7 |
|
1477 |
codeforces#P1637E Best Pair
|
0 / 0 |
7 |
|
1416 |
codeforces#P1650G Counting Shortcuts
|
0 / 0 |
7 |
|
1406 |
codeforces#P1654D Potion Brewing Class
|
0 / 0 |
7 |
|
1367 |
codeforces#P1660F2 Promising String (hard version)
|
0 / 0 |
7 |
|
1323 |
codeforces#P1666J Job Lookup
|
0 / 0 |
7 |
|
1319 |
codeforces#P1667B Optimal Partition
|
0 / 0 |
7 |
|
1294 |
codeforces#P1671E Preorder
|
0 / 0 |
7 |
|
1216 |
codeforces#P1684E MEX vs DIFF
|
0 / 0 |
7 |
|
1066 |
codeforces#P1710B Rain
|
0 / 0 |
7 |
|
988 |
codeforces#P1725F Field Photography
|
0 / 0 |
7 |
|
959 |
codeforces#P1729G Cut Substrings
|
0 / 0 |
7 |
|
943 |
codeforces#P1732C2 Sheikh (Hard Version)
|
0 / 0 |
7 |
|
929 |
codeforces#P1734E Rectangular Congruence
|
0 / 0 |
7 |
|
841 |
codeforces#P1748D ConstructOR
|
0 / 0 |
7 |
|
792 |
codeforces#P1761D Carry Bit
|
0 / 0 |
7 |
|
784 |
codeforces#P1762D GCD Queries
|
0 / 0 |
7 |
|
742 |
codeforces#P1767C Count Binary Strings
|
0 / 0 |
7 |
|
721 |
codeforces#P1771D Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
692 |
codeforces#P1775E The Human Equation
|
0 / 0 |
7 |
|
684 |
codeforces#P1776G Another Wine Tasting Event
|
0 / 0 |
7 |
|
667 |
codeforces#P1778D Flexible String Revisit
|
0 / 0 |
7 |
|
621 |
codeforces#P1787E The Harmonization of XOR
|
0 / 0 |
7 |
|
599 |
codeforces#P1790F Timofey and Black-White Tree
|
0 / 0 |
7 |
|
542 |
codeforces#P1799D2 Hot Start Up (hard version)
|
0 / 0 |
7 |
|
525 |
codeforces#P1801D The way home
|
0 / 0 |
7 |
|
486 |
codeforces#P1808D Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
471 |
codeforces#P1810E Monsters
|
0 / 0 |
7 |
|
462 |
codeforces#P1811F Is It Flower?
|
0 / 0 |
7 |
|
461 |
codeforces#P1811G1 Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
415 |
codeforces#P1821E Rearrange Brackets
|
0 / 0 |
7 |
|
357 |
codeforces#P1832D1 Red-Blue Operations (Easy Version)
|
0 / 0 |
7 |
|
323 |
codeforces#P1838D Bracket Walk
|
0 / 0 |
7 |
|
317 |
codeforces#P1839D Ball Sorting
|
0 / 0 |
7 |
|
209 |
codeforces#P1856D More Wrong
|
0 / 0 |
7 |
|
164 |
codeforces#P1863E Speedrun
|
0 / 0 |
7 |
|
155 |
codeforces#P1864E Guess Game
|
0 / 0 |
7 |
|
144 |
codeforces#P1866G Grouped Carriages
|
0 / 0 |
7 |
|
143 |
codeforces#P1866H Happy Sets
|
0 / 0 |
7 |
|
128 |
codeforces#P1868B2 Candy Party (Hard Version)
|
0 / 0 |
7 |
|
86 |
codeforces#P1876C Autosynthesis
|
0 / 0 |
7 |
|
42 |
codeforces#P1884D Counting Rhyme
|
0 / 0 |
7 |
|
37 |
codeforces#P1886D Monocarp and the Set
|
0 / 0 |
7 |
|
5345 |
codeforces#P1900E Transitive Graph
|
0 / 0 |
7 |
|
6610 |
codeforces#P1906J Count BFS Graph
|
0 / 0 |
7 |
|
6683 |
codeforces#P1910E Maximum Sum Subarrays
|
0 / 0 |
7 |
|
6662 |
codeforces#P1913D Array Collapse
|
0 / 0 |
7 |
|
6652 |
codeforces#P1914G1 Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
7322 |
codeforces#P1919D 01 Tree
|
0 / 0 |
7 |
|
8196 |
codeforces#P1920E Counting Binary Strings
|
0 / 0 |
7 |
|
8179 |
codeforces#P1924B Space Harbour
|
0 / 0 |
7 |
|
9343 |
codeforces#P1970B2 Exact Neighbours (Medium)
|
0 / 0 |
7 |
|
9338 |
codeforces#P1970D1 Arithmancy (Easy)
|
0 / 0 |
7 |
|
9319 |
codeforces#P1971H ±1
|
0 / 0 |
7 |