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).