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)

using System;
using System.Linq;

namespace AizuOnLine
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] data = Console.ReadLine().Split(' ');
            int num1 = Convert.ToInt32(data[0]);
            int num2 = Convert.ToInt32(data[1]);
            int num3 = Convert.ToInt32(data[2]);

            int ans = Enumerable.Range(num1, num2 - num1 + 1).Where(e => e <= num3 && num3 % e == 0).Count();
            Console.WriteLine(ans);
        }
    }
}