Yesterday, when I was writing virtual contest in GYM, I found some interesting feature. From status I could find number of tests for any problem. However, I have not cheked it for official round, at all it's worth for new blog.
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
Best use of binary search
Yesterday, when I was writing virtual contest in GYM, I found some interesting feature. From status I could find number of tests for any problem. However, I have not cheked it for official round, at all it's worth for new blog.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 | nkamzabek | 2019-10-26 16:30:48 | 42 | Tiny change: ' English ' -> ' English \n\n**UPD:** It works in Official Rounds. ' | ||
en4 | nkamzabek | 2019-10-26 13:14:33 | 18 | Tiny change: 'r of tests for any ' -> 'r of tests, I guess it works for any ' | ||
en3 | nkamzabek | 2019-10-26 13:02:08 | 34 | Tiny change: ' 10 steps) ' -> ' 10 steps)\n\nP.S. Sorry for my poor English ' | ||
en2 | nkamzabek | 2019-10-26 12:59:42 | 620 | Tiny change: 'sign to $\me$(more or ' -> 'sign to $\geq$(more or ' (published) | ||
en1 | nkamzabek | 2019-10-26 07:27:31 | 254 | Initial revision (saved to drafts) |
Name |
---|