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: Wrong Answer)

#include <stdio.h>

int main(void){
    int r,g,b,n;
    int R,G,B;
    int i,j,k;
    int sum=0;
    int count=0;
    int t=0;

    scanf("%d",&r);
    scanf("%d",&g);
    scanf("%d",&b);
    scanf("%d",&n);
    R = n / r;
    G = n / g;
    B = n / b;
    
    for(i=0; i<=n; i++){
        if(r*i > n) break;
        for(j=0; j<=n; j++){
            t++;
            //printf("%d %d, %d %d,, ",i,j,r,g);
            if(r*i + g*j > n) break;
            if((n - r*i - g*j) % b != 0) {
                continue;
            }else{
                count++;
                //printf("%d %d#\n",i,j);
            }
            
        }
    }
    printf("%d %d\n",count,t);
    return 0;
}