Inspired by this blogpost
I haven't participated in a codeforces contest for more than a year with a half, and don't think that'll change in near future for blah blah blah whatever reason, I feel the same as author of the linked above blogpost, adding from myself maybe only the feeling that competitive programming is not that fun once you don't have any IOIs ahead and can be paid for time spent working, not practicing :D
For anyone interested, I'm adding the list of my problems to ever appear at Olympiads so far. Few more words here, even though being High-Effort/Low-Reward, I'm happy for taking (at least few steps on) the path of problemsetting regional/international competitions/olympiads, and would genuinely recommend it to those who finish their high school, but were OI enthusiasts.
In the order of my preference (or whichever I recalled earlier lol), not chronologically:
Gugustiuc (guess the permutation), RMI'25, November 2025. Fun interactive problem. Surprisingly, very little number of solves in-contest.
Kitten, IATI'25, April 2025. Loved making observations about Trees and Diameters, and formally proving the solution :) Ended up both in Senior and Junior divisions, had a decent number of solves in the Senior division.
KiloBoom, UJGOI'26, March 2026. Honestly, one of the coolest solutions I ever came up with. Shout out to MAKMED1337 for coming up with the solution idea first and pushing me to see it too :) Btw, inspired by the MegaBonk game, try it out i guess.
Happy, EJOI'25 Shortlisted, later used in IATI'26, April 2026. Cool simple problem, used in Junior group, you don't have to complicate the solution =)
Sweets, EJOI'24, August 2024. My first ever problem used in an International Olympiad :)
Mountains, UJGOI'26, March 2026. A simple div2B-difficulty problem. If you dare proof your solution, has a cool proof of optimalty.
Beautiful Slice, UJGOI'26, March 2026. This is what happens to an otherwise healthy mind when stuck at a gas station in Slovakia for 15 hours. Genuinely don't recommend anyone try to solve or implement it :D
Min-Max-Multiply! UJGOI'26 Qual. R1, somewhere in late 2025. Could be a cute div2 D/E?
My other not-so-interesting problems from UJGOI Qual rounds, in particular, Round 2, and some of the problems of Round 1. Not too interesting, good for beginners, I guess?
To finish this,

















