| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
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).