| 2036G | Library of Magic | | | 2200 | 1.7k |
| 2035D | Yet Another Real Number Problem | | | 1800 | 5.9k |
| 2035E | Monster | | | 2300 | 2k |
| 2035F | Tree Operations | | | 2500 | 1.1k |
| 2032C | Trinity | | | 1400 | 16.6k |
| 2031D | Penchick and Desert Rabbit | | | 1700 | 10.1k |
| 2031F | Penchick and Even Medians | | | 2800 | 476 |
| 2030F | Orangutan Approved Subarrays | | | 2400 | 1.2k |
| 2029C | New Rating | | | 1700 | 7.8k |
| 2028B | Alice's Adventures in Permuting | | | 1400 | 13.6k |
| 2028C | Alice's Adventures in Cutting Cake | | | 1600 | 10.3k |
| 2027D1 | The Endspeaker (Easy Version) | | | 1700 | 7.1k |
| 2027D2 | The Endspeaker (Hard Version) | | | 2200 | 1.9k |
| 2026B | Black Cells | | | 1300 | 16.8k |
| 2026C | Action Figures | | | 1500 | 12.9k |
| 2026D | Sums of Segments | | | 1900 | 6.1k |
| 2025A | Two Screens | | | 800 | 29.1k |
| 2025C | New Game | | | 1300 | 19.4k |
| 2024B | Buying Lemonade | | | 1100 | 17.3k |
| 2023B | Skipping | | | 1700 | 7.3k |
| 2022B | Kar Salesman | | | 1300 | 14.9k |
| 2022D1 | Asesino (Easy Version) | | | 1900 | 4.1k |
| 2022E1 | Billetes MX (Easy Version) | | | 2500 | 780 |
| 2022E2 | Billetes MX (Hard Version) | | | 2600 | 730 |
| 2020B | Brightness Begins | | | 1200 | 22.1k |
| 2018B | Speedbreaker | | | 1900 | 5.3k |
| 2018E1 | Complex Segments (Easy Version) | | | 3300 | 246 |
| 2018E2 | Complex Segments (Hard Version) | | | 3400 | 210 |
| 2014C | Robin Hood in Town | | | 1100 | 28k |
| 2013D | Minimize the Difference | | | 1900 | 7.6k |
| 2013F1 | Game in Tree (Easy Version) | | | 2700 | 679 |
| 2013F2 | Game in Tree (Hard Version) | | | 3500 | 171 |
| 2009E | Klee's SUPER DUPER LARGE Array!!! | | | 1400 | 18.1k |
| 2009G1 | Yunli's Subarray Queries (easy version) | | | 1900 | 5.6k |
| 2009G2 | Yunli's Subarray Queries (hard version) | | | 2200 | 1.8k |
| 2008C | Longest Good Array | | | 800 | 37k |
| 2008G | Sakurako's Task | | | 1800 | 6.8k |
| 2008H | Sakurako's Test | | | 2100 | 3.7k |
| 2005B2 | The Strict Teacher (Hard Version) | | | 1200 | 22.2k |
| 2005D | Alter the GCD | | | 2400 | 1.3k |
| 2004D | Colored Portals | | | 1600 | 13.5k |
| 2004F | Make a Palindrome | | | 2600 | 1.4k |
| 2002D2 | DFS Checker (Hard Version) | | | 2300 | 2.9k |
| 2001C | Guess The Tree | | | 1500 | 13.1k |
| 2000G | Call During the Journey | | | 2100 | 3.2k |
| 2000H | Ksyusha and the Loaded Set | | | 2200 | 2.4k |
| 1999G1 | Ruler (easy version) | | | 1500 | 15k |
| 1999G2 | Ruler (hard version) | | | 1700 | 11.5k |
| 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 |
| 1997D | Maximize the Root | | | 1500 | 16.3k |
| 1997E | Level Up | | | 2200 | 3.9k |
| 1996A | Legs | | | 800 | 58.7k |
| 1996D | Fun | | | 1500 | 20k |
| 1996F | Bomb | | | 1900 | 6.5k |
| 1995B1 | Bouquet (Easy Version) | | | 1100 | 21.3k |
| 1995B2 | Bouquet (Hard Version) | | | 1700 | 10.3k |
| 1994C | Hungry Games | | | 1600 | 13.9k |
| 1993D | Med-imize | | | 2200 | 4.5k |
| 1990E1 | Catch the Mole(Easy Version) | | | 2500 | 1.2k |
| 1990E2 | Catch the Mole(Hard Version) | | | 2600 | 1.2k |
| 1988E | Range Minimum Sum | | | 2300 | 1.9k |
| 1986G1 | Permutation Problem (Simple Version) | | | 2200 | 2k |
| 1985F | Final Boss | | | 1500 | 20.5k |
| 1983C | Have Your Cake and Eat It Too | | | 1400 | 14.9k |
| 1983F | array-value | | | 2500 | 1.6k |
| 1982C | Boring Day | | | 1200 | 22.3k |
| 1982F | Sorting Problem Again | | | 2600 | 1.3k |
| 1979C | Earning on Bets | | | 1200 | 22.5k |
| 1979E | Manhattan Triangle | | | 2400 | 1.9k |
| 1978B | New Bakery | | | 800 | 25.6k |
| 1976C | Job Interview | | | 1600 | 12.6k |
| 1976D | Invertible Bracket Sequences | | | 2000 | 5.9k |
| 1975C | Chamo and Mocha's Array | | | 1200 | 17.4k |
| 1975E | Chain Queries | | | 2100 | 2.9k |
| 1974F | Cutting Game | | | 1900 | 4.5k |
| 1973B | Cat, Fox and the Lonely Array | | | 1300 | 17.1k |
| 1971E | Find the Car | | | 1500 | 18.7k |
| 1971F | Circle Perimeter | | | 1600 | 12.7k |
| 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 |
| 1967A | Permutation Counting | | | 1400 | 15.2k |
| 1967D | Long Way to be Non-decreasing | | | 2800 | 998 |
| 1957F1 | Frequency Mismatch (Easy Version) | | | 2600 | 706 |
| 1957F2 | Frequency Mismatch (Hard Version) | | | 2700 | 659 |
| 1956A | Nene's Game | | | 800 | 24.5k |
| 1954E | Chain Reaction | | | 2200 | 3k |
| 1952G | Mathematician Takeover | | | unrated | 1.2k |
| 1951B | Battle Cows | | | 1200 | 17k |
| 1951H | Thanos Snap | | | 3200 | 380 |
| 1951I | Growing Trees | | | 3200 | 118 |
| 1949B | Charming Meals | | | 1500 | 5k |
| 1946C | Tree Cutting | | | 1600 | 14.1k |
| 1945E | Binary Search | | | 1700 | 9.9k |
| 1945G | Cook and Porridge | | | 2500 | 946 |
| 1943E1 | MEX Game 2 (Easy Version) | | | 2900 | 551 |
| 1943E2 | MEX Game 2 (Hard Version) | | | 3300 | 379 |