Editorial for TLE '17 Contest 4 P1 - Riding the Curve

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: ZQFMGB12

We can solve the inequality \frac{X+K}{N} \ge 0.595 and take the minimum integer value of X that satisfies the inequality.

Alternatively, we can check every possible value of X from 0 to M and output the first value of X that satisfies the inequality.

In either case, ensure that your value of X is at least 0, and that if X must be greater than M, it is impossible to pass.

Time Complexity: \mathcal{O}(1) or \mathcal{O}(M)


There are no comments at the moment.