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



Sample input:
5 14 80


Sample output:
3

Submission status: Accepted

Solution code:
def table_composition(N):
    table = []
    i = 1
    while i <= N/2:
        if N%i == 0:
            table.append(i)
        i += 1
    table.append(N)
    return table

a, b, c = map(int, input().split())
table = table_composition(c)
count = 0
for ele in table:
    if ele >= a and ele <= b:
        count += 1
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,c = map(int, input().split(" "))
count = 0

for w in range(a,b+1):
    if c%w == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
num = input().split()
a = int(num[0])
b = int(num[1])
c = int(num[2])
ans = 0
for i in range(a,b+1):
    if c % i == 0:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
import os

a, b, c = list(map(int, input().split()))
count = 0
for i in range(a, b + 1):
    if c % i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
# coding: utf-8

list = input().rstrip().split(" ")
len = int(list[1]) - int(list[0])

count = 0

for i in range(len+1):
    num = int(list[0]) + i
    result = int(list[2]) % int(num)
    if int(result) == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
x = 0
for i in range(a,(b + 1)):
    if c % i == 0:
        x += 1
print(x)

Submission status: Accepted

Solution code:
a,b,c = list(map(int, input().split()))

count = 0
for i in range(a, b+1):
    if c % i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
l = [i for i in range(a,b+1) if c%i == 0]
print(len(l))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
num = 0

if b != 1:
    #if a == 1:
    #    a += 1
    for i in range(a,b+1):
        if (c % i) == 0:
            num += 1
else:
    num = 1
print(num)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
count = 0
for x in range(a,b+1):
    if (c%x==0):count += 1
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split(" "))
divisors = []
for i in range(a,b+1):
    if c % i == 0 :
        divisors.append(i)
print(len(divisors))

Submission status: Accepted

Solution code:
a,b,c = [int(i) for i in input().split()]
n = 0
for i in range(a, b+1):
	if c%i == 0:
		n+=1
print(n)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
l = []
for i in range(1, c+1):
    if c%i==0:
        l.append(i)
res = 0
for i in range(a, b+1):
    if i in l:
        res+=1
print(res)

Submission status: Accepted

Solution code:
a=[]
A,B,C= map(int, input().split())       
for x in range(A,B+1):
    if C%x==0:
        a.append(x)
    else:
        pass
y =len(a)
print(y)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

n = 0
for i in range(a, b+1):
    if c%i == 0:
        n += 1

print(n)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))

count = 0
for i in range(a, b + 1):
    if c % i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

import math

def func():
    try:
        line = input().rstrip()
        numbers = line.split(" ")
        for i,item in enumerate(numbers):
            numbers[i]=int(item)
    except:
        print("input error")
        return -1

    minimum=numbers[0]
    maximum=numbers[1]
    number=numbers[2]
    
    count=0
    devs = devisor(number)
    
    while(True):
        try:
            num=devs.pop()
            if( (num >= minimum) and (num <= maximum) ):
                count+=1
        except:
            break
    
    print(count)
    

def devisor(num):
    '''
    num????´???°???????????¨????????????
    loop?????°??????num????´??????°????§£???????????????????????§????´???°?????????????¨???????????????????
    '''
    
    result=set()

    for i in range(2,int(math.sqrt(num))+2):
        if(num % i == 0):
            subdevisor = devisor(int(num/i))        #num/i????´???°????±???????
            result.update(subdevisor)               #num/i????´???°???result?????????
            while(True):
                try:
                    result.add(i*subdevisor.pop())  #i??¨(num/i????´???°)?????????result?????????
                except:
                    break
            break
        elif(i==int(math.sqrt(num))+1):
            result.update({1,num})                  #num?????????????????§??§?´???°??????????????????????????°???1??¨num???result????????? (num????´???°)
    
    return result
    
func()

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
ans = 0
for i in range(a, b+1):
    if c % i == 0:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

import math

def func():
    '''
    ?¨??????\???"minimum maximum number"(minimum, maximum, number????????¶??°)???????????????
    minimum ~ maximum???????????????????????????number????´???°????????°?????°??????
    '''

    try:
        numbers = [ int(item) for item in input().rstrip().split(" ")]  #??\???????????????????????????
    except:
        return inputError()

    (minimum, maximum, number) = (item for item in numbers)
    if(number<1):
        return inputError()

    count=0
    devs = devisor(number)  #?´???°?????????????±???????
    while(True):
        try:
            num=devs.pop()  #?´???°???????????????????´????1?????????
            if( (num >= minimum) and (num <= maximum) ):
                count+=1
        except: #devs???????´??????¨?????????????????????????????´???
            break
    
    print(count)

