eugenechka.boyko.2_0-0's blog

By eugenechka.boyko.2_0-0, 13 days ago, translation, In English

HHSgddgd, Codeforces!!

I am thrilled to invite you to participate in Codeforces Round 1132 (Div. 2), which will take place on Nov/06/2026 17:35 (Moscow time) and probably won't contain a single $$$\text{XOR}$$$ problem. You will be given 6 problems, two of which will be divided into subtasks, and 2 hours and 15 minutes to solve them.

All problems were authored and prepared by ot_dre, d0esn, amof and me.

ALERT ALERT The round may contain interactive and communication problems. We recommend familiarizing yourself with these formats beforehand.

I would also like to express my heartfelt gratitude to everyone who made this round possible:

The scoring distribution is: $$$(500 + 500) - 1000 - (1000 + 1250) - 2000 - 2500 - 2750$$$.

Congratulations to the winners!!

Div. 1

  1. maspy

  2. k1r1t0

  3. Forested

  4. AmirAli-Asgari

  5. risujiroh

Div. 2

  1. TripToAzerbaijan

  2. AngleHai

  3. _vthong

  4. M1LLI0N_PP

  5. ymh114514

First AC

A1: Timosh: 397583323

A2: sevlll777: 397583860

B: _smart_stupid_: 397587917

C1: JerrySyr: 397588504

C2: satyn: 397592029

D: Saturnalorbit: 397599309

E: Mkswll: 397617904

F: maspy: 397615261

The Editorial is here.

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

First time to see Problem A divided into subtasks:)

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

what is this score dist

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

No xor? :(

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

    He said probably. So maybe he's joking. I need to prepare for my first interactive and communication tasks (which i will never solve cuz of skill issue :skull:)!

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

As a tester, ubfeiaeiuabfeiabfieauifenhliuofajs

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

    As a participant, i think that our dear tester wanted to say, that he forced to test this round, otherwise he will never see pancakes again (:sob:).

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

    maybe this is a secret massage that we need to find out what it is :D

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

As a tester, I lowkey tested two weeks after getting sent the invitation :)

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

i guess we are in NXN(No XOR November) now

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

Interesting scoring distribution:)

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

As a tester, I ❤️ interactive and communication

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

As a

VIP

tester, I'm very important.

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

Sooooo 2 xor problems?

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

This is my first time seeing A1 and A2

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

Imagine A is an interactive problem ::skull

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

As a tester,

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

    a tester is not supposed to spoil anything! Why did u spoil that!

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

    I was expecting a rickroll lol

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

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

    That is not the most spoiled spoiler I have ever seen.

    This is the one
»
12 days ago, hide # |
 
Vote: I like it -8 Vote: I do not like it

Whats an communication problem ?

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

Bro made up some friends just to set up a cf round

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

Why does clicking on problem authors' profiles in this post lead to an anime video.Or is it just me?

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

NO XOR PROBLEMS YAYYYYYYYYYYYY!

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

Hope to escape 1000 rating trap.

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

good luck to everyone :) thanks to the authors for preparing this round :D

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

What's the GIF blud :sob:

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

A1: n<= 5 A2: n<= 50

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

As a Temu tester I'm sure that I'll get my rating to 0 now(yesterday I got -76).

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

wth is A subtask bro T_T

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

how can you POSSIBLY split div2 A into subtasks?!?

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

if i didnt solved till problem C then im gay, if i didnt solved till D then im lesbian

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

Will I be surrounded by interactive problems, communication problems and XOR problems

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

