| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
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 ✓