def devisor(num):
    '''
    num????´???°???????????¨????????????
    loop?????°??????num????´??????°????§£???????????????????????§????´???°?????????????¨???????????????????
    num???1?????????????????\??????????????´???????????????????????????
    ???????°???°???????????\??????????????´?????????int(num)??§??´??°???????????????????´???°????±???????
    '''
    
    result=set()
    if(num<1):
        return result

    num=int(num)
    for i in range(2,int(math.sqrt(num))+2):
        if(num % i == 0):                           #i???num????´???°?????´???
            subdevisor = devisor(num/i)        #num/i????´???°????±???????
            result.update(subdevisor)               #num/i????´???°???result?????????
            while(True):
                try:
                    result.add(i*subdevisor.pop())  #i??¨(num/i????´???°)?????????result?????????
                except:
                    break
            break
        elif(i==int(math.sqrt(num))+1):
            result.update({1,num})                  #num?????????????????§??§?´???°??????????????????????????°???1??¨num???result????????? (num????´???°)
    
    return result

def inputError():
    '''
    print("input Error")
    return -1
    '''

    print("input Error")
    return -1
    
func()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
answer = 0

for i in range(a,b+1):
    if c % i ==0:
        answer += 1

print(answer)

Submission status: Accepted

Solution code:
divisors = []
divisorsc = []

a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)

for n in range(int(c)):
    if c%(n + 1) == 0:
        divisorsc.append(n+1)

#if a == b:
    #if a in divisorsc:
       # divisors.append(a)
        
for i in range(1 + b - a):
    if i + a in divisorsc:
        divisors.append(i+a)
        
print(len(divisors))

Submission status: Accepted

Solution code:
def func(l):
    i = 0
    for num in range(l[0], l[1]+1):
        #print(num)
        if l[2] % num == 0:
            #print(num)
            i = i + 1
    return i

if __name__ == '__main__':
    N = input().split(" ")
    l = []
    for i in N:
        l.append(int(i))

    result = func(l)
    print(result)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
count=0
for i in range(a,b+1):
  if c % i == 0:
    count += 1

print(count)

Submission status: Accepted

Solution code:
num = [int(n) for n in input().split(" ")]

a = num[0]
b = num[1]
c = num[2]

count = 0
for i in range(a, b+1):
    if c % i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int,raw_input().split())

count = 0
for n in range(a,b+1):
	if c % a == 0:
		count += 1
	a += 1

print('{0}'.format(count))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
counter = 0
for n in range(a,b + 1):
    if c % n == 0:
        counter += 1
       
print(counter)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for i in range(a,b + 1):
    if c % i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
#coding:utf-8

a , b , c =[int(i) for i in input().split(" ")]
yaku = []

for i in range(a , b+1):
    if c % i ==0:
        yaku.append(i)

print(len(yaku))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split(' '))

n = 0

for i in range(a, b+1):
    n += (1 if c%i == 0 else 0)

print(n)

Submission status: Accepted

Solution code:
from operator import add
from functools import reduce

def divisor_generator(a, b, c):
    for i in range(a, b+1):
        yield (1 if c%i == 0 else 0)

a, b, c = map(int, input().split(' '))

print(reduce(add, divisor_generator(a, b, c)))

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
count = 0
for i in range(a, b + 1):
    if c % i == 0:
            count += 1

print count

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
cnt = 0
for i in range(a, b + 1):
    if c % i == 0:
        cnt += 1
print cnt

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
counter = 0
for i in range(a, b+1):
 if c % i == 0:
  counter += 1

print(counter)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(len([x for x in range(a,b+1) if (c%x == 0)]))

Submission status: Accepted

Solution code:
import sys


a,b,c = map(int, sys.stdin.readline().split())
count=0
if a!=b :
    for i in range(a,b+1):

        if c%i == 0 :
            count+=1
else:
    if c%a == 0 :
        count+=1
print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(len([x for x in range(a,b+1) if (c % x ) == 0]))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

count = 0
for i in range(a,b+1):
    if c % i==0:
      count += 1

print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for x in range(a, b+1):
    if c % x == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt = 0
for n in range(a, b+1):
    if c % n == 0:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = input().split(" ")
