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 (Python):
a, b, c = [int(x) for x in input().split(' ')]
count = 0
for i in range(a, b+1):
    if c % i == 0:
        count += 1
print(count)

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

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

Solution (Python):
a,b,c = map(int, input().split())
i = a
j = 0
while i <= b:
	d = c%i
	if d == 0:
		j = j+1
		i = i+1
	else:
		i = i+1
print(j)

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

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

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

print(ans)

Solution (Python):
i = input()
x,y,z = map(int, i.split())

j = 0
while x <= y:
  if z % x == 0 or z == x:
    j = j + 1
  x = x + 1
  
print(j)

Solution (Python):
nums=input()
n_list=nums.split()
a=int(n_list[0])
b=int(n_list[1])
c=int(n_list[2])

count=0

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

print(count)

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

ans = 0
num = a

while True:
    if  c%num == 0:
        ans += 1
    num += 1
    if num > b:
        break
print(ans)

Solution (Python):




l = list(map(int,input().split()))
i = l[0]
count = 0
for target_list in range(l[1] - l[0] + 1):
    if l[2] % i == 0 :

        count += 1

    i += 1

print(str(count))

Solution (Python):

def Divisors(a,b,c):
    num = 0
    for x in range(a,b+1):
        if c % x == 0:
            num += 1
    return num


def main():
    a, b, c= map(int, input().split())
    print(Divisors(a,b,c))

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
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 = count +1
        
print(count)

Solution (Python):
def main():
    a, b, c = (int(i) for i in input().split())
    def trial_division(n):
        """
        nの約数のセットをO(sqrt(n))で求める
        """
        divs = set()
        for i in range(1,int(n**0.5)+1):
            if n % i == 0:
                divs.add(i)
                if i != n//i:
                    divs.add(n//i)
        return divs

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

if __name__ == '__main__':
    main()

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

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

print(cnt)

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

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

Solution (Python):

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

n=0

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

Solution (Python):
import sys

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

n=[]
def yaku(c):
  j=1
  moto=c
  while j<=moto:
    if c%j==0:
      n.append(j)    
    j+=1
  return n

s=[k for k in range(a,b+1)]
print(len(set(s)&set(yaku(c))))

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

count = 0

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

print(count)

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

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

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

Solution (Python):
i = 0

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

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

Solution (Python):
nums = list(map(int, input().split(" ")))

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

print(counter)

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

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

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

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

print(counter)

Solution (Python):
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)

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

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

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

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

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

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

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

Solution (Python):
x=input().split(" ")
x=list(map(int,x))
count=0
for a in range(x[0],x[1]+1):
    if x[2]%a==0:
       count+=1 
    
print(count)

Solution (Python):
a, b, c = map(int, input().split())
count = 0

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

print(count)

Solution (Python):
nums = input()
count = 0

a, b, c = map(int, nums.split())

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

print(count)

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

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

print(count)

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

d_list = [x for x in c_list if a <= x <= b]

print(len(d_list))

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

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

res = 0

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

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

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

print(cnt)

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

Solution (Python):
a, b, c = map(int, input().split())
count = 0

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

print(count)

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

answer = 0

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

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

Solution (Python):
a, b, c = (int(x) for x in input().split())
n = 0
while b >= a:
    if c % b == 0:
        n += 1
    b -= 1
print(n)

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

main()

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

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

print(ans)

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

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


count = 0

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

Solution (Python):
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)

Solution (Python):
l = input().split()
a = int(l[0])
b = int(l[1])
c = int(l[2])
x = 0
for i in range(a,b+1):
    if c%i == 0:
        x = x+1
    else:
        pass
print(x)

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

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

Solution (Python):


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

lenD = b - a + 1
divisors = [0 for i in range(lenD)]
for i in range(lenD):
    if divisors[i] == 1:
        continue
    if c % (a + i) == 0:
        divisors[i] = 1
        x = c // (a + i) - a
        if i < x and x < lenD:
            divisors[x] = 1
print(sum(divisors))

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

