Weak Test Cases in Special Sums INOI Problem

Hello ,

In the Problem Special Sums , the testcases are so weak that

For 90 points , the answer would be for sure some pair i,j where i is smaller than j
And that case ( i > j ) is only given in the first subtask where even brute force would work


Here is my solution which passed : Solution: 42959638 | CodeChef


1 Like