Привет, Codeforces!
Я рад пригласить вас на раунд Codeforces Round 1134 (Div. 4), который пройдёт 12.11.2026 17:35 (Московское время). После довольно долгого перерыва я снова взялся за подготовку задач — на этот раз в паре с ИИ-агентами. Для меня это эксперимент по возвращению в подготовку задач, и мы вместе посмотрим, насколько ИИ окажется успешным напарником в этой деятельности. Жду на раунде и участников четвёртого дивизиона, и всех, кто решит поучаствовать вне конкурса!
Не уверен, что точно попаду в ожидаемую сложность современных раундов четвёртого дивизиона или удовлетворю все ваши ожидания и надежды, но мне показалось, что в предлагаемых мной задачах есть красивое. Я призываю вас не поддаваться искушению пользоваться ИИ или какими-то другими нечестными средствами и пройти этот интеллектуальный праздник вместе со мной, вместе с честными участниками, сделав из этого хорошее, интересное соревнование. Чтобы не было путаницы: я считаю ИИ инструментом, и отказываться от его помощи при разработке Codeforces или подготовке задач было бы глупо. Но инструментом нужно пользоваться по делу, а нарушать с его помощью правила во время раунда — это точно не по делу. Во время соревнования у участников есть правила, и они одинаковы для всех.
Я очень благодарен всем вовлечённым и неравнодушным, кто помог этому раунду состояться:
- cry — за координацию раунда. Он был очень внимателен и тактичен. Я рад поработать с ним именно в таком статусе — я как автор, а он как координатор, — и очень ценю его вклад в развитие сообщества.
- Отдельное спасибо Vladosiya за его многочасовую работу по поиску читеров после каждого раунда. К сожалению, я уверен, что и после этого раунда по итогу его работы нас ждут большие изменения в таблице результатов.
- Нашим тестерам: AksLolCoding, aryanc403, Proof_by_QED, awoo, WorldWarV, Edeeva, lenarusw, yse, wakanda-forever, 2-qiym, simplelife, Vladosiya, 46657526buscaR, DivinePunishment, samsoom, chromate00, nik_exists, samyh, linearspace, youssef579, apollo07, vulestamenkovic, ayoooy, s83757, lattermatter, hannah12345, ethantran314, sabino1, LCatharsis, sovenok1, nifeshe, Error_Yuan, Euclid73, koseitsukamoto.
Формат соревнования такой же, как в раундах Div. 3:
- 8 задач и 2 часа 15 минут на их решение;
- правила ICPC со штрафом 10 минут за неверную попытку;
- 12-часовая фаза открытых взломов после окончания раунда (взломы не дают дополнительных очков);
- после окончания фазы открытых взломов все решения будут протестированы на обновлённом наборе тестов, а рейтинг пересчитан;
- по умолчанию в таблице результатов показываются только «достоверные» участники (но рейтинг будет пересчитан для всех с начальным рейтингом меньше 1400 или для не имеющих рейтинга участников/новичков).
В официальную таблицу результатов войдут только достоверные участники четвёртого дивизиона. Чтобы считаться достоверным участником четвёртого дивизиона, необходимо:
- поучаствовать не менее чем в пяти рейтинговых раундах (и решить в каждом из них хотя бы одну задачу),
- не иметь в истории рейтинга точки 1400 или выше.
Независимо от того, являетесь ли вы достоверным участником четвёртого дивизиона или нет, если ваш рейтинг меньше 1400 (или вы новичок / не имеете рейтинга), то раунд будет для вас рейтинговым (если вы сами не выберете участие вне конкурса при регистрации).
Я прошу участников с рейтингом 1400+ не регистрировать новые аккаунты, а просто принять участие вне конкурса. Также напоминаю о правиле, ограничивающем использование ИИ во время соревнования.
P.S. О личном: сегодня для меня по-настоящему особенный и важный день — моей дочери исполнилось 15 лет. Я до сих пор помню, как 15 лет назад сидел в роддоме с ноутбуком и решал, переносить ли раунд (спойлер: в итоге его перенесли). Как летит время... С днём рождения, моя дорогая!
Удачи, и надеюсь, что задачи вам понравятся!









