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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[] rgb = new int[3];
		rgb[0] = sc.nextInt();
		rgb[1] = sc.nextInt();
		rgb[2] = sc.nextInt();
		int N = sc.nextInt();
		sc.close();
		Arrays.sort(rgb);
		int rgb0 = N / rgb[0];
		int rgb1 = N / rgb[1];
		int rgb2 = N / rgb[2];

		int ans = 0;
		for (int i = 0; i <= rgb2; i++) {
			for (int j = 0; j <= rgb1; j++) {
				for (int k = 0; k <= rgb0; k++) {
					int diff = N;
					if (i != 0) {
						diff -= rgb[2] * i;
						if (diff == 0) {
							ans++;
							break;
						}
						if (diff < 0) {
							break;
						}
					}
					if (j != 0) {
						diff -= rgb[1] * j;
						if (diff == 0) {
							ans++;
							break;
						}
						if (diff < 0) {
							break;
						}
					}
					if (k != 0) {
						diff -= rgb[0] * k;
						if (diff == 0) {
							ans++;
							break;
						}
						if (diff < 0) {
							break;
						}
					}
				}
			}
		}
		System.out.println(ans);
	}
}