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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.Scanner;

public class Main {

    private static final Scanner  SC = new Scanner(System.in);
    private static final int R = SC.nextInt();
    private static final int G = SC.nextInt();
    private static final int B = SC.nextInt();
    private static final int N = SC.nextInt();
    private static final int R_MAX = N/R;


    public static void main(String[] args) {
        int gMax = 0;
        int bMax = 0;
        
        int result = 0;
        for(int r=0;r<=R_MAX; r++){
            gMax = (N-r)/G;
            for(int g=0;g<=gMax; g++){
                bMax = (N-r-g)/B;
                for(int b=0;b<=bMax; b++){
                    if(R*r+G*g+B*b==N) result++;
                }
            }
        }
        System.out.println(result);
    }
}