dush1729's blog

Codeforces Score optimizer
By dush1729, history, 8 years ago, In English

Hi everyone!

I have made a simple program which will give best order of solving problems during codeforces contest according to the user's speed. It will tell you whether it is better to solve problem in order C -> B -> A or B -> A -> C ( with many other permutations ) according to user's speed.

GitHub link

  • Vote: I like it
  • -33
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it +4 Vote: I do not like it

How do you determine speed on a new problem? I may solve div2 "C" level dp maths quickly, but I do get stuck at the easiest geometry questions.

→ Reply
  • »
    »
    8 years ago, # ^ |
      Vote: I like it -11 Vote: I do not like it

    I have made it for usual codeforces round where user knows the time required to solve a problem. It can used to know the order if one knows the time required to solve different problems.

    → Reply
»
8 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

It is well-known that the optimal strategy is a descending order of (max score ÷ required time to solve).

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Sometimes the seemingly "fastest solvable" problems can take hours to get debugged.

→ Reply