MikeMirzayanov's blog

By MikeMirzayanov, 8 days ago, In English

Hello Codeforces!

I am glad to invite you to Codeforces Round 1134 (Div. 4), which will take place on Nov/12/2026 17:35 (Moscow time). After quite a long break, I have taken up problem setting again — this time working together with AI agents. For me, this is an experiment in getting back into problem writing, and we will see together how successful AI turns out to be as a partner in this work. I am looking forward to seeing both Div. 4 participants competing officially and everyone else joining out of competition!

Why I decided to author this round (a bit of lyrics and rambling)

I am not sure that I will hit the exact difficulty expected of modern Div. 4 rounds, or satisfy all of your expectations and hopes, but it seemed to me that there is something beautiful in the problems I am offering. I urge you to resist the temptation to use AI to solve the problems or resort to any other form of cheating. Instead, let's go through this intellectual holiday together — me and all the honest participants — and make it a good, interesting competition. To avoid any confusion: I see AI as a tool, and it would be silly to turn down its help when developing Codeforces or preparing problems. But a tool should be used for the right things, and breaking the rules during a round is not one of them. During the contest, participants have rules to follow, and they apply to everyone.

About the judging queue and the infrastructure migration

I am very grateful to everyone who got involved, cared, and helped make this round happen:

Here are the format details for the round:

  • 8 problems and 2 hours 15 minutes to solve them;
  • ICPC rules with a penalty of 10 minutes for an incorrect submission;
  • 12-hour phase of open hacks after the end of the round (hacks do not give additional points);
  • after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings will be recalculated;
  • by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or unrated participants/newcomers).

Only trusted participants of the fourth division will be included in the official standings table. To qualify as a trusted participant of the fourth division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them),
  • have never had a rating of 1400 or higher.

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you (unless you choose to register unrated).

We urge participants whose rating is 1400+ not to register new accounts, but simply to take part unofficially. Please also remember the rule restricting AI use during the contest.


P.S. On a personal note, today is a truly special and meaningful milestone for me—my daughter just turned 15. I still remember sitting in the maternity ward 15 years ago with my laptop, deciding whether to postpone the round (spoiler: it did get postponed). How time flies... Happy birthday, my darling!

Good luck, and I hope you enjoy the problems!

  • Vote: I like it
  • +2280
  • Vote: I do not like it

»
8 days ago, hide # |
 
Vote: I like it +89 Vote: I do not like it

As a tester, mike orz

»
8 days ago, hide # |
 
Vote: I like it +51 Vote: I do not like it

That is the cutest Round and blog that will ever be written in the existence of Codeforces!

orz tanya, orz mike, orz cf

»
8 days ago, hide # |
 
Vote: I like it +145 Vote: I do not like it

mike's comeback before gta 6 🔥

»
8 days ago, hide # |
 
Vote: I like it -23 Vote: I do not like it

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 :)

»
8 days ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

Happy Birthday, Tanya! Today's also a special day to me because it's my father's birthday :D

»
8 days ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

cutest announcement blog ever!

(trust me bro i'm not just talking about the last image)

»
8 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Happy birthday to your daughter. May God bless her with happiness.

»
8 days ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

No way div 4 comeback in big 2026 before GTA 6

»
8 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

The founder himself...

»
8 days ago, hide # |
← Rev. 2  
Vote: I like it +19 Vote: I do not like it

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:)

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Yeppies, hbd tanya !!!

»
8 days ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

As a tester, this is the first round I've ever tested. Also Mike orz!

»
8 days ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

the goat

»
8 days ago, hide # |
 
Vote: I like it +30 Vote: I do not like it

I'm honored to be able test the greatest div. 4 ever made

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Finally mike is coming back

»
8 days ago, hide # |
 
Vote: I like it +26 Vote: I do not like it

As a tester, I'm honored to have been selected by Mike.

  • »
    »
    8 days ago, hide # ^ |
     
    Vote: I like it -9 Vote: I do not like it

    orz

  • »
    »
    7 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    As a tester, I ran out of div2/3/4 contests to test.

  • »
    »
    6 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    btw how did you get selected!

    • »
      »
      »
      6 days ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      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.

      • »
        »
        »
        »
        6 days ago, hide # ^ |
         
        Vote: I like it 0 Vote: I do not like it

        hmmmm interesting

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

MIKE THE GOATT

»
8 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

I'm proud that cf creator is so sigma

Mike orz

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

aahhh... Can't wait to give the contest created by the creator of this creation!!

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

mike's comeback before window 12

»
8 days ago, hide # |
 
Vote: I like it +2 Vote: I do not like it

As a tester, I've had a great time testing the problems, and I hope everyone participating will enjoy them as well <3

