| 2021E3 | Digital Village (Extreme Version) | | | 2800 | 725 |
| 2020D | Connect the Dots | | | 1800 | 7.6k |
| 2020E | Expected Power | | | 2000 | 4.1k |
| 2020F | Count Leaves | | | 2900 | 272 |
| 2019A | Max Plus Size | | | 800 | 27.5k |
| 2018B | Speedbreaker | | | 1900 | 5.3k |
| 2018D | Max Plus Min Plus Size | | | 2200 | 2.2k |
| 2018F1 | Speedbreaker Counting (Easy Version) | | | 2900 | 344 |
| 2018F2 | Speedbreaker Counting (Medium Version) | | | 3000 | 301 |
| 2018F3 | Speedbreaker Counting (Hard Version) | | | 3100 | 339 |
| 2014F | Sheriff's Defense | | | 2000 | 5.3k |
| 2013E | Prefix GCD | | | 2200 | 4.4k |
| 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 | 554 |
| 2008D | Sakurako's Hobby | | | 1100 | 23.9k |
| 2008E | Alternating String | | | 1500 | 13.8k |
| 2005C | Lazy Narek | | | 1800 | 8.8k |
| 2005E1 | Subtangle Game (Easy Version) | | | 2100 | 3.4k |
| 2005E2 | Subtangle Game (Hard Version) | | | 2500 | 1.1k |
| 2004G | Substring Compression | | | 3200 | 425 |
| 2003D2 | Turtle and a MEX Problem (Hard Version) | | | 2100 | 4.7k |
| 2003E1 | Turtle and Inversions (Easy Version) | | | 2600 | 902 |
| 2003E2 | Turtle and Inversions (Hard Version) | | | 2700 | 654 |
| 2003F | Turtle and Three Sequences | | | 2800 | 838 |
| 2002E | Cosmic Rays | | | 2300 | 3k |
| 2002F1 | Court Blue (Easy Version) | | | 2600 | 1k |
| 2002F2 | Court Blue (Hard Version) | | | 2800 | 597 |
| 2001E1 | Deterministic Heap (Easy Version) | | | 2400 | 1.6k |
| 2001E2 | Deterministic Heap (Hard Version) | | | 2900 | 303 |
| 2000F | Color Rows and Columns | | | 1900 | 7.1k |
| 1999E | Triple Operations | | | 1300 | 24.3k |
| 1998D | Determine Winning Islands in Race | | | 2100 | 4.2k |
| 1997D | Maximize the Root | | | 1500 | 16.3k |
| 1997F | Chips on a Line | | | 2700 | 1.3k |
| 1996C | Sort | | | 1200 | 28.5k |
| 1995D | Cases | | | 2300 | 3k |
| 1995E1 | Let Me Teach You a Lesson (Easy Version) | | | 2700 | 537 |
| 1995E2 | Let Me Teach You a Lesson (Hard Version) | | | 2900 | 417 |
| 1994C | Hungry Games | | | 1600 | 14k |
| 1994G | Minecraft | | | 2600 | 1.7k |
| 1993D | Med-imize | | | 2200 | 4.5k |
| 1993E | Xor-Grid Problem | | | 2700 | 741 |
| 1992D | Test of Love | | | 1200 | 24.5k |
| 1992F | Valuable Cards | | | 1900 | 7.7k |
| 1992G | Ultra-Meow | | | 2000 | 4.3k |
| 1991H | Prime Split Game | | | 3300 | 580 |
| 1990D | Grid Puzzle | | | 1800 | 7.9k |
| 1990F | Polygonal Segments | | | 2800 | 464 |
| 1989D | Smithing Skill | | | 1900 | 7.2k |
| 1989E | Distance to Different | | | 2300 | 2.6k |
| 1988D | The Omnipotent Monster Killer | | | 2000 | 6.1k |
| 1988F | Heartbeat | | | 3000 | 482 |
| 1987C | Basil's Garden | | | 1200 | 21.1k |
| 1987D | World is Mine | | | 1800 | 8.9k |
| 1987F1 | Interesting Problem (Easy Version) | | | 2500 | 1.4k |
| 1987F2 | Interesting Problem (Hard Version) | | | 2600 | 1.4k |
| 1987G1 | Spinning Round (Easy Version) | | | 2900 | 361 |
| 1987G2 | Spinning Round (Hard Version) | | | 3500 | 255 |
| 1986D | Mathematical Problem | | | 1400 | 18.2k |
| 1985H2 | Maximize the Largest Component (Hard Version) | | | 2200 | 2k |
| 1984C1 | Magnitude (Easy Version) | | | 1300 | 20.6k |
| 1984C2 | Magnitude (Hard Version) | | | 1700 | 8.8k |
| 1984E | Shuffle | | | 2400 | 1.9k |
| 1984F | Reconstruction | | | 2500 | 1.2k |
| 1984H | Tower Capturing | | | 3300 | 281 |
| 1983G | Your Loss | | | 3000 | 325 |
| 1982C | Boring Day | | | 1200 | 22.3k |
| 1982E | Number of k-good subarrays | | | 2300 | 1.9k |
| 1981F | Turtle and Paths on a Tree | | | 3000 | 358 |
| 1979D | Fixing a Binary String | | | 1800 | 8k |
| 1978E | Computing Machine | | | 2000 | 4.7k |
| 1977C | Nikita and LCM | | | 1900 | 8.2k |
| 1976C | Job Interview | | | 1600 | 12.6k |
| 1976F | Remove Bridges | | | 2800 | 893 |
| 1975D | Paint the Tree | | | 1700 | 7.7k |
| 1975F | Set | | | 2600 | 1.1k |
| 1975I | Mind Bloom | | | 3500 | 189 |
| 1974E | Money Buys Happiness | | | 1800 | 11.8k |
| 1973A | Chess For Three | | | 900 | 29k |
| 1973F | Maximum GCD Sum Queries | | | 3100 | 345 |
| 1971D | Binary Cut | | | 1100 | 31k |
| 1970C2 | Game on Tree (Medium) | | | 1700 | 4.5k |
| 1970C3 | Game on Tree (Hard) | | | 1900 | 2.5k |
| 1970E1 | Trails (Easy) | | | 1800 | 3.5k |
| 1970E2 | Trails (Medium) | | | 2000 | 2.2k |
| 1970E3 | Trails (Hard) | | | 2200 | 1.2k |
| 1970G2 | Min-Fund Prison (Medium) | | | 2200 | 909 |
| 1970G3 | Min-Fund Prison (Hard) | | | 2400 | 575 |
| 1969C | Minimizing the Sum | | | 1700 | 11.9k |
| 1969E | Unique Array | | | 2400 | 1.9k |
| 1969F | Card Pairing | | | 3000 | 414 |
| 1968G1 | Division + LCP (easy version) | | | 1900 | 5.4k |
| 1968G2 | Division + LCP (hard version) | | | 2200 | 2.6k |
| 1967C | Fenwick Tree | | | 2300 | 2.3k |
| 1967E1 | Again Counting Arrays (Easy Version) | | | 3100 | 449 |
| 1967E2 | Again Counting Arrays (Hard Version) | | | 3500 | 231 |
| 1958A | 1-3-5 | | | 1100 | 2.6k |
| 1958H | Composite Spells | | | 2600 | 97 |
| 1957C | How Does the Rook Move? | | | 1600 | 12.2k |