marvyzy's blog

By marvyzy, history, 6 weeks ago, In English

So, hey Codeforces community, as I found some cheaters in Round 1117, I'm writing this blog to expose them (This blog is not formatted by an AI model)

No 1. Their handle is swayam12, and as you can see, he's a pupil in just 3 rounds,

  1. Educational Codeforces Round 191 (Rated for Div. 2), Rank 5153
  2. Codeforces Round 1109 (Div. 3), Rank 7207
  3. Codeforces Round 1117 (Div. 2), Rank 60!

so, in his first 2 contests, he achieved a decent rank, in thousands, but in his 3rd round, as you can see his submissions:- https://codeforces.me/contest/2257/submission/387410016, https://codeforces.me/contest/2257/submission/387411590, https://codeforces.me/contest/2257/submission/387414976, https://codeforces.me/contest/2257/submission/387434259, https://codeforces.me/contest/2257/submission/387436423 (1 WA), https://codeforces.me/contest/2257/submission/387438401, He achieved a rank of 60, its a top-tier rank! Surpassing many some GMs, CMs, Masters! and most shockingly, in the following 2 submissions:-

https://codeforces.me/contest/2257/submission/387436423 (1 WA), https://codeforces.me/contest/2257/submission/387438401, he just changed his code within 4mins, and came up with a beautiful (though cheated) approach, and wrote a very long code within this short period of time!

2. Their handle is Snehasish123

They did participate in a few rounds before, (the very last round before Round 1117 was a Div 4 round) and here are their submissions of Round 1117:-

https://codeforces.me/contest/2257/submission/387404882, https://codeforces.me/contest/2257/submission/387414548, https://codeforces.me/contest/2257/submission/387419377, https://codeforces.me/contest/2257/submission/387421711, https://codeforces.me/contest/2257/submission/387457660, https://codeforces.me/contest/2257/submission/387461926 (though TLE but still counts as an attempt to cheat!)

In different submissions, they are writing their code with a completely different style and they are literally submitting and getting AC on Problem A -> Problem D under just 2 mins, just with there max solving of just 800 rated problems!

3. Their handle is chinoscode

They participated in both the rounds (Round 1117 and 1118) and here are their submissions for both the past rounds:-

https://codeforces.me/contest/2258/submission/388802177, https://codeforces.me/contest/2258/submission/388812658, https://codeforces.me/contest/2257/submission/387432426, https://codeforces.me/contest/2257/submission/387418987

They cheated so nicely that they renamed all their variable names and thought that we wouldn't know!

4. Their handle is harshwardhan_gh

They participated in Round 1117 and made these submissions:-

https://codeforces.me/contest/2257/submission/387403229, https://codeforces.me/contest/2257/submission/387406987, https://codeforces.me/contest/2257/submission/387411637, https://codeforces.me/contest/2257/submission/387439674, https://codeforces.me/contest/2257/submission/387447339

Normally, they were just solving 2-3 problems in a Div 2 or Div 1 + 2 contest, but suddenly in Round 1117, they jumped to Expert by solving 5 problems! Was the round too easy, or were they cheating? (btw, they just solved problem C of Round 1117 in just 5 mins!)

UPD: Guys, I'm writing a series of blogs for every round onwards Round 1117, so all cheaters, I'm coming for you!

Ok guys, that's it for today, and MikeMirzayanov and KAN, please check on them to prevent cheating in future rounds, and thank you for beautiful platforms like Codeforces and Polygon
May all cheaters don't cheat

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

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

Auto comment: topic has been updated by marvyzy (previous revision, new revision, compare).

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

Auto comment: topic has been updated by marvyzy (previous revision, new revision, compare).

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

MikeMirzayanov and KAN plz ban these ppl.

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

Here's another cheater I found: MinaNiazizadeh

Just look at submission patterns

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

Notice the pattern every guy is Indian. honestly, i’m ashamed.

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

I love how you give us the submissions and explain nothing...

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

I am Harshwardhan, the last handle you tagged.

For context, I spent those months practicing quite a lot on CSES, LeetCode, and topic-specific CF problems. I solved 150+ CSES problems during this period, including DP, Graphs and Trees, alongside 200+ LeetCode problems.

