Editorial for Mock CCC '19 Contest 2 J3 - Tudor Buys Some Tea

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.

To solve the subtask, note that Tudor will not be able to get any free tea. Therefore, the answer is N.

To solve the problem, we need to compute the maximum number of free cups of tea that Tudor can obtain. If we think about "bundles" of K+1 cups of tea, where Tudor buys K cups of tea and gets one cup of free tea, we note that Tudor can get exactly \left\lfloor \dfrac{N}{K+1} \right\rfloor bundles, which is exactly how many cups of free tea he can get. Therefore, the answer is N - \left\lfloor \dfrac{N}{K+1} \right\rfloor.


There are no comments at the moment.