| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Didn't anyone else feel weak test case in "Make GCD" problem in the Asia-West Finals ICPC 2019?
After the contest, I realized my solution (that got my team AC in contest) will fail for some test cases.
The problem was -
"Create an array of <= 10^5 size with elements <=10^5, that has sum of GCD of all subarrays equal to X (1<=X<=10^13)".
Auto comment: topic has been updated by firstone1 (previous revision, new revision, compare).
Also, the constraints on X were (1 <= X <= 1e13). I'm not aware of weak testcases BTW, and there is no way to know anymore IMO (no mirror/editorial of the contest anywhere).
Actually, mirror
I am unable to find statements nor place to submit my solutions. How is this a mirror?
Actually this mirror only showed test cases, standings and list of submissions.
updated.
Auto comment: topic has been updated by firstone1 (previous revision, new revision, compare).