def make_divisors(n):
    divisors = []
    for i in range(1, int(n ** 0.5) + 1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n // i)
    divisors.sort()
    return divisors

array_ab = [i for i in range(a, b + 1)]
array_c = make_divisors(c)
count = 0

for i in array_ab:
    if i in array_c:
        count += 1

print(count)

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

print(count)

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

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

Solution (Python):
def test():

	i = list(map(int,input().split()))
	count = 0

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

if __name__ == "__main__":
	test()

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

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

Solution (Python):
count = int(0)

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

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

print(count)

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

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

Solution (Python):
x=raw_input().split()
a=int(x[0])
b=int(x[1])
c=int(x[2])
n=[i for i in range(a, b+1) if c % i == 0]
print(len(n))

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

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

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

Solution (Python):
a,b,c = map(int, input().split())
p = 0
for j in range(a,b + 1):
    if c%j==0:
        p = p+1
print(p)

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

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

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

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

Solution (Python):

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

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

print(count)

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

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

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

print(cnt)

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

Solution (Python):
import sys
nums = list(map(lambda x: int(x), sys.stdin.readline().split()))
count = 0
for i in range(nums[0], nums[1] + 1, 1):
  if nums[2] % i == 0:
    count += 1

print(count)

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

ans = 0
num = a

while True:
    if c%num == 0:
        ans += 1
    num += 1
    if num > b:
        break

print(ans)

Solution (Python):
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)

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


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

c_div = sorted(make_divisors(c))
cnt = 0
for d in c_div:
    if a <= d and d <= b:
        cnt += 1
print(cnt)

Solution (Python):
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)

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

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

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

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

ans=0

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

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

answer=0

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

print(answer)

Solution (Python):
a,b,c = map(int, input().split())
c_array = []

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

print(len(c_array))

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

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

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

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

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

ans=0

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

print(ans)

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

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

ans = 0
num = a

while True:
    if c%num == 0:
        ans += 1
    num += 1
    if num > b:
        break

print(ans)

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

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

num=0

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

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

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

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

cnt = 0

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

print(cnt)

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

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

Solution (Python):



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

s = int(c**0.5 +1)

li = []

for i in range(1,s+1):
    if c%i == 0:
        li.append(i)
        li.append(c//i)
        
li = list(set(li))

ans = 0
for i in li:
    if a <= i <= b:
        ans += 1
        
print(ans)

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

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

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    
    return divisors

print(len([x for x in make_divisors(c) if a<=x and x<=b]))

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

count = 0

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

print(count)

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

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

Solution (Python):
in_data=input()

in_list=in_data.split(" ")

in_list[0]=int(in_list[0])
in_list[1]=int(in_list[1])
in_list[2]=int(in_list[2])



divisor=[]

for x in range(in_list[0],in_list[1]+1):
    if in_list[2]%x==0:
        number=in_list[2]/x
        divisor.append(number)

print(len(divisor))

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

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

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

Solution (Python):
def count_divisors(n: int, a: int, b: int) -> int:
    num_divisors = sum([(n % q) == 0 for q in range(a, b + 1)])
    return num_divisors


if __name__ == "__main__":
    a, b, n = map(lambda x: int(x), input().split())
    print(count_divisors(n, a, b))

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

if a == b:
    if c % a == 0:
        print(1)
    elif a > c:
        print(0)

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

    print(n)

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

for i in range(a,b+1):

    if c%i == 0:
        num += 1
    
print(num)

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

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

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

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

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

num_div = 0

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

print(num_div)

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

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

print(i)

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

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

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

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

print(d)

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

Solution (Python):


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

counter = b-a + 1
Answer = []

for i in range(counter):
    if c % (a + i) == 0:
        Answer.append(a + i)

print(len(Answer))

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

Solution (Python):
v = list(map(int,input().split()))
count = 0
for i in range(v[0],v[1]+1):
    if v[2]%i==0:
        count += 1
print (count)

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

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

Solution (Python):
l = input()
a, b, c = list(map(int,l.split()))
i = 0

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

print(i)

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

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

Solution (Python):
[a,b,c]=map(int,input().split( ))
x=int(a)
num=0

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

Solution (Python):
[a,b,c] = list(map(int, input().split(" ")))
count = 0

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

print(count)

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

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

print(d)

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

Solution (Python):
input_line = input()
a,b,c = [int(s) for s in input_line.split(' ') if s]
ret = 0
for d in range(a,b+1):
    if c%d == 0: ret+=1

print(ret)

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

Solution (Python):
A = [int(i) for i in input().split()]
num = 0

for i in range(A[0],A[1]+1):
	if A[2] % i == 0:
		num += 1
print(num)

Solution (Python):
a, b, c = map(int, input().split())
divisors = []
i = 1
while(i * i < c):
    if(c % i == 0):
        divisors.append(i)
        divisors.append(c // i)
    i += 1
if(i * i == c):
    divisors.append(i)
ans = 0
for i in range(len(divisors)):
    if(a <= divisors[i] <= b):
        ans += 1
print(ans)

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

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

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

A = [x for x in range(a,b+1)]
A =[x for x in A if c%x ==0]
print(len(A))

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

A = [x for x in range(a, b+1)]

A = [x for x in A if c % x == 0]

print(len(A))

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

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

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

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

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

Solution (Python):

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)

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


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

print(num)

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

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

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

Solution (Python):
a,b,c=map(int,input().split())
count=0

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

print(count)

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

d=0
i=a
while i<=b:
    if c%i ==0:
        d+=1
    i+=1
print(f"{d}")

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

Solution (Python):


from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul
from bisect import* 
from heapq import* 
from math import factorial
from copy import deepcopy
import sys

sys.setrecursionlimit(10**6)


def main():
    
    
    a,b,c=map(int,input().split())
    print(sum((c%i==0)for i in range(a,b+1)))
        
    
    
    
    
    
if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
d = 0
while a!=b+1:
  if c%a==0:d+=1
  a+=1
print(d)

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

cnt = 0

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

print(cnt)

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

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

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

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

ans = 0
num = a

while True:
    if c%num == 0:
        ans += 1
    num += 1
    if num > b:
        break

print(ans)

Solution (Python):
num = input().split(" ")

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

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

print(sum)

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

flag = 0

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

Solution (Python):
a,b,c=map(int,input().split())
d=list()
count=0
for v in range(1,c+1):
    if c%v==0 and v>=a and v<=b:
        count+=1
print(count)

Solution (Python):
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)

