This problem is rated 2000, and yet no-one could solve it in official div1 + div2 round, is this a bug or is this task actually not that difficult?
# | User | Rating |
---|---|---|
1 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 164 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 158 |
6 | djm03178 | 154 |
7 | adamant | 153 |
8 | awoo | 148 |
8 | luogu_official | 148 |
10 | TheScrasse | 146 |
Name |
---|
its joke) (or real bug)
also 1909I - Short Permutation Problem, is rated only 1900 despite being really difficult
this is also a similar blog pointing this issue, https://codeforces.me/blog/entry/126799