| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
First thing I really appreciate he(beethoven97) makes the tests stronger and rearrange the standing correctly.
I just wonder how do he do it?
A picture from Educational Codeforces Round 130 (Rated for Div. 2) that showing the number of hacks he made until the time I wrote this blog:
The python3 solutions without fast input were basically ... hacked until they TLE, he ran the same test over and over again on the same solution (since runtime is 1900+ ms and time limit is 2000 ms) it may sometimes randomly TLE
That should explain why so many hacks ?
May be. But how was he hacking codes during all duration?
I think he might have used a script or something to run some generated tests against borderline TL solutions
Yup, I think the same ✓