Problem:
Score : 200 points

Problem Statement

Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:

Red boxes, each containing R red balls

Green boxes, each containing G green balls

Blue boxes, each containing B blue balls

Snuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.
How many triples of non-negative integers (r,g,b) achieve this?

Constraints

All values in input are integers.

1 \leq R,G,B,N \leq 3000

Input

Input is given from Standard Input in the following format:

R G B N

Output

Print the answer.

Sample Input 1

1 2 3 4

Sample Output 1

4

Four triples achieve the objective, as follows:

(4,0,0)

(2,1,0)

(1,0,1)

(0,2,0)

Sample Input 2

13 1 4 3000

Sample Output 2

87058

Solution in PyPy3 (2.4.0) (judge verdict: Accepted)

import math
r, b, g, n = map(int, input().split(' '))
ans = 0
# only r
r1 = int(math.ceil(n/r))
b1 = int(math.ceil(n/b))
g1 = int(math.ceil(n/g))

# print(r1, b1, g1)


for x in range(r1 + 1):
    for y in range(b1 + 1):
        tmp = n
        tmp -= x * r
        tmp -= y * b

        

        if tmp >= 0 and tmp % g == 0:
            ans += 1

        # print(x, y, tmp/g)

print(ans)