CSES: https://cses.fi/user/415095 LeetCode: https://leetcode.com/u/dinoharsh/

So going from solving 2–3 problems to solving 5 after 2-3 months of focused practice isn't particularly surprising. If there is any concrete evidence of cheating in a specific submission, feel free to point it out.

  • »
    »
    6 weeks ago, hide # ^ |
     
    Vote: I like it -10 Vote: I do not like it

    Although both codes were written by the same person, the second code shows a noticeably different programming template from the first. The first code consistently uses personal macros such as fastio(), #define ll long long, #define endl '\n', and the ONLINE_JUDGE/freopen block, while the second code abandons all of these and instead uses a completely different style such as using ll = long long and direct I/O initialization. Since these are boilerplate habits unrelated to the algorithm itself, such a sudden and comprehensive change in coding style is unusual and raises reasonable suspicion that the second code may have been written or obtained with external assistance. While the template difference alone does not prove cheating, it is meaningful circumstantial evidence that should be considered alongside the programmer's previous submissions and other similarities. [user:marvyzy][user:harshwardhan_gh]

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

    let me make this clear, in Round 1117, you solved C under 5 mins and you just removed your country's name and your college's name, it simply reflects that you are just a coward and a cheater, so stop larping!

    • »
      »
      »
      6 weeks ago, hide # ^ |
      ← Rev. 3  
      Vote: I like it 0 Vote: I do not like it

      Because C is a tree problem and i have completed the whole setion of tree on CSES recently. Secondly, i didn't even put my country name or college name since i have created this account lol, it's crazy that you are so sure i have removed them.

      And in fact, i am a 4th year B.Tech student at IIT kanpur (India's one of the top most engg. institute). Having strong mathematical background and picking up things quickly i can solve problems quickly lol, which is obviously uncommon & shocking for you. Maybe focus more on youself rather than other profiles XD.

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

    this is what AI thinks of you:

    Okay, first of all, I'm not saying that getting rank 97 after a few months of practice is literally impossible. I'm saying that, considering your entire history, the performance raises some serious questions.

    You had only about four months of CSES activity:

    Submission count 154 First submission 2026-03-19 19:27:16 Last submission 2026-07-30 13:11:40

    And apparently, during that period, you went from relatively little competitive-programming experience to solving five problems in a Codeforces contest and finishing rank 97.

    Your CSES count by itself doesn't prove anything either. What matters is which problems you solved. CSES contains a substantial number of beginner and intermediate problems, so “I solved 150+ CSES problems” doesn't automatically establish the level required for a top-100 performance.

    The same applies to LeetCode. Solving 200+ problems sounds impressive, but the number of problems alone doesn't tell us how difficult they were or how much of that experience translates to Codeforces.

    Having a strong mathematical background and studying at IIT Kanpur can obviously help, but those things don't automatically explain a sudden jump to solving A, B, C, D and E, including the harder problems, at the speed you did.

    And the part that makes this particularly suspicious is the performance pattern. You solved:

    A in ~4 minutes B in ~9 minutes C in ~14 minutes D in ~58 minutes E in ~1 hour 15 minutes

    That's an exceptional performance compared with the rest of the contest history you've shown.

    I'm also not convinced by the argument about your code style being “just normal C++.” The formatting alone obviously isn't proof of AI use, but when combined with the sudden performance jump, it contributes to the overall suspicion.

    So no, I'm not claiming that “four months = impossible.” I'm saying that the combination of your limited prior contest history, the sudden rank-97 performance, the solve times, and the complexity of the later problems makes the result worth questioning.

    If you genuinely solved everything yourself, that's fine. But then the reasonable response isn't just “I practiced a lot.” Show why this performance is consistent with your previous level and explain the specific solutions. Otherwise, from the outside, the result looks suspicious.

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

      Thanks for the report!

    • »
      »
      »
      6 weeks ago, hide # ^ |
      ← Rev. 2  
      Vote: I like it +2 Vote: I do not like it

      I wish there was an option to upload images in the comment section. The cses problems i have solved recently are on tree, dp, range queries, graph. If you want i can share you the screenshots on telegram or something. Problem C is using tree and E is using segment tree with monotonic stack and priority queues, even the 'Mountain Range' DP problem on CSES uses very similar approach of using seg. tree + monotonic stack + dp . Maybe i got lucky and the contest problems were in my favor (i mean by the topic i recently practiced) and i was able to solve them. If you see my non-contest submissions below the contest submissions i have submitted segment tree(Sereja & brackets, xenia and bit operations) and tree based problems(Distance in a tree) which tell that i have been practising topics which are common in D/E div2 problems. But simply finding the performance unusual isn't evidence that I cheated.

      • »
        »
        »
        »
        6 weeks ago, hide # ^ |
         
        Vote: I like it +3 Vote: I do not like it

        It's okay bro. If you look at my account, you'll see that I also had some pretty unusual rating jumps. But in my case, that's because I had already studied IOI level material before I started seriously using Codeforces. The thing is, with how common cheating has become these days, it's genuinely hard to trust people based on a single performance. I'm not saying that an unusual rank automatically means someone cheated, but it's definitely going to make people suspicious.

        Also, there actually is a way to upload images in Codeforces comments, You just need to upload the image somewhere else first, like Imgur Then, when you're writing a comment, there's a picture icon at the top where you can insert the image link. You can also just press Ctrl+P and paste the image URL. The image should then appear in the comment as long as the link is valid.

        I hope you continue this energy :D

      • »
        »
        »
        »
        6 weeks ago, hide # ^ |
         
        Vote: I like it +4 Vote: I do not like it

        u can upload images

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

          Yes the bottom one is tree and the top cluster is about dp, graph, range queries. Thankyou for the image. https://cses.fi/paste/494b2cf2639b794e1140e8a/ This is code for 'Mountain Range' dp section problem which uses seg. tree + monotonic stack and the contest E problem uses seg. tree + monotonic stack + prio. queue.

          • »
            »
            »
            »
            »
            »
            6 weeks ago, hide # ^ |
            ← Rev. 5  
            Vote: I like it 0 Vote: I do not like it

            While having a strong track record on CSES is great, it actually contradicts what is happening in this specific submission. Anyone who has solved the CSES tree section knows how foundational parent-child relationships and graph structures are to solving these problems. Yet, in this submission, the code explicitly allocates a par vector, populates it with a loop, and then completely abandons it, absolutely never referencing the tree structure again for the rest of the logic. A human who realizes a tree problem can be bypassed wouldn't manually code a useless tree-input structure during a 5-minute time crunch. Keeping the input logic while completely hallucinating the solution is a classic signature of an LLM trying to satisfy a problem's formatting constraints without understanding the actual math. CSES experience explains speed, but it doesn't explain why an experienced programmer would submit nonsensical, disconnected code that happens to perfectly mimic AI hallucination patterns. This comment is formatted by AI.

            • »
              »
              »
              »
              »
              »
              »
              6 weeks ago, hide # ^ |
              ← Rev. 2  
              Vote: I like it +5 Vote: I do not like it

              I agree that par is unused. I realized that for the construction I was trying, i didn't need to actually traverse the tree, so i just read the parent array and moved on to the dam array.

              I also don't claim that this is the cleanest general solution in fact the fully general solution should determine which dam is shallowest before choosing the m-1 edges. My submission passed because the particular input had a suitable first dam. But calling unused input parsing a “classic signature of an llm hallucinating” is baseless. An unused variable or an unusual implementation can be criticized as bad code, it cannot by itself establish that an llm wrote it. Also, for tree problems the initial thought is often: Ok, this is a tree. i'll read the parents and build the tree/parent representation first, then figure out what I actually need. It's ironic that you're using an AI generated analysis of my code as evidence that i used AI. But an AI saying my code ‘looks like’ llm output isn't evidence that an llm wrote it.

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

Auto comment: topic has been updated by marvyzy (previous revision, new revision, compare).

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

Auto comment: topic has been updated by marvyzy (previous revision, new revision, compare).