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.Collections.Generic;

namespace ITP1_1_A
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] inputnum = Console.ReadLine().Split();

            var divisor = new List<int>();
            int answer = 0;

            for (int i = 1; i <= int.Parse(inputnum[2]); i++)
            {
                if (int.Parse(inputnum[2]) % i == 0)
                {
                    divisor.Add(i);
                }
            }

            for (int j = 0; j < divisor.Count; j++)
            {
                if (int.Parse(inputnum[0]) <= divisor[j] && divisor[j] <= int.Parse(inputnum[1]))
                {
                    answer += 1;
                }
            }

            Console.WriteLine(answer);

        }
    }
}