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 Ruby (2.7.1) (judge verdict: Accepted)

r,g,b,n = gets.split.map(&:to_i)
ans=0
x=(n/r.to_f).ceil
for i in 0..x
    y=n-i*r
    if y==0
        ans+=1
        next
    elsif y<0
        next
    end
    y=(y/g.to_f).ceil
    for j in 0..y
        z=n-i*r-j*g
        if z==0
            ans+=1
            next
        elsif z<0
            next
        end
        if (z%b).zero?
            ans+=1
        end
    end
end
puts ans