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: Accepted)

#include <stdio.h>

int main()
{
    int R,G,B,N,i,j,k,m1,m2,m3,n2,n3,time=0;
    scanf("%d",&R);
    scanf("%d",&G);
    scanf("%d",&B);
    scanf("%d",&N);

    if (R<=G && G<=B) {
        m1 = R;
        m2 = G;
        m3 = B;
    }
    if (R<=B && B<=G) {
        m1 = R;
        m2 = B;
        m3 = G;
    }
    if (G<=R && R<=B) {
        m1 = G;
        m2 = R;
        m3 = B;
    }
    if (G<=B && B<=R) {
        m1 = G;
        m2 = B;
        m3 = R;
    }
    if (B<=R && R<=G) {
        m1 = B;
        m2 = R;
        m3 = G;
    }
    if (B<=G && G<=R) {
        m1 = B;
        m2 = G;
        m3 = R;
    }

    n3 = N/m3;
    
    for(i=0;i<=n3;i++){

        n2 = (N-i*m3)/m2;

        for(j=0;j<=n2;j++){

            if((N-i*m3-j*m2)%m1 == 0){
                time++;
            }
        }
    }
    printf("%d",time);
    return 0;
}