| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
upd: has been fixed now
This seems like a problem. On problem A, the statement guarantees $$$2 \leq n \leq 10^{14}$$$, but the validator accepts $$$n = 1$$$, causing an invalid edge case for many solutions.
For example, this hack should not work. The input is just:
1
1
pinging {Supermagzzz, Stepavly, MikeMirzayanov}
It should be fixed, but the round is already unrated so IMO it doesn't affect much.
This doesn't affect the point of this blog, but as a side note, it seems strange that the statement doesn't allow $$$n = 1$$$ in the first place.
It's a big mistake, I'll wix it. Thanks for the issue.