a = int(s[0])
b = int(s[1])
c = int(s[2])
yakusuu = 0
for i in range(a, b+1):
    if c % i == 0:
        yakusuu +=1
print(yakusuu)

Submission status: Accepted

Solution code:
cnt=0
a,b,c=map(int,input().split())
for i in range(a,b+1):
	if (c%i==0):
			cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
num = input().split(" ")
a = int(num[0])
b = int(num[1])
c = int(num[2])
count = 0

for i in range(a,b+1):
    if c % i == 0:
        count += 1
    
print(count)

Submission status: Accepted

Solution code:
a, b ,c  = [int(n) for n in input().split()]
count = 0
for n in range(a, b+1):
    if c%n == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d=0
for i in range(a,b+1):
    if c % i == 0:
        d+=1
print(d)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
l = input().strip().split()
a = int(l[0])
b = int(l[1])+1
c = int(l[2])
ret = 0
for i in (range(a,b)):
    if(c % i == 0):
        ret = ret + 1

print(ret)

Submission status: Accepted

Solution code:
#!/usr/bin/python

a, b, c = (int(i) for i in input().split())
count = 0

for i in range(a,b+1):
  if c % i == 0:
    count += 1

print(count)

Submission status: Accepted

Solution code:
i = count = 0
a = b = c = ''


line = input()

while line[i] != ' ':
    a = a + line[i]
    i += 1

i += 1
while line[i] != ' ':
    b = b + line[i]
    i += 1

i += 1    
while i < len(line):
    c = c + line[i]
    i += 1
    
a = int(a)
b = int(b)
c = int(c)

while a <= b:
    if c%a == 0:
        count += 1
    a += 1

print(count)

Submission status: Accepted

Solution code:
input_data = [int(i) for i in input().split()]

a = input_data[0]
b = input_data[1]
c = input_data[2]

count=0
for i in range(a,b+1):
	if c % i == 0:
		count +=1

print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(len([n for n in range(a, b + 1) if c % n == 0]))

Submission status: Accepted

Solution code:
a,b,c = [int(i) for i in input().split()]
res = 0
for num in range(a,b+1):
    if c%num == 0:
        res += 1
print(res)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
count = 0
for i in range(a,b+1):
        if c % i == 0:
                count += 1
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
count=0                                                                     
for i in range(a,b+1):
    if c % i == 0:
        count+=1
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())                                     
count=0
for i in range(a,b+1):
    if c % i == 0:
        count+=1
print(count)

Submission status: Accepted

Solution code:
a, b, c = [int(w) for w in input().split()]
print(len([i for i in range(a, b+1) if c % i == 0]))

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
ans = 0
for i in range(a, b+1):
    if i == 1 or c % i == 0:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
#! python3

a, b, c = [int(x) for x in input().strip().split(' ')]
r = 0
for i in range(a, b+1):
  if c % i == 0:
    r += 1
print(r)

Submission status: Accepted

Solution code:
N = input().split()

a = int(N[0])
b = int(N[1])
c = int(N[2])

count = 0
while a <= b:
    if c % a == 0:
       count += 1
    a += 1
print(count)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))

ans = 0
for x in range(a, b+1):
    if c % x == 0:
        ans +=1
print (ans)

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in input().split()]
k=0
for i in range(a,b+1):
    if c%i==0:
         k=k+1
print(k)

Submission status: Accepted

Solution code:
i = input()
i_l = i.split()
count = 0
for each in range(int(i_l[0]),int(i_l[1])+1):
    if int(i_l[2]) % each == 0:
        count += 1
else:
    print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
n_of_divisor = 0
for i in range(a, b+1):
	if c % i == 0:
		n_of_divisor += 1
print(n_of_divisor)

Submission status: Accepted

Solution code:
a,b,c = [int(s) for s in input().split(' ')]
temp = [c%i == 0 for i in range(a,b+1)]
print(sum(temp))

Submission status: Accepted

Solution code:
def HowManyDivisor():
    a,b,c = map(int,input().split())
    cnt=0

    for i in range(a,b+1):
        if c%i==0:cnt+=1

    print(cnt)
HowManyDivisor()

Submission status: Accepted

Solution code:
num = input()
num_1 = num.split()
a = int(num_1[0])
b = int(num_1[1])
c = int(num_1[2])
count = 0
while a <= b:
    if c % a == 0:
        count += 1
    a += 1

print(count)

Submission status: Accepted

