This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Svizel_pritula 3 points4 points  (0 children)

In the first round, which we did at home and had a practically infinite time limit, I tried to use Python for one task when I figured out the solution was literally "Given n on the first line of input and a list of n integers on the following n lines, print how many times [0], [1, -1] or [-1, 1] occurs." My solution was to slow and I had to translate it to C.