| 2014G | Milky Days | | | 2200 | 1.8k |
| 2013E | Prefix GCD | | | 2200 | 4.4k |
| 2013F1 | Game in Tree (Easy Version) | | | 2700 | 679 |
| 2010A | Alternating Sum of Numbers | | | 800 | 21.5k |
| 2010B | Three Brothers | | | 800 | 25k |
| 2010C1 | Message Transmission Error (easy version) | | | 1400 | 9.4k |
| 2009A | Minimize! | | | 800 | 75.1k |
| 2009B | osu!mania | | | 800 | 54.2k |
| 2008A | Sakurako's Exam | | | 800 | 42.3k |
| 2008B | Square or Not | | | 800 | 33.3k |
| 2008C | Longest Good Array | | | 800 | 37k |
| 2008E | Alternating String | | | 1500 | 13.8k |
| 2008H | Sakurako's Test | | | 2100 | 3.7k |
| 2006B | Iris and the Tree | | | 1800 | 4.4k |
| 2006E | Iris's Full Binary Tree | | | 3100 | 328 |
| 2006F | Dora's Paint | | | 3500 | 173 |
| 2005D | Alter the GCD | | | 2400 | 1.3k |
| 2004B | Game with Doors | | | 1000 | 32.1k |
| 2004D | Colored Portals | | | 1600 | 13.5k |
| 2004E | Not a Nim Problem | | | 2100 | 5.2k |
| 2004F | Make a Palindrome | | | 2600 | 1.4k |
| 2003E1 | Turtle and Inversions (Easy Version) | | | 2600 | 902 |
| 2003E2 | Turtle and Inversions (Hard Version) | | | 2700 | 654 |
| 2003F | Turtle and Three Sequences | | | 2800 | 838 |
| 2002C | Black Circles | | | 1200 | 18k |
| 2002D1 | DFS Checker (Easy Version) | | | 1900 | 5.2k |
| 2002E | Cosmic Rays | | | 2300 | 3k |
| 2002F1 | Court Blue (Easy Version) | | | 2600 | 1k |
| 2002F2 | Court Blue (Hard Version) | | | 2800 | 597 |
| 2002G | Lattice Optimizing | | | 3400 | 292 |
| 2001C | Guess The Tree | | | 1500 | 13.1k |
| 2001D | Longest Max Min Subsequence | | | 1900 | 6.6k |
| 2000G | Call During the Journey | | | 2100 | 3.2k |
| 2000H | Ksyusha and the Loaded Set | | | 2200 | 2.4k |
| 1999B | Card Game | | | 1000 | 42.6k |
| 1998C | Perform Operations to Maximize Score | | | 1900 | 7.2k |
| 1998E1 | Eliminating Balls With Merging (Easy Version) | | | 2200 | 2.3k |
| 1998E2 | Eliminating Balls With Merging (Hard Version) | | | 2500 | 927 |
| 1997A | Strong Password | | | 800 | 33.7k |
| 1997E | Level Up | | | 2200 | 3.9k |
| 1997F | Chips on a Line | | | 2700 | 1.3k |
| 1996D | Fun | | | 1500 | 20k |
| 1996G | Penacony | | | 2200 | 2.4k |
| 1995A | Diagonals | | | 800 | 26.6k |
| 1995B1 | Bouquet (Easy Version) | | | 1100 | 21.3k |
| 1995C | Squaring | | | 1800 | 10.4k |
| 1995D | Cases | | | 2300 | 3k |
| 1994G | Minecraft | | | 2600 | 1.7k |
| 1993F1 | Dyn-scripted Robot (Easy Version) | | | 2400 | 1.2k |
| 1992A | Only Pluses | | | 800 | 50.1k |
| 1992E | Novice's Mistake | | | 1700 | 11k |
| 1992F | Valuable Cards | | | 1900 | 7.7k |
| 1991F | Triangle Formation | | | 2200 | 2.8k |
| 1990A | Submission Bait | | | 900 | 27.2k |
| 1990C | Mad MAD Sum | | | 1500 | 14.9k |
| 1990D | Grid Puzzle | | | 1800 | 7.9k |
| 1990F | Polygonal Segments | | | 2800 | 464 |
| 1989B | Substring and Subsequence | | | 1200 | 23.6k |
| 1989D | Smithing Skill | | | 1900 | 7.2k |
| 1988A | Split the Multiset | | | 900 | 27.3k |
| 1988D | The Omnipotent Monster Killer | | | 2000 | 6.1k |
| 1988E | Range Minimum Sum | | | 2300 | 1.9k |
| 1987E | Wonderful Tree! | | | 2000 | 4.2k |
| 1986A | X Axis | | | 800 | 48.6k |
| 1986B | Matrix Stabilization | | | 1000 | 30.4k |
| 1986D | Mathematical Problem | | | 1400 | 18.2k |
| 1986G1 | Permutation Problem (Simple Version) | | | 2200 | 2k |
| 1986G2 | Permutation Problem (Hard Version) | | | 2500 | 1.5k |
| 1985B | Maximum Multiple Sum | | | 800 | 57.8k |
| 1985E | Secret Box | | | 1200 | 23.9k |
| 1985H1 | Maximize the Largest Component (Easy Version) | | | 1700 | 7.4k |
| 1984D | ''a'' String Problem | | | 2000 | 4k |
| 1984F | Reconstruction | | | 2500 | 1.2k |
| 1983C | Have Your Cake and Eat It Too | | | 1400 | 14.9k |
| 1983G | Your Loss | | | 3000 | 325 |
| 1982B | Collatz Conjecture | | | 1200 | 20k |
| 1982D | Beauty of the mountains | | | 1700 | 10.2k |
| 1982E | Number of k-good subarrays | | | 2300 | 1.9k |
| 1981A | Turtle and Piggy Are Playing a Game | | | 800 | 24.4k |
| 1981C | Turtle and an Incomplete Sequence | | | 1800 | 6.4k |
| 1979A | Guess the Maximum | | | 800 | 32k |
| 1979D | Fixing a Binary String | | | 1800 | 8k |
| 1979F | Kostyanych's Theorem | | | 2900 | 451 |
| 1978E | Computing Machine | | | 2000 | 4.7k |
| 1977C | Nikita and LCM | | | 1900 | 8.2k |
| 1977D | XORificator | | | 2300 | 2.4k |
| 1975A | Bazoka and Mocha's Array | | | 800 | 20.9k |
| 1975B | 378QAQ and Mocha's Array | | | 1000 | 21.3k |
| 1975C | Chamo and Mocha's Array | | | 1200 | 17.4k |
| 1975D | Paint the Tree | | | 1700 | 7.6k |
| 1975F | Set | | | 2600 | 1.1k |
| 1974F | Cutting Game | | | 1900 | 4.5k |
| 1973A | Chess For Three | | | 900 | 28.9k |
| 1973D | Cat, Fox and Maximum Array Split | | | 2400 | 2.3k |
| 1973F | Maximum GCD Sum Queries | | | 3100 | 345 |
| 1972A | Contest Proposal | | | 800 | 26.2k |
| 1971F | Circle Perimeter | | | 1600 | 12.7k |
| 1970A2 | Balanced Unshuffle (Medium) | | | 2400 | 621 |
| 1970D1 | Arithmancy (Easy) | | | 2100 | 967 |
| 1970G2 | Min-Fund Prison (Medium) | | | 2200 | 907 |