»
8 days ago, hide # |
 
Vote: I like it +20 Vote: I do not like it

Yayyy!!! Happy Birthday Tanya!

Mike orz!!

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

7 months without Div. 4 and now we're finally getting one.

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

You are so goated unc!

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I wish everyone to reach the level they want.

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Thanks for having me as a tester

Good luck to everyone participating!

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

wholesome full read!

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

goat

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What is this place? It looks so beautiful

»
8 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

orz

»
8 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Can't wait! This will be my second contest of codeforces, and my first div 4.

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I am not sure that I will hit the exact difficulty expected of modern Div. 4 rounds

I really hope that means that the problems are hard

»
8 days ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

As a tester, good luck and have fun on the problems

»
8 days ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

As a tester

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Such a special day for the GOAT to return, HBD Tanya!

»
8 days ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Ok codex add dark mode

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Fun fact: The bush in the picture is a bramble.

»
8 days ago, hide # |
 
Vote: I like it +7 Vote: I do not like it

Congrats! Maybe... with such impressive AI technologies we can add Zig on codeforces?))))

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

finally a div 4 round

»
8 days ago, hide # |
 
Vote: I like it +17 Vote: I do not like it

I just realized we can not use the "we have .... before CF div4" anymore...

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

$$$\text{Good luck compe}\textbf{Tito}\text{rs !!!}$$$

»
8 days ago, hide # |
 
Vote: I like it +17 Vote: I do not like it

Yeeeees, Div.4

codeforces div4 200x200

»
8 days ago, hide # |
← Rev. 2  
Vote: I like it -9 Vote: I do not like it

You're just cool, Muscle head, but why -1?

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Assalamualaikum Brother

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

bruh

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

As a Temu tester happy birthday to your daughter and the contest was easy guys..trut me

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

As a non-tester, orz mike

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

This tester is writing a comment about praising Mike for the Codeforces platform and wishing everyone good luck on this Div 4.

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope this doesn't affect (or maybe burn) the codeforces' servers.

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

welcome back boss! happy birthday to tanya!

»
8 days ago, hide # |
 
Vote: I like it +6 Vote: I do not like it
.
»
8 days ago, hide # |
← Rev. 3  
Vote: I like it 0 Vote: I do not like it

Have a great life ahead with your daughter. Stay happy

»
8 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

happy birthday to your daughterr mike

»
8 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

orz

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

رعب

»
7 days ago, hide # |
 
Vote: I like it -7 Vote: I do not like it

»
7 days ago, hide # |
 
Vote: I like it +96 Vote: I do not like it

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.

  • »
    »
    7 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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.

    • »
      »
      »
      7 days ago, hide # ^ |
       
      Vote: I like it +11 Vote: I do not like it

      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).

      • »
        »
        »
        »
        7 days ago, hide # ^ |
         
        Vote: I like it 0 Vote: I do not like it

        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.

        • »
          »
          »
          »
          »
          6 days ago, hide # ^ |
           
          Vote: I like it 0 Vote: I do not like it

          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.

          • »
            »
            »
            »
            »
            »
            6 days ago, hide # ^ |
             
            Vote: I like it 0 Vote: I do not like it

            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.

            • »
              »
              »
              »
              »
              »
              »
              6 days ago, hide # ^ |
               
              Vote: I like it 0 Vote: I do not like it

              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.

              • »
                »
                »
                »
                »
                »
                »
                »
                6 days ago, hide # ^ |
                 
                Vote: I like it 0 Vote: I do not like it

                agree

              • »
                »
                »
                »
                »
                »
                »
                »
                6 days ago, hide # ^ |
                 
                Vote: I like it 0 Vote: I do not like it

                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.

  • »
    »
    7 days ago, hide # ^ |
     
    Vote: I like it -19 Vote: I do not like it
  • »
    »
    7 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Agree, without leaking too much about our round, claude almost broke our polygon prep

  • »
    »
    7 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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 :(

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

in a long time, and now is my the first try w div4 :))

»
7 days ago, hide # |
 
Vote: I like it +12 Vote: I do not like it

Happy Birthday Tanya! Uiii

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Felt the aura from 15 divs ago

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Congrats

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Btw Congrats Tanya, and thank you MikeMirzayanov for making div.4! I waited for sooo long!

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

orz orz orz

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Congrats Mike!

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Happy Birthday Tanya

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Happy birthday!

She got a Great father.

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

happy birthday for your daughter , I hope a very good life for her and forever be happy

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

div 4 after so long, orz mike, hbd tanya!!

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Happy birthday tanaya !

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

unc being chad

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

