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 JavaScript (node.js v5.12) (judge verdict: Time Limit Exceeded)

// inputに入力データ全体が入る
function Main(input) {
    input = input.trim();
    input = input.split(" ");
    var R = input[0];
    var G = input[1];
    var B = input[2];
    var N = input[3];
    var tmpR;
    var tmpG;
    var tmpB;
    var count = 0;

    for(var i = 0; i < N/R+1; i++){
        tmpR = N - R*i;
        for(var j = 0; j < tmpR/G+1; j++){
            tmpG = tmpR - G*j;
            for(var k = 0; k < tmpG/B+1; k++){
                tmpB = tmpG - B*k;
                if(tmpB == 0){
                    count++;
                }
            }
        }
    }

    console.log(count);
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));