Solution code:
import sys
(a, b ,c) = [int(i) for i in input().split(' ')]
x = a
cnt = 0
while x <= b:
    if (c % x == 0) : cnt+=1
    x += 1
else:        
    print(cnt)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

cnt = 0
for i in range(a,b+1):
  if c % i == 0:
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

m=0
while b >=a:
    if c % b == 0 :
        m = m + 1

    else:
        pass
    b = b-1
    
print(m)

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))

i=0
for j in range(a, b+1):
    if c%j==0:
        i+=1

print(i)

Submission status: Accepted

Solution code:
a = map(int,raw_input().split())
i=0
while a[0] <= a[1]:
	if a[2]%a[0] == 0:
		i += 1
	a[0] += 1
		
print i

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
count=0
for i in range(a,b+1) :
    if c%i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a,b,c=[int(i)for i in input().split()]
d=0

for i in range(a,b+1):
	if c%i==0:
		d=d+1
print(d)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
i = 0
for n in range(a, b + 1):
	if c % n == 0:
		i += 1
print(i)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
i=0
for s in range(a,b+1):
 if c % s == 0:
  i += 1
print(i)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
result = 0
for i in range(a, b+1):
    if c % i == 0:
        result += 1
print(result)

Submission status: Accepted

Solution code:
### 20.07.2017
x = []
a, b, c = map(int, input().split())
for i in range(a, b+1):
	if c % i ==0:
		x.append(i)
print(len(x))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
i=0
for x in range(a,b+1):
  if(c%x==0):
    i+=1
print(i)

Submission status: Accepted

Solution code:
a, b, N = list(map(int, input().split()))

divisors_list = []
for i in range(a,b+1):
    divisor = N%i
    if divisor == 0:
        divisors_list.append(divisor)

print(len(divisors_list))

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
num = []
for i in range(a,b+1):
    if c % i == 0:
        num.append(i)
    else:
        continue
print(len(num))

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
result = 0
for i in range(a, b + 1):
    if c % i == 0:
        result += 1
print(result)

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())

cnt = 0
for i in range(a, b+1):
    if c % i == 0: cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
a,b,c = map(int, raw_input().split())
ret = []
for i in range(a, b+1, 1):
    if c % i == 0:
        ret += [i]
print(len(ret))

Submission status: Accepted

Solution code:
x = input().split(" ")
a = int(x[0])
b = int(x[1])
c = int(x[2])
count = 0
for i in range(a,b+1):
    if c % i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
print((lambda a: len([i for i in range(a[0], a[1]+1) if a[2] % i == 0]))(list(map(int, input().split()))))

Submission status: Accepted

Solution code:
def counter(a, b, c):
    count = 0
    for n in range(a, b+1):
        if c % n == 0:
            count += 1
    print(count)

a, b, c = list(map(int, input().split()))
counter(a, b, c)

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split(" ")))
div = [i if(c%i==0)else 0 for i in range(a,b+1)]
div.append(0)
print(len(set(div))-1)

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split(" ")))

div=0
for i in range(a,b+1):
    if c % i == 0:
        div += 1
print(div)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
divisor = 0
for n in range(a, b+1):
    if c % n == 0:
        divisor += 1
print(divisor)

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split()))
div = 0
for i in range(a,b+1):
    if(c%i == 0):
        div+=1
print(div)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
div = [i for i in range(a,b+1) if c%i==0]
print(len(div))

'''??????????§£?????¨??????.
a,b,c = map(int,input().split())
div = 0
for i in range(a,b+1):
    if c%i == 0:
        div += 1
print(div)
'''

Submission status: Accepted

Solution code:
r = 0
a,b,c = [int(i) for i in input().split()]
for i in range((b + 1) - a):
    t = c % a
    if(t == 0):
        r += 1
    a += 1
print(r)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=[i for i in range(a,b+1)]
count=0
for i in d:
    if c%i==0:
        count+=1
print(count)

Submission status: Accepted

Solution code:
[a, b, c] = [int(number) for number in input().split()];
count = 0;
for i in range(a, b + 1):
	if (c % i == 0):
		count += 1;
print(count);

Submission status: Accepted

Solution code:
# Aizu Problem ITP_1_3_D: How Many Divisors?
#
import sys, math, os

# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input.txt", "rt")


a, b, c = [int(_) for _ in input().split()]
print(sum([c % k == 0 for k in range(a, b + 1)]))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

count = 0
for i in range(a,b+1):
    if c % i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))

