| 2018E2 | Complex Segments (Hard Version) | | | 3400 | 210 |
| 2014D | Robert Hood and Mrs Hood | | | 1400 | 16.3k |
| 2014G | Milky Days | | | 2200 | 1.8k |
| 2014H | Robin Hood Archery | | | 1900 | 6k |
| 2013F1 | Game in Tree (Easy Version) | | | 2700 | 679 |
| 2013F2 | Game in Tree (Hard Version) | | | 3500 | 171 |
| 2011F | Good Subarray | | | unrated | 132 |
| 2011I | Stack and Queue | | | unrated | 24 |
| 2009F | Firefly's Queries | | | 1700 | 8.7k |
| 2009G1 | Yunli's Subarray Queries (easy version) | | | 1900 | 5.6k |
| 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 |
| 2007B | Index and Maximum Value | | | 900 | 26k |
| 2006B | Iris and the Tree | | | 1800 | 4.4k |
| 2006C | Eri and Expanded Sets | | | 2300 | 2.1k |
| 2006D | Iris and Adjacent Products | | | 2600 | 997 |
| 2006E | Iris's Full Binary Tree | | | 3100 | 328 |
| 2005D | Alter the GCD | | | 2400 | 1.3k |
| 2005E2 | Subtangle Game (Hard Version) | | | 2500 | 1.1k |
| 2004D | Colored Portals | | | 1600 | 13.5k |
| 2004F | Make a Palindrome | | | 2600 | 1.4k |
| 2004G | Substring Compression | | | 3200 | 425 |
| 2003E2 | Turtle and Inversions (Hard Version) | | | 2700 | 654 |
| 2003F | Turtle and Three Sequences | | | 2800 | 838 |
| 2002D1 | DFS Checker (Easy Version) | | | 1900 | 5.2k |
| 2002D2 | DFS Checker (Hard Version) | | | 2300 | 2.9k |
| 2002E | Cosmic Rays | | | 2300 | 3k |
| 2001D | Longest Max Min Subsequence | | | 1900 | 6.6k |
| 2000C | Numeric String Template | | | 1000 | 32k |
| 2000E | Photoshoot for Gorillas | | | 1400 | 16.5k |
| 2000H | Ksyusha and the Loaded Set | | | 2200 | 2.4k |
| 1998D | Determine Winning Islands in Race | | | 2100 | 4.2k |
| 1998E1 | Eliminating Balls With Merging (Easy Version) | | | 2200 | 2.3k |
| 1998E2 | Eliminating Balls With Merging (Hard Version) | | | 2500 | 927 |
| 1997C | Even Positions | | | 1100 | 25.8k |
| 1997E | Level Up | | | 2200 | 3.9k |
| 1996E | Decode | | | 1600 | 12.9k |
| 1996G | Penacony | | | 2200 | 2.4k |
| 1995B2 | Bouquet (Hard Version) | | | 1700 | 10.3k |
| 1995E1 | Let Me Teach You a Lesson (Easy Version) | | | 2700 | 537 |
| 1995E2 | Let Me Teach You a Lesson (Hard Version) | | | 2900 | 417 |
| 1990E1 | Catch the Mole(Easy Version) | | | 2500 | 1.2k |
| 1990E2 | Catch the Mole(Hard Version) | | | 2600 | 1.2k |
| 1990F | Polygonal Segments | | | 2800 | 464 |
| 1989D | Smithing Skill | | | 1900 | 7.2k |
| 1988E | Range Minimum Sum | | | 2300 | 1.9k |
| 1987E | Wonderful Tree! | | | 2000 | 4.2k |
| 1986B | Matrix Stabilization | | | 1000 | 30.4k |
| 1986C | Update Queries | | | 1100 | 26.3k |
| 1986G1 | Permutation Problem (Simple Version) | | | 2200 | 2k |
| 1986G2 | Permutation Problem (Hard Version) | | | 2500 | 1.5k |
| 1985F | Final Boss | | | 1500 | 20.5k |
| 1985H1 | Maximize the Largest Component (Easy Version) | | | 1700 | 7.4k |
| 1985H2 | Maximize the Largest Component (Hard Version) | | | 2200 | 2k |
| 1983D | Swap Dilemma | | | 1700 | 11.5k |
| 1983F | array-value | | | 2500 | 1.6k |
| 1982C | Boring Day | | | 1200 | 22.3k |
| 1982D | Beauty of the mountains | | | 1700 | 10.2k |
| 1982F | Sorting Problem Again | | | 2600 | 1.3k |
| 1981E | Turtle and Intersected Segments | | | 2600 | 1.3k |
| 1981F | Turtle and Paths on a Tree | | | 3000 | 358 |
| 1980E | Permutation of Rows and Columns | | | 1600 | 13.3k |
| 1980F1 | Field Division (easy version) | | | 1900 | 4.5k |
| 1980G | Yasya and the Mysterious Tree | | | 2300 | 1.8k |
| 1979E | Manhattan Triangle | | | 2400 | 1.9k |
| 1978C | Manhattan Permutations | | | 1300 | 18k |
| 1978D | Elections | | | 1600 | 13.9k |
| 1978E | Computing Machine | | | 2000 | 4.7k |
| 1978F | Large Graph | | | 2400 | 1.6k |
| 1977C | Nikita and LCM | | | 1900 | 8.2k |
| 1976D | Invertible Bracket Sequences | | | 2000 | 5.9k |
| 1976E | Splittable Permutations | | | 2500 | 1.3k |
| 1976F | Remove Bridges | | | 2800 | 893 |
| 1975E | Chain Queries | | | 2100 | 2.9k |
| 1974C | Beautiful Triple Pairs | | | 1400 | 19.3k |
| 1974F | Cutting Game | | | 1900 | 4.5k |
| 1974G | Money Buys Less Happiness Now | | | 2000 | 6.2k |
| 1973B | Cat, Fox and the Lonely Array | | | 1300 | 17.1k |
| 1971G | XOUR | | | 1700 | 11.7k |
| 1969D | Shop Game | | | 1900 | 5.8k |
| 1969E | Unique Array | | | 2400 | 1.9k |
| 1968F | Equal XOR Segments | | | 1800 | 7.1k |
| 1968G1 | Division + LCP (easy version) | | | 1900 | 5.4k |
| 1968G2 | Division + LCP (hard version) | | | 2200 | 2.6k |
| 1967C | Fenwick Tree | | | 2300 | 2.3k |
| 1967F | Next and Prev | | | 3200 | 104 |
| 1965F | Conference | | | 3300 | 298 |
| 1957F1 | Frequency Mismatch (Easy Version) | | | 2600 | 706 |
| 1957F2 | Frequency Mismatch (Hard Version) | | | 2700 | 659 |
| 1956A | Nene's Game | | | 800 | 24.5k |
| 1956F | Nene and the Passing Game | | | 3000 | 747 |
| 1955B | Progressive Square | | | 1000 | 32.8k |
| 1955D | Inaccurate Subsequence Search | | | 1400 | 18.9k |
| 1954E | Chain Reaction | | | 2200 | 3k |
| 1951B | Battle Cows | | | 1200 | 17k |
| 1951F | Inversion Composition | | | 2500 | 1k |
| 1946F | Nobody is needed | | | 2500 | 1.3k |
| 1945F | Kirill and Mushrooms | | | 1900 | 5.2k |
| 1945G | Cook and Porridge | | | 2500 | 946 |