| 1957D | A BIT of an Inequality | | | 1900 | 6k |
| 1957E | Carousel of Combinations | | | 2400 | 1.7k |
| 1956D | Nene and the Mex Operator | | | 2000 | 4.9k |
| 1955F | Unfair Game | | | 1800 | 8.9k |
| 1955G | GCD on a grid | | | 1900 | 6.1k |
| 1955H | The Most Reckless Defense | | | 2300 | 1.6k |
| 1954D | Colored Balls | | | 1800 | 8.4k |
| 1954F | Unique Strings | | | 3100 | 430 |
| 1951H | Thanos Snap | | | 3200 | 380 |
| 1950D | Product of Binary Decimals | | | 1100 | 26.7k |
| 1950G | Shuffling Songs | | | 1900 | 6.3k |
| 1949A | Grove | | | 3300 | 223 |
| 1949C | Annual Ants' Gathering | | | 1900 | 2.6k |
| 1948B | Array Fix | | | 1100 | 26.5k |
| 1948C | Arrow Path | | | 1300 | 21.5k |
| 1946B | Maximum Sum | | | 1100 | 23.9k |
| 1946C | Tree Cutting | | | 1600 | 14.1k |
| 1946E | Girl Permutation | | | 2200 | 3.2k |
| 1946F | Nobody is needed | | | 2500 | 1.3k |
| 1945D | Seraphim the Owl | | | 1300 | 17.5k |
| 1943D1 | Counting Is Fun (Easy Version) | | | 2400 | 2k |
| 1943D2 | Counting Is Fun (Hard Version) | | | 2800 | 1.2k |
| 1943F | Minimum Hamming Distance | | | 3500 | 144 |
| 1942D | Learning to Paint | | | 2100 | 3.4k |
| 1942G | Bessie and Cards | | | 2800 | 786 |
| 1942H | Farmer John's Favorite Intern | | | 3500 | 262 |
| 1941B | Rudolf and 121 | | | 1000 | 35.3k |
| 1941C | Rudolf and the Ugly String | | | 900 | 39.8k |
| 1941D | Rudolf and the Ball Game | | | 1200 | 21.3k |
| 1941E | Rudolf and k Bridges | | | 1600 | 12.2k |
| 1939A | Draw Polygon Lines | | | unrated | 30 |
| 1939D | Big Persimmon | | | unrated | 115 |
| 1937B | Binary Path | | | 1300 | 17.6k |
| 1935C | Messenger in MAC | | | 1800 | 9.9k |
| 1934B | Yet Another Coin Problem | | | 1200 | 22.4k |
| 1933F | Turtle Mission: Robot and the Earthquake | | | 2100 | 3k |
| 1932A | Thorns and Coins | | | 800 | 34.4k |
| 1932F | Feed Cats | | | 1900 | 5.9k |
| 1930D1 | Sum over all Substrings (Easy Version) | | | 1800 | 4.9k |
| 1930D2 | Sum over all Substrings (Hard Version) | | | 2100 | 3.1k |
| 1930E | 2..3...4.... Wonderful! Wonderful! | | | 2400 | 1.5k |
| 1930G | Prefix Max Set Counting | | | 3100 | 531 |
| 1929D | Sasha and a Walk in the City | | | 1900 | 5.9k |
| 1929E | Sasha and the Happy Tree Cutting | | | 2300 | 2.1k |
| 1928E | Modular Sequence | | | 2300 | 2.3k |
| 1927D | Find the Different Ones! | | | 1300 | 35.3k |
| 1927G | Paint Charges | | | 2300 | 2.1k |
| 1926C | Vlad and a Sum of Sum of Digits | | | 1200 | 33.4k |
| 1926E | Vlad and an Odd Ordering | | | 1500 | 15.2k |
| 1926F | Vlad and Avoiding X | | | 2200 | 2.1k |
| 1926G | Vlad and Trouble at MIT | | | 1900 | 4.7k |
| 1925D | Good Trip | | | 1900 | 4.9k |
| 1924A | Did We Get Everything Covered? | | | 1500 | 17k |
| 1924D | Balanced Subsequences | | | 2700 | 1.5k |
| 1924F | Anti-Proxy Attendance | | | 3500 | 234 |
| 1923B | Monsters Attack! | | | 1100 | 20.1k |
| 1923E | Count Paths | | | 2000 | 5.3k |
| 1922F | Replace on Segment | | | 2500 | 1.8k |
| 1921F | Sum of Progression | | | 1900 | 5.2k |
| 1921G | Mischievous Shooter | | | 2200 | 1.5k |
| 1920E | Counting Binary Strings | | | 2100 | 3.5k |
| 1919C | Grouping Increases | | | 1400 | 30.2k |
| 1919E | Counting Prefixes | | | 2600 | 1.2k |
| 1919F2 | Wine Factory (Hard Version) | | | 2800 | 1.2k |
| 1918D | Blocking Elements | | | 1900 | 6.4k |
| 1917B | Erase First or Second Letter | | | 1100 | 38.7k |
| 1917D | Yet Another Inversions Problem | | | 2300 | 2.1k |
| 1917F | Construct Tree | | | 2500 | 1.3k |
| 1916G | Optimizations From Chelsu | | | 3500 | 239 |
| 1916H1 | Matrix Rank (Easy Version) | | | 2700 | 751 |
| 1916H2 | Matrix Rank (Hard Version) | | | 2700 | 681 |
| 1914D | Three Activities | | | 1200 | 40.8k |
| 1914F | Programming Competition | | | 1900 | 5.1k |
| 1914G1 | Light Bulbs (Easy Version) | | | 2100 | 2.5k |
| 1914G2 | Light Bulbs (Hard Version) | | | 2300 | 1.9k |
| 1913D | Array Collapse | | | 2100 | 4.3k |
| 1912K | Kim's Quest | | | 1800 | 4.4k |
| 1910E | Maximum Sum Subarrays | | | 2100 | 248 |
| 1910I | Inverse Problem | | | 2700 | 70 |
| 1909F1 | Small Permutation Problem (Easy Version) | | | 2200 | 2.3k |
| 1909F2 | Small Permutation Problem (Hard Version) | | | 2500 | 1.3k |
| 1909I | Short Permutation Problem | | | 1900 | 183 |
| 1906E | Merge Not Sort | | | 1900 | 2.5k |
| 1906H | Twin Friends | | | 2200 | 1.1k |
| 1906J | Count BFS Graph | | | 2100 | 1.1k |
| 1905E | One-X | | | 2400 | 1.3k |
| 1904B | Collecting Game | | | 1100 | 30.1k |
| 1903D2 | Maximum And Queries (hard version) | | | 2500 | 1.1k |
| 1902D | Robot Queries | | | 1900 | 5.4k |
| 1901D | Yet Another Monster Fight | | | 1700 | 8.8k |
| 1901E | Compressed Tree | | | 2200 | 2k |
| 1900B | Laura and Operations | | | 900 | 20.8k |
| 1900C | Anji's Binary Tree | | | 1300 | 15.3k |
| 1900D | Small GCD | | | 2000 | 5.6k |
| 1900E | Transitive Graph | | | 2100 | 2.7k |
| 1899C | Yarik and Array | | | 1100 | 37.2k |
| 1896H1 | Cyclic Hamming (Easy Version) | | | 3400 | 181 |
| 1896H2 | Cyclic Hamming (Hard Version) | | | 3500 | 164 |
| 1895C | Torn Lucky Ticket | | | 1400 | 13.3k |
| 1895E | Infinite Card Game | | | 2300 | 1.9k |