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;

public class HowManyDivisors
{
    //???????????????????????? a~b?????????c????´???°??????????????????????????????
    static void Main(string[] args)
    {
        /*---??£?¨???¨---*/
        int i;
        string[] unit_num;
        int[] num = new int[3]; //a, b, c = num[0], num[1], num[2]
        int count = 0; //?´???°?????±?¨?
        /*---??£?¨???¨---*/

        
        /*3?????????[a,b,c](a???b????????????c????´???°??????????????????)????????????????????§??????*/
        unit_num = Console.ReadLine().Split(' ');
        num[0] = int.Parse(unit_num[0]);
        num[1] = int.Parse(unit_num[1]);
        num[2] = int.Parse(unit_num[2]);

        /*a~b????????§c????´???°?????°????????????*/
        for(i = num[0]; i <= num[1]; i++){
            if(num[2] % i == 0){
                count++;
            }
        }

        Console.WriteLine(count);
    }
}