a,b,c=x[0],x[1],x[2]

cnt=0

for i in range(a,b+1):
    if c % i == 0:
         cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().split())
count = 0
for i in xrange(a, b + 1):
    if c % i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for i in range(a, b+1):
    if c % i == 0:
        count +=1
 
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,raw_input().split())

count=0
for x in range(a,b+1):
  if c%x==0:
    count+=1
  



print (count)

Submission status: Accepted

Solution code:
a,b,c = map(int, raw_input().split())
count = 0

for i in range(a, b+1):
  
  if c % i == 0:
    count += 1
    
print(str(count))

Submission status: Accepted

Solution code:
a,b,c = map(int, raw_input().split())

count=0
for x in range(a,b+1):
    if  c%x == 0:
       count += 1
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for i in range(a, b+1):
    if c%i == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
div = 0

for n in range(a, b+1):
	if c % n == 0:
		div += 1
		
print(div)

Submission status: Accepted

Solution code:
a,b,c = map(int,raw_input().split())
sum = 0
for i in range(a,b+1):
    if c % i == 0:
        sum += 1
print sum

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = a
num = 0
while count <= b :
	if c % count == 0 :
		num += 1
	count += 1
	if count == b + 1 :
		print(num)

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
cnt = 0
for i in range(a, b+1) :
    if c % i == 0:
        cnt = cnt + 1
print(cnt)

Submission status: Accepted

Solution code:
I = input().split()
a = int(I[0])
b = int(I[1])
c = int(I[2])

cnt = 0
while a <= b:
    if c % a == 0:
        cnt += 1
    a += 1

print(str(cnt))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
cnt = 0

for i in range(a,b+1):
    if(c%i==0):
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

count = 0
for i in range(a, b+1):
    if c%i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
d=0
for i in range(a,b+1):
    if c%i==0:
        d+=1
print(d)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

count=0

for i in range(a,b+1):
    if c%i==0:
        count+=1

print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
d=0
for x in range(a,b+1):
    if c%x==0:d+=1
print(d)

Submission status: Accepted

Solution code:

a,b,c=map(int,input().split())
x=0
for i in range(a,b+1):
    if c%i==0:
      x+=1
print(x)

Submission status: Accepted

Solution code:
def g(s):
    a, b, c = list(map(int, s.split()))
    for i in range(a, b+1):
        if c % i == 0:
            yield 1

print(sum(g(input())))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

count = a
num = 0
while count <= b:
    if c % count == 0:
        num += 1
    count += 1
    if count == b + 1:
        print(num)

Submission status: Accepted

Solution code:
nums=[]
nums=input().split()
a=int(nums[0])
b=int(nums[1])
c=int(nums[2])
ans=0
for i in range(a,b+1):
    if c%i==0:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
x = list(input().split(" "))
c = int(x[2])
divisors = 0
for i in range(int(x[0]), int(x[1])+1):
    if c % i == 0:
        divisors += 1
print(divisors)

Submission status: Accepted

Solution code:
x = list(input().split(" "))
a = int(x[0])
b = int(x[1])
c = int(x[2])
divisors = 0
for i in range(a, b+1):
    if c % i == 0:
        divisors += 1
print(divisors)

Submission status: Accepted

Solution code:
my_value = input()
my_value_list = ([int(x) for x in my_value.split()])

count = 0
for i in range(my_value_list[0], my_value_list[1]+1):
    if my_value_list[2] % i == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
cnt = 0
for i in range(a,b+1):
 if c%i == 0 : cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
a, b, c = input().split()

count_devisors = 0
for number in range(int(a), int(b)+1):
    if int(c) % number == 0:
        count_devisors += 1
print(count_devisors)

Submission status: Accepted

Solution code:
# (c) midandfeed
a, b, c = [int(x) for x in input().split()]
ans = 0
for x in range(a, b+1):
	if (c%x == 0):
		ans += 1
		
print(ans)

Submission status: Accepted

Solution code:
a, b, c = map (int, input().split())
count = 0
for i in range(a, b+1):
    if c % i == 0:
        count += 1

print (count)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
x = 0
while a <= b:
    if c % a == 0:
        x += 1
    a +=  1
print(x)

Submission status: Accepted

Solution code:
d = 0
a, b, c = map(int, input().split())
for i in range(a, b+1):
    if c % i == 0:
        d +=1
print(d)

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]

a = l[0]
b = l[1]
c = l[2]

yaku = 0

