Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Unhackable List

Revision en10, by eidan, 2021-01-27 23:44:08

Last round involved a randomized solution for problem E, and some pretests were aimed against std's rand() function. This caused a big dispute among contestants. It was questioned whether doing this type of tests was fair or necessary, since passing them depended merely on specific language knowledge, not actual problem-solving skills. Contest coordinators counter-argued that participants would've gotten hacked if it hadn't been for these pretests. They also stated that it's one's responsibility to know their favorite language when using it on a round.

The fact is, this controversy was really caused by a technical property within C++ (and codeforces, partly), which many people had no clue existed. This is just an example of the fact that languages and their functioning in CF will sometimes have non-intuitive and unexpected properties, which may screw our performance in a contest. In other words, we are constantly exposed to bumping into another of these hidden behaviors, making the mentioned round hardly the last time something like this can happen.

That's why I thought: We should have a list of the main language-specific issues that could annoy us during contests. Just a brief enumeration of not-so-fun facts about languages, such that, if not known, could break our solutions or get us hacked. Making a brief list available for the community, and exposing it to participants before a round could prevent a lot of trouble. If a problem could make you bump into one of these weird language issues, contest coordinators could safely assume we know about them and not get into a moral debate whether it's fair to include tests against it. Also, contestants would be safe from losing rating to specific language knowledge. In other words, we could prevent issues like the last round's with the least amount of effort.

This blog is an attempt to build up this list once and for all! It should include as much facts as possible, so I'm calling out for your help. If you've had trouble on a problem because of issues in the language, I invite you to help out contributing and write it as a comment. I'll update it in the list as soon as possible. You'd be helping out and preventing other people from going through the same annoying experience! I've included the very few facts I know about for now. It's not much, which is why anything you can share is useful!

Unhackable List

C++

Don't use rand()
unordered_map can cause TLE
std::random_device is unsafe in MinGW w64
multiset::erase is unusual
std::pow disregards precision
size() in data structures is unsigned
cin/scanf slow when reading doubles

Java

Arrays.sort() may cause TLE

Python

Python recursion has low limit

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en10 English eidan 2021-01-27 23:44:08 702
en9 English eidan 2019-02-16 20:32:20 8
en8 English eidan 2019-02-16 06:13:32 581 Tiny change: 'n instead.[More info' -> 'n instead. [More info'
en7 English eidan 2019-02-15 10:36:54 298
en6 English eidan 2019-02-15 10:20:34 176 Tiny change: 'n has low recursion limit">\n' -> 'n has low limit">\n'
en5 English eidan 2019-02-15 06:30:43 228
en4 English eidan 2019-02-15 00:22:49 878 Tiny change: ' a round. Since both side' -> ' a round. I think both side' (published)
en3 English eidan 2019-02-14 23:10:00 2284 Tiny change: 'se <math>O<sup>2</sup></math>. [' -> 'se <math>O(n<sup>2</sup>)</math>. ['
en2 English eidan 2019-02-14 20:28:05 1251
en1 English eidan 2019-02-14 19:28:54 971 Initial revision (saved to drafts)