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: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Text;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            List<int> divisorList = new List<int>();
            List<int> countResult = new List<int>();

            var Input = Console.ReadLine().Split(' ');

            var divisor = int.Parse(Input[2]);

            //??\????????????C??????????´???°??????
            for (int i = 1; i <= divisor/2; i++)
            {

                if(divisor%i == 0)
                {
                    divisorList.Add(i);
                }
            }

            divisorList.Add(divisor);

            for(int x = int.Parse(Input[0]); x < int.Parse(Input[1]); x++)
            {
                foreach(var find in divisorList)
                {
                    if(find == x)
                    {
                        countResult.Add(find);
                    }
                }

            }

            Console.WriteLine(countResult.Count);
        }

    }

}