The problem with "one line solve" problems

Revision en3, by cos-tel-bi-ju, 2025-01-12 16:58:55

Recently, I've participated in Educational Codeforces Round 173 (Rated for Div. 2) and I've got a system message reporting that my submission 298211934 for the problem 2043B - Digits significantly coincides with Alexandr_White's submission 298213898. All other submissions from that contest got skipped, thus I got disqualified and my rating got rolled back. I checked both submissions and indeed are almost identical! Now I think this problem was caused by the fact that there aren't other solutions to solve the problem and the only solution isn't so complex to generate many differences in other implementations.

For example take a look at 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

Although these problems are fun to solve and sometimes tricky, being disqualified because you accidentally write the same code with other unlucky contestant it's pretty annoying. I think the plagiarism detector should be less strict for the simple enough problems.

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)