Weak test case for problem 1771C (Problem no C of last round)

Revision en1, by AshrafSustS19, 2022-12-12 07:10:08

I wasn't happy with the time complexity of my solution. So, I was looking for a solution with improved time complexity. And I found this. This guy solved this problem by only checking the first 200 elements after each index and comparing GCD of each pair . He won with the power of probability!

His submission: 184781213

Test Case

Test Case result should be Yes. His solution prints No

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English AshrafSustS19 2022-12-12 07:10:08 1416 Initial revision (published)