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 C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main()
{
	//赤色の箱の中のボールの数
	int R = 0;

	//緑色の箱の中のボールの数
	int G = 0;

	//青色の箱の中のボールの数
	int B = 0;

	//必要なボールの数
	int N = 0;

	int count = 0;

	int answer = 0;

	int i = 0;
	int j = 0;
	int t = 0;

	//各箱のボールの数また必要なボールの数の入力
	scanf("%d %d %d %d",&R,&G,&B,&N);

	for (i = 0; i <= N/R; i++) {
		for (j = 0; j <= N/G; j++) {
			for (t = 0; t <= N/B; t++) {
				answer = R * i + G * j + B * t;
				if (answer == N) {
					count++;
				}
			}
		}
	}

	printf("%d",count);
	return 0;
}