№ | Пользователь | Рейтинг |
---|---|---|
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 | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Название |
---|
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.