| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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.
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.
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.
It is well-known that the optimal strategy is a descending order of (max score ÷ required time to solve).
Sometimes the seemingly "fastest solvable" problems can take hours to get debugged.