Problem:
How Many Divisors?

Write a program which reads three integers a, b and c, and prints the number of divisors of c between a and b.

Input

Three integers a, b and c are given in a line separated by a single space.

Output

Print the number of divisors in a line.

Constraints

1 ≤ a, b, c ≤ 10000

a ≤ b

Sample Input 1

5 14 80

Sample Output 1

3

Solution in Scala (judge verdict: Accepted)

object Main {
  def main(args: Array[String]): Unit = {
    val abc = io.StdIn.readLine().split(" ").map(_.toInt)
    val a = abc(0)
    val b = abc(1)
    val c = abc(2)

    val selfDivisor = if (a <= c && c <= b) 1 else 0
    val count =
      Iterator.iterate(a)(i => i + 1)
        .takeWhile(i => i <= b && i <= c / 2)
        .count(c % _ == 0)

    println(count + selfDivisor)
  }
}