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 | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
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 |
---|