Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

firstone1's blog

By firstone1, history, 4 weeks ago, In English,

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

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by firstone1 (previous revision, new revision, compare).

»
4 weeks ago, # |
  Vote: I like it +15 Vote: I do not like it

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

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by firstone1 (previous revision, new revision, compare).