As an author, why am I not on the writer list in the contests tab :(

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

Contest without XOR problem is the GOAT contest.

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

Time Changed of this Contest?? It is showing it delayed to 15Min

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

great contest! eugenechka.boyko.2_0-0 orz, but :sob could only solve A1, but appreciate the problems!

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

WHY NO XOR PROBLEMS Still contest with communication and interactive is awesome btw

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

$$$B$$$ is stupid

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

    How does it work?

    I mean, how to handle numbers that occur multiple times?

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

      I noticed one thing, when the array is sorted, all elements will be >= their previous average. When the array is reverse sorted, none of them will be good.

      So then like, choose the $$$k$$$ last of them in a sorted array to be the good ones, and put the first $$$n - k$$$ of them at the back.

      But this WA'd, so I reversed the first $$$n - k$$$ of them and then put them at the back and it passed.

      But after doing this you still have to iterate and check if theres exactly $$$k$$$ good ones.

      It took me too long to get this + no idea about the proof, hence I really didn't like this problem.

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

        Ah, ok.

        So, if same values are there multiple times, they make a certain number of k-values impossible. :/

        Anybody explain why is that?

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

          if value repeats multiple times repats k time and if k == n then there would be answer otherwise not .

          like basically if pick value one since all value are same the nect number we pick would be same as one we average sum right , so is values repats n times then it make sense to use them

          is what i thought.

          don't know how would it work when there is mix of multiple same values and not same values

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

          Like I think this can be a proof

          The largest k numbers shall always be greater than or equal to the average when they are being considered, no matter what. So if the (k+1)th largest value is equal to the maximum value, then there are atleast k+1 values which will be greater than average, so this is the NO case. Just checking with maximum value is enough for this because, we need atleast two distinct values in the first (k+1) largest values.

          For every other arrangement, we can consider the first k largest values in increasing order, then consider the rest of the values in decreasing order (why? because if we take the increasing order for the rest of the elements, a smaller number goes in before a larger number, creating a possibility that the average will be equal to the larger number in the future).

          This construction guarantees the k largest values are all greater than equal to average, and the rest are lesser.

          I think this code will make it clearer: 397601716

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

        Same.. it just passed.. I observed the pattern but could not proof it for a larger cohort

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

    no lol

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

NOOOOOOOOO I didnt have time to submit D ahhhhhhhhhhhhhhhhhhhhhh

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

In D; graph can be completely different from the start. how can we really put any data in it?

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

    Yeah it is really hard to find an invariant in that one

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

    I Was thinking if we can limit the operations which can be done, because k>=2 so we can not touch paths of length 3 or less... but I couldn't solve it.

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

    invariant: 2 color the nodes, 2 coloring never changes over operations. for node u>=2 if u has same color as node 1 determines u'th char in s

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

      woww, that's clever! thank you

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

      but in case of a star, we cannot determine if the string is 11...1 or 00...0.

      I hope you to help me.

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

        as far as i understand its 000...0 because nodes has different color from 1. we set node 1 as a reference in the solution cuz string is n-1 length

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

          I've just solved this tricky D. absolutely tricky problem ever.

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

        I treated 11...1 as a special case, and gave a graph containing a triangle (a cycle of length 3) for that case. This works because a cycle of odd length will persist after the operations (the length of the cycle may change, but there'll always be an odd-length cycle).

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

Nice problemset

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

D is so peak

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

Almost solved D but was 5 minutes too slow:(

Great problems!

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

Best D div 2 and best 2-steps problem ever seen. F was so good too but I spend too much time on C so that couldn't solve F in time -_-

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

wonderful contest

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

In C1, do the n + 10 operations really check? I didn't even care about it

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

solved till C2 but I was only sure for C1 that my solution is correct, others were like based on feeling that I am correct.

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

    I was sure that ans <= 3 for diff < 25 but was brute forcing for only primes in the range [1, 30] which I only realised after the contest |-|

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

      whoa.. don't tell me it has something to do with goldbach conjecture that every even number can be written as sum of two primes

      although I did something like dp for smaller gaps, for larger gaps there should be a prime in between where we can jump

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

        I dunno about the conjecture or whatever, but just the fact that even if n grows to 1e9, the proximity of consecutive primes is ln(n) which comes out to around ~ 23, so if the diff >= 25, you can easily make a jump to the largest prime <= b, I just brute forced that the gcd of any number x and the difference between any prime number greater than x and x is = 1, so just jump to that largest prime <= b, and then the diff becomes < a, and since a is a prime, the gcd of the diff and a = 1. For diff < 25, I kinda half guessed that it's always possible in 3 moves, and brute forcing only takes 25^3, which when multiplied with the number of test cases, should be well under the TL.

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

    Same look at mine, I have no idea why it works :397655764

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

      ok, that means it is always possible to do it in 3 moves

      can you please tell me, why you used the number 100 and not some other number ?

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

        Not sure why it works, but my thinking was that there are at list 25 primes (1 to 100), and multiplying all of them would exceed 1e9, so there should be 2 or 3 prime jump (+x) I can use without any problem.

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

        I just tried it by taking only two extra primes: 397658647

        Or C2 might also have poor test cases like C1.

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

In C1, why finding the nearest prime for each number does not work ?

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

How does A2 work?

for a1 i applied n*n/4 formula making sure to make right angle

for a2 i considered n as sum of power of 2^(ai) and applying same formula but didnt work?

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

    i did the same thing for A2, but it didn't work, for A1 this was my code:

    #include <bits/stdc++.h>
    using namespace std;
    
    #define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    #define ll long long
    #define pb push_back
    #define vi vector<int>
    #define endl '\n'
    
    int main() {
        fast_io;
        int t; cin >> t; 
        while(t--){
            int n; cin >> n;
            if(n % 2 == 0) cout << (n/2)*(n/2) << endl;
            else{
                int x = ((n/2) - 1);
                cout << x * (n - x) + 2 << endl;
            }
        }
    }
    

    Can anyone share code for A2?

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

    because you should apply each operation to exactly one point. for example; in "1, 2" (so "2, 4"), you say that making 3*3 is optimal. But you can't divide 4 to 1+3 or etc.

    But the logic is similar to A1, you should make the points as nearest as possible. So you can divide array to 2 subsets with greedy.

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

    You can't split a single move into two moves.

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

Bertrand's postulate ftw

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

hi,can someone explain why this solution doesn't work 397603019

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

nice contests thx :)

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

that was my bad contest

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

Commenting after a long time. Hope to do better next time. :)

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

For C2, I know if A and B are far enough apart, you can either jump directly from A -> B or jump to A -> (largest prime < B) -> B.

But how do we know that for the case where A and B are close, you can always do it in <= 3 moves.

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

    I did DP for smaller gaps, but didn't prove that it has to be 3 steps.

    but later ( after contest ) one idea came to me.... that if gap is even it can be written as sum of two primes ( goldbach's conjecture is true for all numbers below 1e9 ) and if it is odd we can add 1 and then gap become even.. so max 3 moves.

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

      Good point, but it's not a complete proof because even if $$$b - a = p_1 + p_2$$$ that doesn't guarantee $$$gcd(a, p_1) = 1$$$ and $$$gcd(a + p_1, p_2) = 1$$$; it's possible that $$$a = p_1 × p_2$$$ for example, or that $$$a + p_1$$$ is a multiple of $$$p_2$$$.

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

        Yea I'm interested to see the actual proof for this. I didn't get it in contest, but I just guessed that you probably don't need that many.

        Also, it's kinda dumb but I didn't think finding the greatest prime <= B would work since there's like (1e4 cases) * (~100 numbers you have to check) * (sqrt(n) = ~1e4) to see if something's prime. I didn't think that would've passed but it did comfortably.

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

          there is a better check and bound

          better check

          it works in <= (t = 1e4) * (lpg — 1 = 281) * (log (A = 1e9) = 30) * 2 = 1.686e8, which is better (and works in c++) than your 1e10 bound, where lpg is largest prime gap

          lpg finder code

          397676508

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

        oh wow !!.. thanks for mentioning it .. now I am glad I did DP

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

    You can also jump A -> smallest prime that doesnt divide B -> B, and you dont need that observation for <=3 moves you can just bruteforce because they are pretty close to each other when there is no prime like that between them

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

      How do you brute force it? It looks like it can be around a 100 difference, so unless you know that the number of moves needed is <= 3, you can't just try all combinations.

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

        i tried for <=15 because it says so in task, you can just track all number from a to b and then have 2D dp dp[i][number of moves], and then one loop goes theough number of moves and then you go through all the numbers between a and b and then try to go from every less number(you check if you can get to that number in one less move becuse dp already covered that and then if you can then check if you can go to i and update dp, check my submission it will be easier to understand.

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

        You can do BFS

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

More guesswork than patrick jane

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

c2 is absolute goysloppery wtf

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

d was so cool but i have skill issue so no solve

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

I think C1 is not a good problem because it relies on the conclusion that there's a prime between [x,2x], but it is really hard to prove rigorously. It punishes people who try to work out the problem step by step and rewards people who like guessing.

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

    agreed

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

    Felt the same while solving it

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

    same 2 u,I think C1 & C2 actually test whether contestants have the guts to just go for it,not their ability to solve the problems independently.

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

    After all , as a contestant not a mathematician , if you don't know Bertrand-Chebyshev Theorem and Jacobsthal's Function , it's hard to justify your code even if it's correct .

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

    facts dude

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

    I mean it's kind of trivial to write another program to prove it for the constraints. Problems that remind us we have a brute force proof checker right in front of us are good sometimes.

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

      Yeah, it's a valid contest strategy. I also used brute force to inspire me in that contest, so I was able to solve C1 at the very end of the contest.

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

      However, it's still not a good problem because we often want an algorithm with step-by-step analysis. By using brute force, you can prove that it works for n<=2e5(or some larger range if u make your brute force run further), but u can't prove the algorithm is O(n) for any integer n

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

for problem C2, let vector a = {i such that gcd(i,a)=1 and a <= i <= 2a} vector b = {i such that gcd(i,b)=1 and b-a <= i <= a}

should size(a X b) < 10^8?

my solution's time complexity is O(a X b) and it passed

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

I was seconds away from having the first solve on A2, would've been cool

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

I wanna discuss how to solve E with someone.

I had divided the given graph into connected components. Then, I found that we can shrink the searching area into 2 or 1 components within 2*ceil(log_2(k)) queries. So, the remaining is how to find exact edge among 1- or 2-component bipartite graph using at most 33 — 2 * ceil(log_2(k)) queries. where, 33 — 2 * ceil(log_2(k)) >= 11.

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

please publish editorial before next round starts.

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

Can you publish editorial? I need to know how to solve C2 and D

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

Editorial?

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

I can't wait for the editorial, any longer. what do they do, now? I wish someone to show me intuitive solutions or hints for E,F.

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

Can someone explain C2 pls?

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

this bro

codeforces 200x200

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

Dear Codeforces Administrators,

I would like to respectfully request a manual review of the plagiarism warning regarding my submission to Problem 2284D in Codeforces Round 1132 (Div. 2).

My submission: https://codeforces.me/contest/2284/submission/397638716

Flagged submissions: - https://codeforces.me/contest/2284/submission/397623467 - https://codeforces.me/contest/2284/submission/397628518

After receiving the warnings, I noticed that all my submissions from this round had been marked as "Skipped".

I developed my solution independently during the contest and did not exchange code or solutions with other participants.

The algorithm uses a tree construction to encode binary information, handles the exceptional case using a non-bipartite graph, and uses BFS bipartite coloring to recover the information.or use shortest way form 1 to other point is odd or even to decode information , and I just use it to code and for quick code i use bfs color to decode even or odd

These are also the core ideas described in the official editorial. I believe independent implementations of this approach can naturally have substantial structural similarities.

I understand that some implementation details are also similar, and I would appreciate a manual review of these similarities.

I am willing to provide previous submissions demonstrating my coding style, available development records, and a detailed explanation of my solution.

Could you please reconsider the plagiarism decision and the resulting disqualification from the round?

Thank you very much for your time and consideration.

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

I received a notification that my submission for problem 2284C1 (397614752) significantly coincides with another participant's submission (397613862).

The matching code comes from a publicly available template, included in YouKn0wWho's Ultimate Topic List, published around 5 years ago:

Sieve up to 1e9 by min_25: https://github.com/ShahjalalShohag/code-library/blob/main/Number%20Theory/Sieve%20upto%201e9.cpp

Although the round was unrated for me, it was rated for the other participant, and I certainly wouldn't want this to result in any cheating strikes on my account.

Thank you for your consideration.

I used this template because I misread the problem's bounds, so I was quite surprised to see the same implementation in another submission.

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

    Yes wisdom is very good people i dont think he cheater dont ban him plz thx

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

    It's a bit surprising to me to see someone get false-flagged over a template I believed to be well-known. Even if you don't recognize the template, a simple search on grep reveals the source of the snippet with little to no effort.

    I don't want to sound like I am underestimating the effort Codeforces is putting into cheating detection, as it is not to be underestimated, but I feel like the distinction between publicly available templates vs. straight-up solution leakage is an issue worth investigating to avoid false accusations, which may potentially affect the reputation of affected individuals.

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

      Definitely agree. Similarity checks should account for publicly available templates. I also think there should be a simpler appeal process for skipped submissions, perhaps a dedicated option to report a false match and provide supporting evidence, rather than having to post a comment for each case.

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

    I think Wisdom has enough wisdom not to violate rules on Codeforces. It’s indeed a very popular template, and aside from the computation of Sieve there is a clear difference in your code and the other participant’s.

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

    wisdom no cheat trust he just casually good like that fr fr

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

hello, so I got a false — positive plagiarism check on my submissions with WisdomCasual because we have used the same well known template for sieve up to 1e9

you can clearly see this in my submission https://codeforces.me/contest/2284/submission/397613862 and his https://codeforces.me/contest/2284/submission/397614752

we both copied it from Shahjalal Shohag's public library which was written before the contest and is publicly available to anyone right here: https://github.com/ShahjalalShohag/code-library/blob/main/Number%20Theory/Sieve%20upto%201e9.cpp

Even the way we solve it after sieve is different, so our submissions were skipped purely because of this. I hope you can check it and lift the skip for me and WisdomCasual and thanks in advance

MikeMirzayanov eugenechka.boyko.2_0-0 KAN

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

Hello,

My handle is Saddz. I received a message that my solution 397626512 for problem 2284C1 (Codeforces Round 1132 (Div. 2)) coincides with solution 397631003 by conqueror_of_jamikdev. I want to explain what happened honestly.

conqueror_of_jamikdev is the account of my friend. During the contest, both of us solved the problems up to C1 and could not solve further, so we discussed them together. My friend solved C1 from his main account with his own, more complex algorithm. I had written a simple brute-force solution for C1 myself, and I sent my code to him. He then submitted it from his second account, with the same template and comments. As a result, all my submissions in this contest were skipped.

I am new to competitive programming and to Codeforces, and I did not fully understand the rules about sharing code during contests. I understand now that sending my code to another participant is a rules violation, even though we were only discussing the problems. I did not publish the code anywhere publicly. I regret this mistake, and it will not happen again. From now on I will not share code or solutions with anyone during contests.

All my other solutions in this round were written by me alone, and my friend's C1 solution from his main account was independent of mine. If it is possible, I kindly ask you to reconsider skipping my other submissions and to apply the penalty only to the C1 solution. I understand if this is not possible, and I will respect your decision.

Thank you for your time.

Best regards, Saddz

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

    The conqueror of something is doesn't mean it is his second account, bruh watch your tones, if you have no proofs and just don't mention + read this blog carefully there is no sense to ask help me im skipped from cf admins

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

Hello Codeforces team,

I received a plagiarism warning regarding my submission 397755943 for problem 2280B.

I would like to clarify that I independently developed the solution and wrote the code myself. I did not copy or share code with any of the users listed in the warning, nor did I intentionally access anyone else's solution during the contest.

I was surprised to receive this warning, as I solved the problem independently.

I kindly request that the matched submissions be reviewed again. I am willing to provide my source files, development history, and any additional explanation of my approach if necessary.

I take the contest rules seriously and would appreciate a fair review of this situation.

Thank you for your time and consideration.

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

hii

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

[contest:https://codeforces.me/contest/2284]

Dear Codeforces Team,

I recently received a system notification regarding my submission 397625956 for problem 2284B (Introduction to the Niche Internet), stating that it significantly coincides with submission 397628787 by another participant, sachin_gupta09.

I would like to bring an important detail to your attention and request a review of this case.

After investigating the submission histories, I found the following:

  • My submission (397625956) was submitted on November 6, 2026, at 21:28 (UTC+5.5).
  • The submission by sachin_gupta09 (397626878) was submitted at 21:31.
  • Another submission by the same participant (397628787), mentioned in your notification, was submitted at 21:36.

Therefore, my submission predates both of the other participant's submissions.

I also compared both source codes and found that they are almost identical, including variable names, implementation structure, conditions, loops, and output logic. The differences are limited mainly to formatting, blank lines, and minor newline notation.

I do not know this participant and have no association or communication with them. Considering that my submission was made earlier, I am concerned that my implementation may have been copied by the other participant rather than the other way around.

I kindly request that the team review the submission timestamps and source-code similarities before making a decision regarding my account.

Thank you for your time and consideration.

Regards, Hemang Jain Codeforces Handle: _hemang29