codeforces189A.py

# not yet solved
# a test case: 15 5 2 3

n, a, b, c = map(int, input().split())
a, b, c = sorted([a,b,c])
p, q, r = (n//a)+1, (n//b)+1, (n//c)+1


maximum = -1
for i in range(r):
    for j in range(q):
        for k in range(p):
            total = (i*c) + (j*b) + (k*a)
            if (total==n):
                print(i, c, j,b,k,a)                
            if total == n and (i+j+k) > maximum:
                maximum = i+j+k

print(maximum)

TLE with the test case below. and it's natural
4000 1 2 3

That means the fuc*ing approach should be changed.... 🔢