The problem with "one line solve" problems

Revision en5, by cos-tel-bi-ju, 2025-01-12 17:07:37

Recently, I participated in Educational Codeforces Round 173 (Rated for Div. 2), and I received a system message reporting that my submission 298211934 for the problem 2043B - Digits significantly coincides with Alexandr_White. As a result, all other submissions from that contest were skipped, I was disqualified, and my rating was rolled back.

After reviewing both submissions, I noticed that they are indeed almost identical. I believe this issue arises because the problem has only one straightforward solution, which doesn’t offer much room for variation in implementations.

For example, consider the following problems:

2057A - MEX Table — just print max(n, m) + 1

2044A - Easy Problem — just print n - 1

2009A - Minimize! — just print b - a

1445C - Division — just print x - 1 and y

While these problems are enjoyable to solve and sometimes tricky, being disqualified because your code coincidentally matches another contestant’s solution is quite frustrating. I think the plagiarism detector should be less strict for simpler problems where the solutions are limited in diversity.

If you have any suggestions to address this issue, feel free to share them in the comments.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English cos-tel-bi-ju 2025-01-12 17:07:37 0 (published)
en4 English cos-tel-bi-ju 2025-01-12 17:04:25 570 Tiny change: 'tions are naturally limited i' -> 'tions are limited i'
en3 English cos-tel-bi-ju 2025-01-12 16:58:55 529
en2 English cos-tel-bi-ju 2025-01-12 16:22:33 532
en1 English cos-tel-bi-ju 2025-01-12 15:53:15 136 Initial revision (saved to drafts)