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 Julia (0.5.0) (judge verdict: Time Limit Exceeded)

parseInt(x) = parse(Int, x)
parseArray(x::Array{SubString{String}, 1}) = map(parseInt, x)

function main()
  # R, G, B, N = map(parseInt, split(readline()))
  R, G, B, N = readline() |> split |> parseArray

  # box = sort([R,G,B],rev=true)
  c = 0
  # f(i::Int, j::Int)::Bool = (N-R*i-G*j)%B==0
  f(i::Int, j::Int)::Bool = mod(N-R*i-G*j,B)==0
  # g(i::Int)::Int=div(N-box[1]*i,box[2])
  g(i::Int)::Int=floor(Int, (N-R*i)/G)
  for i=0:div(N,R)
    for j=0:g(i)
      if f(i, j)
        c += 1
      end
    end
  end
  println(c)
end

main()