for i in range(b-a+1):
    if c % (i+a) == 0:
        yaku = yaku + 1

print(yaku)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = 0
for i in range(a, b + 1):
    if c % i == 0:
        d += 1
print(d)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
d = 0
for i in range(a, b + 1):
    if c % i == 0:
        d += 1
print(d)

Submission status: Accepted

Solution code:
[a, b, c] = list(map(int, input().split()))
d = 0
for i in range(a, b + 1):
    if c % i == 0:
        d += 1
print(d)

Submission status: Accepted

Solution code:
x, y, z = map(int, input().split())
i = x
n = 0
while i <= y:
	if z % i == 0:
		n += 1
	i += 1
print(n)

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in raw_input().split()]
num = 0
for i in range(a,b+1):
    if c % i == 0:
        num += 1

print num

Submission status: Accepted

Solution code:
z = input()
a = list(map(int, z.split()))
cnt = 0
for i in range(a[0], a[1] + 1, 1):
    if a[2] % i == 0:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
indata = input().split()
a = int(indata[0])
b = int(indata[1])
c = int(indata[2])
count = 0

for i in range(a,(b+1)):
    if (c % i) == 0:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=[i for i in range(a,b+1) if c%i==0]
print(len(d))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for div in range(a, b+1):
    if c % div == 0:
        count += 1
print(count)

Submission status: Accepted

Solution code:
a,b,c=[int(i) for i in input().split()]

num=0
#s=[i for i in range(1,c+1) if c%i==0]
# print(s)

for i in range(1,c+1):
    if c%i==0:
        if i>=a and i<=b:
            num=num+1
print(num)

Submission status: Accepted

Solution code:
a, b, c = [int(s) for s in input().split()]
hit = 0
for i in range(a, b + 1):
    if c % i == 0:
        hit += 1
print(hit)

Submission status: Accepted

Solution code:
cnt = 0
a,b,c = list(map(int, input().split()))
for var in range(a,b+1):
    if c%var == 0:
        cnt += 1
print (cnt)

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
n=0
for i in range(a,b+1):
    n+=(c%i==0)
print(n)

Submission status: Accepted

Solution code:
def main():
    a,b,c = map(int, input().split())
    
    ab = [i for i in range(a, b + 1)]
    cnt = 0 #count
    for x in range(len(ab)):
        if c % ab[x] == 0:
            cnt += 1
        else:
            pass
    
    print(cnt)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = raw_input().split(" ")
for i in range(0, len(S)):
  S[i] = int(S[i])

primeNum = 0

for i in range(S[0], S[1]+1):
  if(S[2] % i == 0):
    primeNum = primeNum+1

print(primeNum)

Submission status: Accepted

Solution code:
deglist = raw_input().split(" ")
a = int(deglist[0])
b = int(deglist[1])
c = int(deglist[2])

cnt = 0
for x in range(a, b+1):
	if c % x == 0:
		cnt += 1

print cnt

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int,input().split())
 
    _set = set()
    if a <= c and b >= c: _set.add(c)
    if c // 2 < b:
        b = c // 2
    if c % 2 == 0:
        _set = _set | set(range(a, b+1))
    else:
        if a % 2 == 0:
            _set = _set | set(range(a+1, b+1, 2))
        else:
            _set = _set | set(range(a, b+1, 2))
             
    print(sum(map(lambda x: c % x == 0, _set)))
 
main()

Submission status: Accepted

Solution code:
line = input()
a,b,c = map(int, line.split())

cnt = 0
for x in range(a, b+1):
    if c % x == 0:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = 0
for i in range(a, b +1):
    n = c % i
    if n == 0:
        count = count + 1
print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D&lang=jp

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    a, b, c = map(int, input().split())
    divisor = 0

    for i in range(a, b+1):
        if c % i == 0:
            divisor += 1
    print(divisor)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
a, b, c=map(int, input().split())
x=0
for i in range(a, b+1):
    if c%i==0:
        x+=1
print(x)

Submission status: Accepted

Solution code:
ipt = input().split()
ipt = [int(x) for x in ipt]
count = 0
for i in range(ipt[0], ipt[1]+1):
  if ipt[2] % i == 0:
    count += 1
print(count)

Submission status: Accepted

Solution code:
n = 0
a,b,c = list(map(int,input().split()))
for i in range(a,b + 1):
  x = c % i
  if x == 0:
    n += 1
print(n)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print(len([x for x in range(a,b+1) if c % x == 0]))