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 Scala (2.11.7) (judge verdict: Time Limit Exceeded)

object Main extends App {
  val (r, g, b, n) = scala.io.StdIn.readLine.split(' ').map(_.toInt) match { case Array(r, g, b, n) => (r, g, b, n) }

  val nr = n / r
  val ng = n / g
  val nb = n / b

  var count = 0

  var i = 0
  while (i <= nr) {
//  for (i <- 0 to nr) {
    val tr = r * i
    var j  = 0
    while (j <= ng) {
//    for (j <- 0 to ng) {
      val trg = tr + (g * j)
      var k   = 0
      while (k <= nb) {
//      for (k <- 0 to nb) {
        val trgb = trg + (b * k)
        if (trgb == n) count = count + 1
        k = k + 1
      }
      j = j + 1
    }
    i = i + 1
  }

  println(count)
}