| 309703 | CF1721D. Maximum AND | 0 | 0 | 0.000% |
| 309704 | CF1721E. Prefix Function Queries | 0 | 0 | 0.000% |
| 309705 | CF1721F. Matching Reduction | 0 | 0 | 0.000% |
| 309750 | CF1729G. Cut Substrings | 0 | 0 | 0.000% |
| 309766 | CF1732C2. Sheikh (Hard Version) | 0 | 0 | 0.000% |
| 309770 | CF1733A. Consecutive Sum | 0 | 0 | 0.000% |
| 309771 | CF1733B. Rule of League | 0 | 0 | 0.000% |
| 309772 | CF1733C. Parity Shuffle Sorting | 0 | 0 | 0.000% |
| 309773 | CF1733D1. Zero-One (Easy Version) | 0 | 0 | 0.000% |
| 309774 | CF1733D2. Zero-One (Hard Version) | 0 | 0 | 0.000% |
| 309775 | CF1733E. Conveyor | 0 | 0 | 0.000% |
| 309780 | CF1734E. Rectangular Congruence | 0 | 0 | 0.000% |
| 309868 | CF1748D. ConstructOR | 0 | 0 | 0.000% |
| 309930 | CF1761D. Carry Bit | 0 | 0 | 0.000% |
| 309938 | CF1762D. GCD Queries | 0 | 0 | 0.000% |
| 309980 | CF1767C. Count Binary Strings | 0 | 0 | 0.000% |
| 310009 | CF1771D. Hossam and (sub-)palindromic tree | 0 | 0 | 0.000% |
| 310045 | CF1775E. The Human Equation | 0 | 0 | 0.000% |
| 310070 | CF1778D. Flexible String Revisit | 0 | 0 | 0.000% |
| 310135 | CF1787E. The Harmonization of XOR | 0 | 0 | 0.000% |
| 310157 | CF1790F. Timofey and Black-White Tree | 0 | 0 | 0.000% |
| 310231 | CF1801D. The way home | 0 | 0 | 0.000% |
| 310240 | CF1802F. The way home | 0 | 0 | 0.000% |
| 310275 | CF1808D. Petya, Petya, Petr, and Palindromes | 0 | 0 | 0.000% |
| 310290 | CF1810E. Monsters | 0 | 0 | 0.000% |
| 310299 | CF1811F. Is It Flower? | 0 | 0 | 0.000% |
| 310300 | CF1811G1. Vlad and the Nice Paths (easy version) | 0 | 0 | 0.000% |
| 310355 | CF1821A. Matching | 0 | 0 | 0.000% |
| 310356 | CF1821B. Sort the Subarray | 0 | 0 | 0.000% |
| 310357 | CF1821C. Tear It Apart | 0 | 0 | 0.000% |
| 310358 | CF1821D. Black Cells | 0 | 0 | 0.000% |
| 310359 | CF1821E. Rearrange Brackets | 0 | 0 | 0.000% |
| 310360 | CF1821F. Timber | 0 | 0 | 0.000% |
| 310430 | CF1832D1. Red-Blue Operations (Easy Version) | 0 | 0 | 0.000% |
| 310468 | CF1838D. Bracket Walk | 0 | 0 | 0.000% |
| 310474 | CF1839D. Ball Sorting | 0 | 0 | 0.000% |
| 310591 | CF1856D. More Wrong | 0 | 0 | 0.000% |
| 310636 | CF1863E. Speedrun | 0 | 0 | 0.000% |
| 310657 | CF1866H. Happy Sets | 0 | 0 | 0.000% |
| 310672 | CF1868B2. Candy Party (Hard Version) | 0 | 0 | 0.000% |
| 310681 | CF1869D2. Candy Party (Hard Version) | 0 | 0 | 0.000% |
| 310723 | CF1876C. Autosynthesis | 0 | 0 | 0.000% |
| 310732 | CF1877E. Autosynthesis | 0 | 0 | 0.000% |
| 310772 | CF1884D. Counting Rhyme | 0 | 0 | 0.000% |
| 310778 | CF1886D. Monocarp and the Set | 0 | 0 | 0.000% |
| 310836 | CF1896E. Permutation Sorting | 0 | 0 | 0.000% |
| 310858 | CF1900E. Transitive Graph | 0 | 0 | 0.000% |
| 310926 | CF1910E. Maximum Sum Subarrays | 0 | 0 | 0.000% |
| 310955 | CF1913D. Array Collapse | 0 | 0 | 0.000% |
| 310965 | CF1914G1. Light Bulbs (Easy Version) | 0 | 0 | 0.000% |
| 310999 | CF1919D. 01 Tree | 0 | 0 | 0.000% |
| 311009 | CF1920E. Counting Binary Strings | 0 | 0 | 0.000% |
| 311012 | CF1921A. Square | 0 | 0 | 0.000% |
| 311013 | CF1921B. Arranging Cats | 0 | 0 | 0.000% |
| 311014 | CF1921C. Sending Messages | 0 | 0 | 0.000% |
| 311015 | CF1921D. Very Different Array | 0 | 0 | 0.000% |
| 311016 | CF1921E. Eat the Chip | 0 | 0 | 0.000% |
| 311017 | CF1921F. Sum of Progression | 0 | 0 | 0.000% |
| 311018 | CF1921G. Mischievous Shooter | 0 | 0 | 0.000% |
| 311031 | CF1924A. Did We Get Everything Covered? | 0 | 0 | 0.000% |
| 311032 | CF1924B. Space Harbour | 0 | 0 | 0.000% |
| 311033 | CF1924C. Fractal Origami | 0 | 0 | 0.000% |
| 311034 | CF1924D. Balanced Subsequences | 0 | 0 | 0.000% |
| 311035 | CF1924E. Paper Cutting Again | 0 | 0 | 0.000% |
| 311036 | CF1924F. Anti-Proxy Attendance | 0 | 0 | 0.000% |
| 311037 | CF1925A. We Got Everything Covered! | 0 | 0 | 0.000% |
| 311038 | CF1925B. A Balanced Problemset? | 0 | 0 | 0.000% |
| 311039 | CF1925C. Did We Get Everything Covered? | 0 | 0 | 0.000% |
| 311040 | CF1925D. Good Trip | 0 | 0 | 0.000% |
| 311041 | CF1925E. Space Harbour | 0 | 0 | 0.000% |
| 311042 | CF1925F. Fractal Origami | 0 | 0 | 0.000% |
| 311073 | CF1930D2. Sum over all Substrings (Hard Version) | 0 | 0 | 0.000% |
| 311098 | CF1933F. Turtle Mission: Robot and the Earthquake | 0 | 0 | 0.000% |
| 311103 | CF1934D1. XOR Break — Solo Version | 0 | 0 | 0.000% |
| 311146 | CF1941B. Rudolf and 121 | 0 | 0 | 0.000% |
| 311156 | CF1942D. Learning to Paint | 0 | 0 | 0.000% |
| 311194 | CF1948E. Clique Partition | 0 | 0 | 0.000% |
| 311319 | CF1970B2. Exact Neighbours (Medium) | 0 | 0 | 0.000% |
| 311324 | CF1970D1. Arithmancy (Easy) | 0 | 0 | 0.000% |
| 311343 | CF1971H. ±1 | 0 | 0 | 0.000% |
| 311368 | CF1975E. Chain Queries | 0 | 0 | 0.000% |
| 400414 | GYM100178 21 Конструктор | 0 | 0 | 0.000% |
| 400571 | GYM100210 A Crazy Bishops | 0 | 0 | 0.000% |
| 400572 | GYM100210 B Divide and Conquer | 0 | 0 | 0.000% |
| 400573 | GYM100210 C Martians' DNA Analysis | 0 | 0 | 0.000% |
| 400574 | GYM100210 D Drawing Problem | 0 | 0 | 0.000% |
| 400575 | GYM100210 E Fibonacci Period | 0 | 0 | 0.000% |
| 400576 | GYM100210 F Parallel Processes | 0 | 0 | 0.000% |
| 400577 | GYM100210 G Beautiful Permutation | 0 | 0 | 0.000% |
| 400578 | GYM100210 H Build More Roads! | 0 | 0 | 0.000% |
| 400579 | GYM100210 I Secret Lab | 0 | 0 | 0.000% |
| 400580 | GYM100210 J Snooker | 0 | 0 | 0.000% |
| 400581 | GYM100211 A Chip Designing | 0 | 0 | 0.000% |
| 400582 | GYM100211 B Electricity | 0 | 0 | 0.000% |
| 400583 | GYM100211 C Numbers to Numbers | 0 | 0 | 0.000% |
| 400584 | GYM100211 D Police Cities | 0 | 0 | 0.000% |
| 400585 | GYM100211 E Quadratic Equation | 0 | 0 | 0.000% |
| 400586 | GYM100211 F Restore the Tree | 0 | 0 | 0.000% |
| 400587 | GYM100211 G Unrhymable Rhymes | 0 | 0 | 0.000% |
| 400588 | GYM100211 H Selling Tickets | 0 | 0 | 0.000% |