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:

x, y, z = map(int, input().split())
C = int(input())
ok = 0
for i in range(101):
    for j in range(101):
        for k in range(101):
            if x*i + y*j + z*k == C:
                ok = 1
if ok:
    print('QUEST CLEARED')
    print('TRY AGAIN')

Time Complexity: \mathcal O(100^3)


There are no comments at the moment.