It can be inferred that 2089E has a constraint that guarantees the sum of $$$n$$$ does not exceed $$$80$$$.
https://codeforces.me/contest/2089/hacks/1121475
Validator 'vadilator2.exe' returns exit code 3 [FAIL The sum of n exceeds 80. (test case 10)].
But the constraint is missing in the problem statement.
upd:the constraint has been added.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3892 |
| 2 | jiangly | 3797 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3588 |
| 6 | ecnerwala | 3557 |
| 7 | Ormlis | 3532 |
| 8 | Benq | 3468 |
| 9 | Radewoosh | 3463 |
| 10 | Um_nik | 3450 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 165 |
| 2 | Qingyu | 159 |
| 3 | -is-this-fft- | 158 |
| 3 | atcoder_official | 158 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | djm03178 | 151 |
| 8 | luogu_official | 150 |
| 9 | awoo | 148 |
| 10 | maomao90 | 145 |
and nobody noticed? That's bad.
who cares?
Unfortunately, we forgot to specify this constraint in the statmenet. I apologize for this mistake(
This constraint has been added to the task statement.
When will the editorials be released? Also I wanted to add that the problems were good but please make the testers proof read the final problem statements, c had so many issues, b was unclear, a didnt mention if it was a decimal symbol or multiplication symbol. I hope youll fix these issues next time. Also i wanted see proof of correctness of problem D. [I am talking about the Div2]
The authors say that the analysis will be today (but unfortunately, I can't say more precisely)
And proof d2D — https://en.wikipedia.org/wiki/Bertrand%27s_postulate (he says, that you can find prime number in [n / 3, (2n) * 3]
Although the problem statement has been fixed, there is still a typo:
caseseshould becases, and it's more formal to add a period after the sentence.