Editorial for DMPG '19 S1 - Candy Shop Tycoon


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: Kirito

We can generate all possible sums with 3 nested for loops.

Time Complexity: \mathcal O(100^3)


Comments

There are no comments at the moment.