As a tester, mike orz
Congrats mr!!!
That is the cutest Round and blog that will ever be written in the existence of Codeforces!
orz tanya, orz mike, orz cf
mike's comeback before gta 6 🔥
no div 4 for 7 months, and the goat returns with AI as his sidekick :-)
Thank you mike for this great website! To be honest, CF is now a part of my life, and I cant believe how I would be if I didnt know CF. And thank you for making a div4 (especially when there are only 2 div4s till now in 2026 :D). Although I'm now unrated for div4 (-_-), I will certainly participate in it :)
what about our div4?
oh dear.... here we go again, now u guys are gonna track mike , find his discord and spam him too......
yo I won't
tbh stop doing those disgusting jokes
orz DuyMinh3005
there is oly one way u could become his son in law........ u r gonna get banned soon son........
just give up atp
...
Happy Birthday, Tanya! Today's also a special day to me because it's my father's birthday :D
cutest announcement blog ever!
(trust me bro i'm not just talking about the last image)
the left guy is so kawaii UwU
what's a kawaii
It means cute, adorable these type things.
Happy birthday to your daughter. May God bless her with happiness.
No way div 4 comeback in big 2026 before GTA 6
The founder himself...
это очень мило,,,,, с днём рождения
Wow, a round authored by mike! I really need a round to escape the goddamn mid-term exam :sob, thank you for your devotion to this round, this platform and CP:)
Yeppies, hbd tanya !!!
As a tester, this is the first round I've ever tested. Also Mike orz!
the goat
I'm honored to be able test the greatest div. 4 ever made
I can't wait to participate in the greatest Div 2 ever made
Finally mike is coming back
As a tester, I'm honored to have been selected by Mike.
orz
As a tester, I ran out of div2/3/4 contests to test.
btw how did you get selected!
He said he "filtered some accounts with good history and zero cheating flags."
But I would imagine some amounts of rng was also involved for me to specifically be selected.
hmmmm interesting
MIKE THE GOATT
I'm proud that cf creator is so sigma
Mike orz
aahhh... Can't wait to give the contest created by the creator of this creation!!
mike's comeback before window 12
As a tester, I've had a great time testing the problems, and I hope everyone participating will enjoy them as well <3
Yayyy!!! Happy Birthday Tanya!
Mike orz!!
Поздравляю вас! :)
7 months without Div. 4 and now we're finally getting one.
больше всего меня интересует ваша фигура.
шутка
You are so goated unc!
I wish everyone to reach the level they want.
Thanks for having me as a tester
Good luck to everyone participating!
Big honor to the div, my bro
Big honor to the div, my brother
wholesome full read!
goat
С днем рождения дочь легенды!!!!!!
What is this place? It looks so beautiful
orz
Big fan bro
Can't wait! This will be my second contest of codeforces, and my first div 4.
Good luck!
I really hope that means that the problems are hard
Pls dont let problem a be a XOR problem
I mostly meant the later problems
As a tester, good luck and have fun on the problems
As a tester
Such a special day for the GOAT to return, HBD Tanya!
Ok codex add dark mode
Fun fact: The bush in the picture is a bramble.
Congrats! Maybe... with such impressive AI technologies we can add Zig on codeforces?))))
zig means turd in colloquial Arabic
Can confirm LOL
finally a div 4 round
I just realized we can not use the "we have .... before CF div4" anymore...
We got cf div 4 before gta 6...
$$$\text{Good luck compe}\textbf{Tito}\text{rs !!!}$$$
Yeeeees, Div.4
You're just cool, Muscle head, but why -1?
Assalamualaikum Brother
Wa alaykumu s-salam
bruh
As a Temu tester happy birthday to your daughter and the contest was easy guys..trut me
As a non-tester, orz mike
This tester is writing a comment about praising Mike for the Codeforces platform and wishing everyone good luck on this Div 4.
I hope this doesn't affect (or maybe burn) the codeforces' servers.
welcome back boss! happy birthday to tanya!
IT IS PEAK!
Have a great life ahead with your daughter. Stay happy
happy birthday to your daughterr mike
orz
رعب
no way guys, whats wrong? After all, I didn't hurt anyone's feelings. ahh what's wrong with this community
It's probably because people hate overwatch
I cannot see this post as anything but "Codeforces Founder and CEO wholeheartedly endorses using LLMs for problemsetting", and it is terrifying. I have already seen AI usage in proposals I pre-reviewed, ranging from using AI to translate statements and solutions to full AI-slop proposals. I'm afraid this blog will fully open the floodgates, and, as far as I'm aware, there are no official rules or guidelines for what is allowed and what isn't.
Endorsing LLMs as a tool doesn’t mean endorsing unreviewed output: the author and coordinators remain fully responsible for correctness, originality and quality. AI-slop is just a quality problem, and a ban is unenforceable since LLM use can’t be reliably detected, it would only push people to hide it. What we actually need is explicit guidelines: disclosure of substantial LLM use, full author accountability for statements, solutions and tests, and the right for coordinators to reject unverified generated content.
issue is, people are going to see this and submit AI slop proposals without looking over them, and even though they'll (likely) get rejected, it increases the workload on the prereviewers (see what's happening with a lot of OSS projects banning AI contributions).
Fair concern, but it’s an argument for clear rules, not against the post. Right now there are no guidelines, so nobody can point to a rule when rejecting low-effort submissions. Instead of trying to detect AI, we should raise the cost of a bad proposal: require disclosure of substantial LLM use, require the author to prove correctness up front (verified solution, checker, stress-tested generator), and let prereviewers reject unverified submissions without a full review.
The main issue with getting AI to problemset is not that it makes incorrect problems, but it's that the author doesn't understand the problem they're submitting, meaning they can't do quality control on it (if it's a bad problem) nor can they discuss the problem with coord / testers well (assuming it gets past prereview). Besides, even with safeguards in place, it still wastes the time of prereviewers when having to figure out what is slop and what's not.
If an author can't explain their own problem or provide a fully working solution and stress-tested generator upfront, coordinators shouldn't spend time reviewing it—just insta-reject it. Combine that with submission cooldowns for low-quality spam, and you protect reviewer time without pretending an LLM ban is enforceable.
If there is no LLM ban, a proposer with LLM can ask a reasonable question "what did I do wrong?". Right now a proposer can just say out loud "all the problems are authored by ChatGPT", and I don't have any reasons to reject that proposal outright.
agree
That’s why the rule shouldn't be "no LLMs", it should be "a human must be the primary intellectual author".
If the guidelines state that LLMs can only be used as auxiliary tools (translation, phrasing, boilerplate code) and not to originate the problems, then "all problems are authored by ChatGPT" has an instant, explicit answer to "what did I do wrong?" — it violates the authorship rule and gets rejected outright, without banning legitimate tool usage.
MikeMirzayanov
Agree, without leaking too much about our round, claude almost broke our polygon prep
Doubt
Is your strategy to say this so I can’t argue with you in public without leaking the problems so everyone thinks you are right because you are the coordinator
On one side, I completely agree—using AI kills the uniqueness of a round and makes it less human; but on the other side, this is the current reality, and there’s nothing to be done about it :(
in a long time, and now is my the first try w div4 :))
Happy Birthday Tanya! Uiii
Felt the aura from 15 divs ago
Congrats
Btw Congrats Tanya, and thank you MikeMirzayanov for making div.4! I waited for sooo long!
orz orz orz
Congrats Mike!
Happy Birthday Tanya
Happy birthday!
She got a Great father.
happy birthday for your daughter , I hope a very good life for her and forever be happy
div 4 after so long, orz mike, hbd tanya!!
Happy birthday tanaya !
unc being chad
btw, happy birthday to your daughter!
May I ask how to become a tester in Codeforces? I'm a newbie in Codeforces.
So sad that I have to miss this round, I think this will be one of the best in a long time
Why upcoming Div4 contest is showing as unrated allowed for my handle ? My current rating is 1275.
Unrated is allowed for all users. Pupils and under can choose to participate rated or unrated, but everything above has to participate unrated
Okay so MikeMirzayanov hitting gymmm :)
hi, im new to code forces, how can i take part in this upcoming contest ?
Congrats, Mr Mirzayanov, I am really happy for you and I am making sure to not to register new account :) And div.4 before GTA 6 hits crazy :)
my first unrated div 4, feels good :)
how do i always miss these posts and don't farm contribution for testing. orz Mike :D
С днем рождения Таня!
HPBD Tanya (I'm a bit late but it's fine) Goat Mike orz Looking forward to the contest :P
I am a new comer, participating since 2 months on this platform regularly, thanks Mik for this platform And also my best birthday wishes to your daughter, its my dad's bday today as well, i am going to enjoy it and come tommorow for the round..
The Goat himself...
I hope we figure out how people don't cheat and use AI in the contest !!
pls no xor problem
excited!
Mike is so strong now, hard to recognize...
It's my first time competing out of competition as well :)
Hopefully it goes well (but its not like I can lose any rating ;) )
Is this San Salvatore mountain?
Yo Guys , Today i am going for an all kill and will reach expert , but will definetly lose my expert in next contest , Watch me do an all kill u noobsss. hahaha
ill let my body become slave of wrusb if i didnt solved B
sorry wrusb kun
why didn't you solve F
me not that orz
As a tester, Mike and Tanya orz
Amazing Round !!!
Tanya is 15!
737E — Tanya is 5!
How did 4k+ people solve E ? is the skill cap so high now or it's just a skill issue
Good problems. the author could have a good future in CP if he keeps practicing
Peak contest! Loved problem E, but could not get to code it as I didn't figure out how to propagate the movements. D was great also.
May I ask you about problem D? Could you tell me about the greedy approach you used for it? :D
This is my approach:
Suppose you need to bring C down to A, also B down to A in another index. This means we have to make C->B->A, and also B->A. What the best way to do this?
We use C->B, now the newly-made B is the same as old B. Therefore only one move to B->A. We can easily implement this approach by using an array.
For sure! So the problem is actually beautiful. I figured it out on paper, it just made sense.
The first idea you must have in mind, that a string is palindromic, if, and only if, for each char s[i], s[n-1-i] is the same.
The second idea, is that then you can yield each pair with a number. For example, let's say c_1 = 'a' and c_2 = 'd', then it's like (1,4). You just preserve the distance
This is the mindblowing part, I think. It just came for me out from nowhere, but also analyzing the test cases. If you figure out, you can have equivalence classes like, the set that yields all the pairs that have to go with an a. So, pretty much, if you have a pair (a,g), you know that you have to waste those movements. Then, anything in between, is optimal to yield below those movements, let's say, (b,d), (e, g), etc. As, you won't waste movements for changing all the "bigger" characters at once, since it's a valid operation.
Ultimately, you have to do a set union greedy. Since you want to take all the subsets that are pretty much ended when a word is sent to the minimum character, you would do the interval union greedy in order to get everything done. For example, (a,g) (b,c) (c, d) (e,f) Can be seen as (0,6), (1,2), (2,3), (4,5) And then, you only need 6 movements, (6-0), for getting all of them to a.
For example, if you had another one that is like (r,z), (r,p). You also add them and you have to return the sum over all the differences between l and r for each subset.
Hope you understood! :) I'm pretty proud I could figure this out, even though I'm frustrated for being unable to implement E.
I think the following variant of H would have been much better to set (it's simpler to implement, and more elegant):
Binary search for $$$x$$$.
Consider a single check:
Thanks for the contest, MikeMirzayanov
I feel very satisfaction through this round. The difficulty is difficult Div3 imo. Actually every tasks have something interesting ad-hoc. I wonder how to maintain great problem-solving skill so long term. Go for it, truely eternal legend!
is E just guessforces? where does that formula come from
the order of moves doesn't change the number of moves..
you can simulate what is going on and try to get the number of needed operations to finish the game , the game will finish when all numbers are zero
I dunno why, I am not showing up in official standings and nor is carrot working for my position in friends standings, while I can see the perf of other participants.
how to solve F
Think about how many elements are to the left of x in p. Split them into smaller and greater than x: the left-smaller count minus the right-greater count is b_x, while the number of greater elements not on the right is exactly the ones on the left.
happy birthday to daughter!
Майк машина, скоро Смаева догонишь
Very good round, really loved problem F <3
old school style contest...very good
The difficulty felt like an average div3 contest, but the problems were good. I solved E using lazy segment tree while modding by 2 in updates. Overkill, but shouldn't be hacked (hopefully).
mike is the goat. he hasnt forgotten about us after all this time...
I joined for the last 25 minutes, and while I did decent for the time available, I think I will be bombed in the rankings which does not account for starting time (I get why). Is there a way to not lose ratings, like playing as an unrated player?
Since the end of contest, I tried doing the virtual participation thing, but after 2-3 submissions, I'm thrown out of the virtual contest, and into practice page. I tried 3 times but every time same thing occurs.
Aminoff (top1 in rated standings) is suspicious
(https://postimg.cc/ygYPsqM2) one of his submission to problem C. He alr wrote "using namespace std;" and yet uses "std::".
(i shared via link, cuz uploading img via link didnt work on me)
He’s already been banned once. Don’t worry too much about it.
Wait until you find out that I also use long long where int would suffice. Truly groundbreaking evidence
Happy Birthday to Tanya. It was a beautiful round indeed. I enjoyed solving the problems.
Cool problems (F is my fav)
G2 was very hard but contest was good
MikeMirzayanov can you please look at the personal message I sent you?
Thanks a lot!!!
MikeMirzayanov Please????
Super important
(Regarding my main banned account) Thanks MikeMirzayanov
Maybe a bit biased as this was definitely one of my best contests, but I always enjoy problems where you try many different approaches, and the one that sticks is the one that is the most elegant and easy to implement ;) Nice round!
I went through a difficult time, but now I'm back to training. 2027 will be my year, I'll be back in full force.
This contest was great, especially E. Thanks Mike (and happy birthday to your daughter!).
Alternate Solution for E:
Just simulate what is said in the question using a Lazy Segment Tree.
Solution: https://codeforces.me/contest/2290/submission/398367362
I figured this out within 2 minutes but i did not handle the overflow properly :'(
actually overflow doesn't matter if you use int which preserves the mod 2 property
I was using long long and it got WA2
Submission: https://codeforces.me/contest/2290/submission/398366331
In C++ integer overflow is undefined behavior. You can use
unsignedif you want wraparound behavior.I used Fenwick Tree and it didnt gave me integer overflow 398327494
My error was that i was using a range max LST
So when the integer overflowed, it got reset to -INF and the parity got lost
I changed it to range sum and it got AC!
https://codeforces.me/contest/2290/submission/398371704
Hello MikeMirzayanov ,Codeforces Team,
My account vsmokshsharma688 appears to be disabled after the recent Div. 4 contest. Password recovery shows “Disabled user can not change password.”
I don’t know the reason for the disablement, and I didn’t receive any warning or notice. Could you please check my account and let me know why it was disabled?
I would appreciate a review of my case. Thank you for your time.
Regards,
Moksh Sharma
Codeforces handle: vsmokshsharma688
Profile link : https://codeforces.me/profile/vsmokshsharma688
G_Madhumaruthi from 84 to 251. Guys, you can try to hack top 100 cheaters by this test (roll the seed)
Op
Request for Reconsideration of My Disabled Account (@Aaryan_99)
Dear Codeforces Community and Administration,
I am writing this blog to explain my situation regarding my disabled account, @Aaryan_99, following Codeforces Round 1132 (Div. 2).
First, I want to sincerely apologize for my actions during the contest.
During the contest, I got stuck on a problem and made a poor decision by relying on ChatGPT to generate a solution. I submitted that AI-generated solution during the live contest. I understand that this violated the contest rules, and I take full responsibility for it.
I am not writing this post to deny my mistake, blame anyone else, or undermine the importance of fair competition. I understand that competitive programming depends on individual problem-solving ability, and every participant deserves a fair environment.
This was a serious mistake in my judgment. I regret making that decision, and I assure the community that I will not repeat it. I want to improve my programming skills through my own effort, practice, and understanding rather than relying on unauthorized assistance during contests.
I have already contacted the administration and respectfully requested a review of my case. I would sincerely appreciate it if they could reconsider my account disablement and consider whether reinstatement with an appropriate rating penalty or temporary suspension is possible.
I understand that the final decision rests entirely with the Codeforces administration. I am not demanding special treatment; I am simply requesting an opportunity to learn from this mistake and demonstrate that I can follow the rules going forward.
Codeforces has been an important platform in my programming journey. I genuinely hope to have the opportunity to return and participate honestly.
Thank you to everyone who takes the time to read this.
Regards, Aaryan Codeforces Handle: @Aaryan_99
On a personal note, I also came across your message about your daughter turning 15. Please accept my warmest wishes to her on this special milestone. Fifteen years is a beautiful journey, and I hope she has a wonderful birthday filled with happiness, good health, and memorable moments. Congratulations to you and your family!
Nice contest , I understood Impact of hacking on myself after this one
More character development than vegeta fr
Found the place where this picture was took!
imagine seeing a CF div4 contenst after nearly a year and not being able to participate in it :(
pls put another 1 soon
Hello Codeforces Administration and MikeMirzayanov.
I am writing from another account, @x_RME_x, because my original Codeforces account, @Reham_Mahmoud_Emam, has been disabled.
My account was disabled immediately after Codeforces Round 1134 (Div. 4).
Whenever I try to access my original account, I receive the following message:
“User is disabled by administrators.”
I have not received any email explaining the reason for this disablement.
I would like to clarify that I was using Codeforces to practice programming problems and improve my skills. During my regular practice, I sometimes used ChatGPT as a learning and coding-assistance tool.
First, I sincerely apologize if any of my actions or submissions unintentionally violated Codeforces rules. I truly respect the platform and its community, and I never intended to break any rules or gain an unfair advantage. If I made a mistake, I am genuinely sorry and willing to learn from it.
I kindly request a manual review of my original account and the activity that took place around Codeforces Round 1134 (Div. 4).
If a particular submission, activity, security issue, or rule caused the restriction, I would be grateful if you could explain the reason so I can understand what happened and provide any clarification needed.
I am also willing to provide any information necessary to verify that I am the rightful owner of the original account.
If the account was disabled by mistake, I sincerely request that you reconsider the decision and restore my original account.
Thank you for your time, understanding, and consideration.
I sincerely apologize once again for any unintentional mistake.
Original account: @Reham_Mahmoud_Emam Current account (created only to contact the administration): @x_RME_x
Hello! My submission 398335968 for problem 2290H was flagged for plagiarism alongside several other users (arar.istra, somyapolai_jobless, somyapolai, rezazuna). I do not know any of these participants, never shared my code, and solved the problem completely on my own. All of these users, including myself, are from completely different countries. The structural similarity is purely algorithmic. The optimal O(N log N) approach naturally uses an iterative BFS order, bottom-up subtree sizes, tracking the two largest child subtrees (m1 and m2), and checking the two optimal cases for the root's children sorted in descending order. Since there are very few ways to implement this exact greedy DP approach cleanly without recursion limits, independent implementations naturally converge to the same sequence of steps. At the same time, my implementation has clear signs of independent writing. I use long long throughout and a for loop inside main() instead of a separate solve() function. Furthermore, I iterate through all children of the root in a loop rather than hardcoding checks for the first two elements like the other submission does, and the file also contains my personal commented-out Fenwick template from my local workspace. Here is a screenshot of my personal code template with comments and tree test samples: https://postimg.cc/R61xVpXW Since this is a false positive on a standard tree DP and greedy solution, I kindly ask the coordinators to review my submission 398335968. Thank you!
Hello,
I would like to clarify that I wrote my entire solution independently, without copying or referring to anyone else's code. I have never shared my submission with anyone, either publicly or privately, and I had no knowledge of the similarity with the other submission before receiving this notification.
I was genuinely surprised to receive this warning, as I completed the problem on my own and did not collaborate with anyone during the contest. I take Codeforces' rules very seriously and would never intentionally violate the contest regulations.
I kindly ask you to review my case, as the similarity was completely unintentional.
Thank you for your time and consideration.