In the Chef and the Patents problem there is a constraint:
1 ≤ sum of K over all test cases ≤ 107
What does this imply?
Suppose there are T test cases. Let the value of K in ith test case be K[i].
Then, this constraint means that
K[1]+K[2] .... K[T-1] +K[T] <= 10^7
1 Like