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 C# (judge verdict: Accepted)

public class How_Many_Divisors {

  static void Main(string[] args) {

    var line = System.Console.ReadLine().Trim().Split(' ');
    int a = int.Parse(line[0]);
    int b = int.Parse(line[1]);
    int c = int.Parse(line[2]);

    int counter = 0;

    for (int i = a; i <= b; i++) {
      if(c % i == 0) {
        counter += 1;
      }
    }

    System.Console.WriteLine(counter);
  }

}