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 Kotlin (1.0.0) (judge verdict: Runtime Error)

import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*

fun main() {
    val sc = FastScanner(System.`in`)
    val R = sc.nextInt()
    val G = sc.nextInt()
    val B = sc.nextInt()
    val n = sc.nextInt()

    val use = listOf(R, G, B)
    val dp = Array(7000) { Array(3) { 0 } }
    dp[0][0] = 1

/*
    for (x in 0..n) {
        for (u in 0..2) {
            for (k in u..2) {
                dp[x + use[k]][k] += dp[x][u]
            }
        }
    }
*/

    println(dp[n][0] + dp[n][1] + dp[n][2] )
}

class FastScanner(s: InputStream) {
    private var st = StringTokenizer("")
    private val br = BufferedReader(InputStreamReader(s))

    fun next(): String {
        while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())

        return st.nextToken()
    }

    fun nextInt() = next().toInt()
    fun nextLong() = next().toLong()
    fun nextLine() = br.readLine()
    fun nextDouble() = next().toDouble()
    fun ready() = br.ready()
}