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: Time Limit Exceeded)

import java.util.*
import java.math.*

fun main(args: Array<String>) {
    var (R, G, B, N) = readLine()!!.split(" ").map { it.toInt() }
//    var N = readLine()!!.toInt()
//    val S = readLine()!!
//    val D = readLine()!!.split(" ").map { it.toLong() }
//    val A = readLine()!!.split(" ").map { it.toInt() }.toIntArray()

    var ans = 0

    for (i in 0..N/R) {
        val r = i*R
        for (j in 0..N/G) {
            val rg = r+j*G
            if (rg > N) break
            for (k in 0..N/B) {
                val rgb = rg + k*B
                if (rgb == N) ans++
                if (rgb >= N) break
            }
        }
    }


    println(ans)
}