Solution (Python):
x = input(). split()
a, b, c = int(x[0]), int(x[1]), int(x[2])

lst = [n for n in range(a, b+1) if c % n == 0]

print("%d" % (len(lst)))

Solution (Python):
x = input().split()
a, b, c = int(x[0]), int(x[1]), int(x[2])
n = [j for j in [i for i in range(b + 1) if a <= i] if c % j == 0]
print(len(n))

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

Solution (Python):
num_val = 0
num_a, num_b, num_c = list(map(int, input().split()))
for count in range(num_a, num_b + 1):
    if num_c%int(count) == 0:
        num_val += 1
print(num_val)

Solution (Python):

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

Solution (Python):
a, b, c = map(int, input().split())
count = 0

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

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

Solution (Python):
x, y, z = map(int, input().split())
n = 0
for i in range(x, y + 1):
  if z % i == 0:
    n += 1
print(n)

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

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

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

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

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

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

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

Solution (Python):
a,b,c = map(int, input().split())
p = 0
for j in range(a,b + 1):
    if c%j==0:
        p = p+1
print(p)

Solution (Python):
a, b, c = map(int, input().split())
divisors = []
i = 1
while(i * i < c):
    if(c % i == 0):
        divisors.append(i)
        divisors.append(c // i)
    i += 1
if(i * i == c):
    divisors.append(i)
ans = 0
for i in range(len(divisors)):
    if(a <= divisors[i] <= b):
        ans += 1
print(ans)

Solution (Python):
a,b,c = map(int, input().split())
i=0

while True:
  if c%a ==0:
    i+=1
  if a == b:
    break
  a+=1
  
print(i)

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

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

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

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

Solution (Python):
a,b,c = map(int, input().split())
print(sum(map(lambda n: 1 if c % n == 0 else 0,range(a,b+1))))

Solution (Python):
a,b,c = map(int, input().split())
print(sum(map(lambda n: 1 if c % n == 0 else 0,range(a,b+1))))

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

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

Solution (Python):
a, b, c = map(int, input().split())
count = 0

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

print(count)

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

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

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

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

Solution (Python):
a,b,c=map(int,input().split())
i=int(0)
j=int(1)
while True:
  n=int(c%j)
  if(n==0 and a<=j and j<=b):
    i=i+1
  j=j+1
  if j>c:
    break
print(i)

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

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

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

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

print(j)

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

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

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