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 argc, const char * argv[]) {
    
    int R = 0;
    int G = 0;
    int B = 0;
    int N = 0;

    scanf("%d",&R);
    scanf("%d",&G);
    scanf("%d",&B);
    scanf("%d",&N);
    
    int count=0;
    int r=0;
    int g=0;
    int b=0;
    
    for (int i=1; i<=3001; i++) {
        if (i*R > N) {
            r=i-1;
            break;
        }
    }
    for (int i=1; i<=3001; i++) {
        if (i*G > N) {
            g=i-1;
            break;
        }
    }
    for (int i=1; i<=3001; i++) {
        if (i*B > N) {
            b=i-1;
            break;
        }
    }

    
    
    
    for (int i = r; i>=0; i--) {
        if (N == i*R) {
            count++;
            continue;
        }
        for (int j = g; j>=0; j--) {
            if (N == (i*R + j*G)) {
                count++;
                continue;
            }
            for (int k = b; k>=0; k--) {
                if (N == (i*R + j*G + k*B)) {
                    count++;
                    break;
                }
            }
        }
    }
    printf("%d",count);
}