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, G, B, N, r = 0, g = 0, b = 0, ans = 0,temp;
	scanf("%d %d %d %d", &R, &G, &B, &N);
	//一番大きなものをBとする (TLE回避)
	if (R >= G && R >= B) {
		temp = B;
		B = R;
		R = temp;
	}
	if (G >= R && G > B ) {
		temp = B;
		B = G;
		G = temp;
	}

	//パターン探索
	while (R*r+G*g+b*B <= N) {
		while (R*r + G * g + b * B <= N) {
			while (R*r + G * g + b * B <= N) {
				if (R * r + G * g + B * b == N) {
					ans++;
				}
				r++;
			}
			g++;
			r = 0;
		}
		b++;
		g = 0;
	}
	printf("%d", ans);
	return 0;
}