| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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)".
I could not find anywhere the list of teams going to ACM ICPC World Finals 2020 from India.
Can somebody help me with the link?
Update: 28 Jan 2020 : Some teams have been sent invitations to ICPC world finals from india. Update: 12 Feb 2020 : List published https://codeforces.me/blog/entry/73791
