# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 148 |
10 | TheScrasse | 146 |
Name |
---|
Some lingustic analysis of Petr's blog can give us adequate rating of CF contests.
When I read the title I was afraid that those "tedious" problems refer to Marathon24, but fortunately it doesn't :). And results are still frozen.
"n extremely tedious O(nlogn) data structure problem E that did not require anything more complicated than a stack and binary search, but needed more than an hour to implement and had a lot of possible plus/minus one errors to make." — I can't agree more :p. Though this problem had this nice feature that it was taken from "real life". I'm sure that almost all of us faced that problem during our lifes :D.
What's the reason behind hiding results of Marathon24 for so long when there's a lot of people who are eagering to know whether they advanced or not?
I don't know, I haven't got any influence on that :P.