| 2027C | Add Zeros | | | 1500 | 14.1k |
| 2027D2 | The Endspeaker (Hard Version) | | | 2200 | 1.9k |
| 2026D | Sums of Segments | | | 1900 | 6.1k |
| 2026F | Bermart Ice Cream | | | 2700 | 413 |
| 2025D | Attribute Checks | | | 1800 | 8k |
| 2021E1 | Digital Village (Easy Version) | | | 2300 | 2k |
| 2021E2 | Digital Village (Hard Version) | | | 2500 | 1.3k |
| 2021E3 | Digital Village (Extreme Version) | | | 2800 | 725 |
| 2018B | Speedbreaker | | | 1900 | 5.3k |
| 2018D | Max Plus Min Plus Size | | | 2200 | 2.2k |
| 2013F1 | Game in Tree (Easy Version) | | | 2700 | 679 |
| 2009G2 | Yunli's Subarray Queries (hard version) | | | 2200 | 1.8k |
| 2009G3 | Yunli's Subarray Queries (extreme version) | | | 2700 | 552 |
| 2008E | Alternating String | | | 1500 | 13.8k |
| 2005E2 | Subtangle Game (Hard Version) | | | 2500 | 1.1k |
| 2004G | Substring Compression | | | 3200 | 425 |
| 2003E2 | Turtle and Inversions (Hard Version) | | | 2700 | 654 |
| 2003F | Turtle and Three Sequences | | | 2800 | 838 |
| 2002E | Cosmic Rays | | | 2300 | 3k |
| 1998D | Determine Winning Islands in Race | | | 2100 | 4.2k |
| 1995E1 | Let Me Teach You a Lesson (Easy Version) | | | 2700 | 537 |
| 1995E2 | Let Me Teach You a Lesson (Hard Version) | | | 2900 | 417 |
| 1990F | Polygonal Segments | | | 2800 | 464 |
| 1989D | Smithing Skill | | | 1900 | 7.2k |
| 1985H2 | Maximize the Largest Component (Hard Version) | | | 2200 | 2k |
| 1982C | Boring Day | | | 1200 | 22.3k |
| 1981F | Turtle and Paths on a Tree | | | 3000 | 358 |
| 1978E | Computing Machine | | | 2000 | 4.7k |
| 1977C | Nikita and LCM | | | 1900 | 8.2k |
| 1976F | Remove Bridges | | | 2800 | 893 |
| 1969E | Unique Array | | | 2400 | 1.9k |
| 1968G1 | Division + LCP (easy version) | | | 1900 | 5.4k |
| 1968G2 | Division + LCP (hard version) | | | 2200 | 2.6k |
| 1967C | Fenwick Tree | | | 2300 | 2.3k |
| 1946F | Nobody is needed | | | 2500 | 1.3k |
| 1942D | Learning to Paint | | | 2100 | 3.4k |
| 1942H | Farmer John's Favorite Intern | | | 3500 | 262 |
| 1941E | Rudolf and k Bridges | | | 1600 | 12.2k |
| 1935C | Messenger in MAC | | | 1800 | 9.9k |
| 1932F | Feed Cats | | | 1900 | 5.9k |
| 1930G | Prefix Max Set Counting | | | 3100 | 531 |
| 1927D | Find the Different Ones! | | | 1300 | 35.3k |
| 1927G | Paint Charges | | | 2300 | 2k |
| 1926E | Vlad and an Odd Ordering | | | 1500 | 15.2k |
| 1923E | Count Paths | | | 2000 | 5.3k |
| 1921F | Sum of Progression | | | 1900 | 5.2k |
| 1921G | Mischievous Shooter | | | 2200 | 1.5k |
| 1919C | Grouping Increases | | | 1400 | 30.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 |
| 1914G2 | Light Bulbs (Hard Version) | | | 2300 | 1.9k |
| 1913D | Array Collapse | | | 2100 | 4.3k |
| 1902D | Robot Queries | | | 1900 | 5.4k |
| 1895E | Infinite Card Game | | | 2300 | 1.9k |
| 1895G | Two Characters, Two Colors | | | 3100 | 405 |
| 1889C1 | Doremy's Drying Plan (Easy Version) | | | 2000 | 4k |
| 1889C2 | Doremy's Drying Plan (Hard Version) | | | 2600 | 1.2k |
| 1889F | Doremy's Average Tree | | | 3500 | 208 |
| 1884C | Medium Design | | | 1700 | 7.5k |
| 1876E | Ball-Stackable | | | 3300 | 373 |
| 1872E | Data Structures Fan | | | 1500 | 22.5k |
| 1870C | Colorful Table | | | 1300 | 13.3k |
| 1866G | Grouped Carriages | | | 2100 | 2.3k |
| 1866K | Keen Tree Calculation | | | 2500 | 585 |
| 1864D | Matrix Cascade | | | 1700 | 7.7k |
| 1860C | Game on Permutation | | | 1400 | 15.9k |
| 1859D | Andrey and Escape from Capygrad | | | 1800 | 8.1k |
| 1858D | Trees and Segments | | | 2200 | 3.3k |
| 1856C | To Become Max | | | 1600 | 19.2k |
| 1852C | Ina of the Mountain | | | 2400 | 2.2k |
| 1852F | Panda Meetups | | | 3500 | 151 |
| 1849E | Max to the Right of Min | | | 2300 | 2.3k |
| 1846C | Rudolf and the Another Competition | | | 1200 | 21.8k |
| 1845D | Rating System | | | 1800 | 9.2k |
| 1844H | Multiple of Three Cycles | | | 3400 | 305 |
| 1843F1 | Omsk Metro (simple version) | | | 1800 | 6.5k |
| 1843F2 | Omsk Metro (hard version) | | | 2300 | 2.2k |
| 1842E | Tenzing and Triangle | | | 2300 | 1.9k |
| 1839D | Ball Sorting | | | 2100 | 2.8k |
| 1830F | The Third Grace | | | 3200 | 409 |
| 1829G | Hits Different | | | 1600 | 15.9k |
| 1827B2 | Range Sorting (Hard Version) | | | 2400 | 2.4k |
| 1827C | Palindrome Partition | | | 2600 | 1.8k |
| 1826E | Walk the Runway | | | 2400 | 2k |
| 1824C | LuoTianyi and XOR-Tree | | | 2500 | 1.7k |
| 1819D | Misha and Apples | | | 2800 | 904 |
| 1819F | Willy-nilly, Crack, Into Release! | | | 3500 | 208 |
| 1814E | Chain Chips | | | 2300 | 1.8k |
| 1811G2 | Vlad and the Nice Paths (hard version) | | | 2200 | 2.2k |
| 1807G1 | Subsequence Addition (Easy Version) | | | 1100 | 22.7k |
| 1805E | There Should Be a Lot of Maximums | | | 2300 | 2k |
| 1801C | Music Festival | | | 1900 | 4.2k |
| 1801D | The way home | | | 2100 | 2.9k |
| 1799D2 | Hot Start Up (hard version) | | | 2100 | 3.1k |
| 1797D | Li Hua and Tree | | | 1900 | 4.7k |
| 1796D | Maximum Subarray | | | 2000 | 5.5k |
| 1795E | Explosions? | | | 2200 | 2.4k |
| 1794E | Labeling the Tree with Distances | | | 2400 | 1.6k |