Hello Codeforces Community,
I recently received a notice about the similarity between my submission 298251853 and 298260333 by enze_qwq for 2043B - Digits. I want to clarify that these similarities are purely coincidental and are a natural outcome of the problem’s structure and the large number of participants who solved it.
Why Similar Solutions Are Normal
This problem has over 9,000 accepted solutions, which makes the likelihood of overlapping logic and implementation very high. The task itself is straightforward: determine which odd digits (1, 3, 5, 7, 9) divide a number formed by repeating a single digit d exactly n! times. The following points explain why similar solutions are inevitable:
- Fixed Divisors: The divisors (1, 3, 5, 7, 9) are predefined, and the divisibility rules are simple and well-known.
- Predictable Logic: The problem is highly structured, and the solution steps are nearly identical for anyone solving it correctly.
- Large Number of Participants: With over 9,000 accepted solutions, it is statistically likely that many submissions will look alike, especially for such a straightforward problem.
Frustration with Such Notices
It’s frustrating to receive a notice about coincidental similarities for problems of this nature. For tasks with so many correct solutions and predictable logic, overlapping implementations should be expected rather than treated with suspicion. As someone who values fair competition and works hard on these problems, it’s disheartening to have my integrity questioned over something that’s a natural consequence of the problem design.
Request for Review
I kindly request the Codeforces Team to reconsider this notice, keeping in mind the problem’s deterministic nature and the large number of accepted solutions. I firmly believe this situation is a normal coincidence and not an indication of misconduct.
Thank you for understanding.
Sincerely,
BlackIce666
MikeMirzayanov consider the situation.
reasonable, he solves much more problem than u. If both of u guys cheated, you shouldn't solve so less.
The number of problems solved has nothing to do with this. This is a fairly trivial problem that does not have varying solutions. Such problems will naturally have coinciding submissions.
Plagiarism checks often struggle with short and straightforward logic like this. For problems with fixed steps and predictable solutions, similar implementations are bound to occur.
I hope they will reconsider this notice in light of these factors.
I got too flagged. I didn't use any online compilers, so there are no chance of any leaks and I wrote my code entirely on my own. It's just simple 4 conditional ifs to check divisibility, so ofc multiple people can have almost similar approach. This is completely unfair.
Pls look into it MikeMirzayanov