May I ask how to become a tester in Codeforces? I'm a newbie in Codeforces.

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

So sad that I have to miss this round, I think this will be one of the best in a long time

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Why upcoming Div4 contest is showing as unrated allowed for my handle ? My current rating is 1275.

  • »
    »
    6 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Unrated is allowed for all users. Pupils and under can choose to participate rated or unrated, but everything above has to participate unrated

»
6 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Okay so MikeMirzayanov hitting gymmm :)

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

hi, im new to code forces, how can i take part in this upcoming contest ?

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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 :)

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

my first unrated div 4, feels good :)

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

how do i always miss these posts and don't farm contribution for testing. orz Mike :D

»
6 days ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

HPBD Tanya (I'm a bit late but it's fine) Goat Mike orz Looking forward to the contest :P

»
6 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

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..

»
6 days ago, hide # |
 
Vote: I like it +2 Vote: I do not like it

The Goat himself...

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I hope we figure out how people don't cheat and use AI in the contest !!

»
6 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

pls no xor problem

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

excited!

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Mike is so strong now, hard to recognize...

»
5 days ago, hide # |
 
Vote: I like it +14 Vote: I do not like it

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it +1 Vote: I do not like it

    It's my first time competing out of competition as well :)

    Hopefully it goes well (but its not like I can lose any rating ;) )

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Is this San Salvatore mountain?

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

ill let my body become slave of wrusb if i didnt solved B

»
5 days ago, hide # |
← Rev. 2  
Vote: I like it +14 Vote: I do not like it

As a tester, Mike and Tanya orz

»
5 days ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Amazing Round !!!

»
5 days ago, hide # |
 
Vote: I like it +24 Vote: I do not like it
»
5 days ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

How did 4k+ people solve E ? is the skill cap so high now or it's just a skill issue

»
5 days ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Good problems. the author could have a good future in CP if he keeps practicing

»
5 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

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.

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    May I ask you about problem D? Could you tell me about the greedy approach you used for it? :D

    • »
      »
      »
      5 days ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      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.

    • »
      »
      »
      5 days ago, hide # ^ |
       
      Vote: I like it +5 Vote: I do not like it

      For sure! So the problem is actually beautiful. I figured it out on paper, it just made sense.

      Hint 1
      Hint 2
      Hint 3
      Solution

      Hope you understood! :) I'm pretty proud I could figure this out, even though I'm frustrated for being unable to implement E.

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I think the following variant of H would have been much better to set (it's simpler to implement, and more elegant):

Given a tree on $$$n$$$ nodes, add 1 more edge to form a cycle. An adversary removes one edge outside the cycle to create a new component of size $$$x$$$ (which doesn't contain the cycle). The adversary maximises $$$x$$$. What's the minimum $$$x$$$ you can force?

Solution
»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Thanks for the contest, MikeMirzayanov

»
5 days ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

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!

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

is E just guessforces? where does that formula come from

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it +7 Vote: I do not like it

    the order of moves doesn't change the number of moves..

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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.

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

how to solve F

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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.

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

happy birthday to daughter!

»
5 days ago, hide # |
 
Vote: I like it +2 Vote: I do not like it

Very good round, really loved problem F <3

»
5 days ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

old school style contest...very good

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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).

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

mike is the goat. he hasnt forgotten about us after all this time...

»
5 days ago, hide # |
← Rev. 3  
Vote: I like it 0 Vote: I do not like it

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.

»
5 days ago, hide # |
← Rev. 3  
Vote: I like it +14 Vote: I do not like it

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)

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Happy Birthday to Tanya. It was a beautiful round indeed. I enjoyed solving the problems.

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Cool problems (F is my fav)

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

G2 was very hard but contest was good

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

MikeMirzayanov can you please look at the personal message I sent you?

Thanks a lot!!!

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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!

»
5 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

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!).

»
5 days ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

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 :'(

»
5 days ago, hide # |
 
Vote: I like it -8 Vote: I do not like it

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

»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

G_Madhumaruthi from 84 to 251. Guys, you can try to hack top 100 cheaters by this test (roll the seed)

Spoiler
»
5 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Op

»
5 days ago, hide # |
 
Vote: I like it -10 Vote: I do not like it

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

  • »
    »
    5 days ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    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!

»
5 days ago, hide # |
← Rev. 11  
Vote: I like it 0 Vote: I do not like it

Nice contest , I understood Impact of hacking on myself after this one

»
5 days ago, hide # |
 
Vote: I like it +39 Vote: I do not like it

Found the place where this picture was took!

»
4 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

imagine seeing a CF div4 contenst after nearly a year and not being able to participate in it :(

pls put another 1 soon

»
3 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
3 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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!

»
2 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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.