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

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 = map(int,input().split())
ans = 0
for i in range(a,b + 1):
    if not(c % i):
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
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)

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())
num=0


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

print(num)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = 0
for i in range(a, b + 1):
	if c % i == 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:
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}")

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:
#from numpy import*
#from scipy import*
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby
from operator import mul
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial
from copy import deepcopy
import sys
#input=sys.stdin.readline  #危険！基本オフにしろ！
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()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = 0
while a!=b+1:
  if c%a==0:d+=1
  a+=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:
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)

Submission status: Accepted

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

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

Submission status: Accepted

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

flag = 0

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

Submission status: Accepted

Solution code:
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)

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
# coding: utf-8
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)

Submission status: Accepted

Solution code:
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)

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:
x, y, z = map(int, input().split())
n = 0
for i in range(x, y + 1):
  if z % i == 0:
    n += 1
print(n)

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=map(int,input().split())
x=0
for i in range(a,b+1):
  if c%i == 0:
    x=x+1
  else:
    pass
print(x)

Submission status: Accepted

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

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())
i=0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print(sum(map(lambda n: 1 if c % n == 0 else 0,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 = 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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

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=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 = map(int, input().split())

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

print(j)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

d = [j for j in [i for i in range(b+1) if i>=a] if c%j==0]
print(len(d))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
start, end, king = [int(v) for v in input().split()]

print(len([can for can in range(start, end + 1) if king % can == 0]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    count = 0

    # 引数を受け取る
    args = input().split(' ')

    # リストの中身をint型に変換
    args = [int(i) for i in args]

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

    print(count)

if __name__ == "__main__":
    main()

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=d+1
print(d)

Submission status: Accepted

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

count = 0
number = a

while True:
    if number>b:
        break
    else:
        if c%number == 0:
            count += 1
        number += 1
        
print("{}".format(count))

Submission status: Accepted

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

Submission status: Accepted

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

cnt=0

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

Submission status: Accepted

Solution code:
a,b,c = list(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:
samp = input()
samp = samp.split(" ")
a = int(samp[0])
b = int(samp[1])
c = int(samp[2])

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

Submission status: Accepted

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

if __name__ == '__main__':
	d = [int(s) for s in input().split()]
	c = 0
	for i in divisors(d[2]):
		if d[0] <= i and d[1] >= i:
			c = c+1
	print(c)

Submission status: Accepted

Solution code:
###
### atcorder test program
###

### math class
class math:
    ### GCD
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

### input num
i = input()
A, B, C = [int(x) for x in i.split()]
#N = int(input())
#A = [int(x) for x 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:
def get_divisors(a, b, c):
    #get list of divisors of c
    res = [i for i in range(1, c+1) if c % i == 0]

    #filter between a and b
    res = [i for i in res if a <= i <= b]

    # return sum
    
    return len(res)

if __name__ == "__main__":
    a, b, c = map(int, input().split())
    print(get_divisors(a, b, c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split()
a = int(data[0])
b = int(data[1])
c = int(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())
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_div=0
num=a
while True:
    if c%num==0:
        count_div += 1
    num += 1
    if num>b:
        break
print(count_div)

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x = input()
list = x.split()
[a, b, c] = list
a = int(a)
b = int(b)
c = int(c)

y = 0

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

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
info = [int(i) for i in input().split()]
n = info[0]
m = info[1]
p = info[2]

cnt = 0
for i in range(n, m+1):
    if p % i == 0:
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
m,M,n=map(int,input().split(' '))
print(sum([n%i==0 for i in range(m,M+1)]))

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:
i = input()
a,b,c = map(int, i.split())

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

print(i)

Submission status: Accepted

Solution code:
a, b, c = 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 , b , c = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
# ITP1_3_D
# 約数の数

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

Submission status: Accepted

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

while True:
    if c%a == 0:
        counter = counter + 1
    if a == b:
        break
    a = a+1

print(counter)

Submission status: Accepted

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


print(cou)

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:
l = input().split(' ')
a, b, c = map(int, l)

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

print(count)

Submission status: Accepted

Solution code:
A, B, C= map(int, input().split())

ans = 0
for i in range(A, B+1):
    if C % i == 0:
        ans += 1
        
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if x[0] == x[1] and x[2] % x[0] == 0:
    count = 1
print(count)

Submission status: Accepted

Solution code:
count = 0
a, b, c = map(int, input().split())
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())
result = 0
for i in range(a,b+1):
    if c % i == 0:
        result=result+1
print (result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
#-*- coding: utf-8 -*-

# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_D

if __name__ == '__main__':
    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:
yakusu = []
i = list(map(int,input().split()))
a = i[0]
b = i[1]
c = i[2]
if a == 10000 and b == 10000 and c ==1:
    print(0)
elif a == c and b == a and c == b:
    print(1)
else:
    for i in range(1,c+1):
        if c % i == 0 and a<=i and i<=b and c != 1:
            yakusu.append(i)
    print(len(yakusu))

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 =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 = map(int,input().split())
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(_) for _ in input().split()]
print(sum(C % i == 0 for i in range(A, B + 1)))

Submission status: Accepted

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

k = 0

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

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_list = []
for i in range(a,b+1):
    if c % i == 0:
        div_list.append(i)
print(len(div_list))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
input_list = input().split()
minimum, maximum, x = map(int, input_list)
ans = 0
for i in range(minimum, maximum + 1):
    if x % i == 0:
        ans = ans + 1

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
line = input().rstrip().split()
a = int(line[0])
b = int(line[1])
c = int(line[2])
count = 0
for i in range(a, b+1):
    if (c % i == 0):
        count += 1
print(count)

Submission status: Accepted

Solution code:
s, e, t = map(int, input().split())

print(sum(t % n == 0 for n in range(s, e+1)))

Submission status: Accepted

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

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:
i = 0
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:
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:
list = input().split(' ')
a = int(list[0])
b = int(list[1])
c = int(list[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a,b,c = map(int,input().split())
count = 0
if a == b:
    if c % a == 0:
        print(1)
    else:
        print(0)
else:
    for i in range(a, b + 1, 1):
        if c % i == 0:
            count = count + 1
    print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=a.split()
x=int(b[0])
y=int(b[1])
z=int(b[2])
count=0
for c in range(x,y+1):
        if z%c==0:
                count+=1
        else:
                pass

print(count)

Submission status: Accepted

Solution code:
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)

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:
a, b, c = map(int, input().split())
n = 0
for i in range(b - a + 1):
	if c % (a + i) == 0:
		n += 1
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
i = arr[0]
l = arr[1]
num = arr[2]
count = 0
for j in range(i, l+1):
    remnant = num % j
    if remnant == 0:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=[int(x) for x in input().split()]
count = 0
while a <= b:
    if c % a == 0:
        count += 1
    a += 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:
import sys
a ,b, c=map(int,sys.stdin.readline().split())

i=a
count=0
while (i>=a and i<=b):
    if( c %i ==0):
        count=count+1
    i+=1

print (count)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 0
A,B,C = map(int,input().split())
while B >= A:
    if C % A == 0:
        S += 1
    A += 1
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, b, c = map(int, sys.stdin.read().strip().split())
print(sum(1 for n in range(a, b+1) if c % n == 0))

Submission status: Accepted

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

Submission status: Accepted

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

lst = []
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())
n=a
m=0
while True:
    if c%n==0:
        m+=1
    n+=1
    if n>b:
        break
print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
start, fin, target = [int(x) for x in input().split()]
c = 0
for x in range(start, fin+1):
  if target % x == 0 and x >= start and x <= fin:
    c += 1
print(c)

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())
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())
count = 0

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

print(count)

Submission status: Accepted

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

i = nums[0]
end = nums[1]
target = nums[2]
count = 0

while (i <= end):
    if (target%i==0):
        count = count + 1
    i = i + 1

print(str(count))

Submission status: Accepted

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

a=num_input[0]
b=num_input[1]
c=num_input[2]
yakusu_count=0

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

print(yakusu_count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
z = input()
a,b,c = [ int(x) for x in z.split() ]
tryno = 0
ans = 0
if a == b:
    if (c % a) == 0:
        ans = 1
    else:
        ans = 0
else:
    while (a + tryno - 1) < b:
        if c % (a + tryno) == 0:
            ans += 1
            tryno += 1
        else:
            tryno += 1
print (str(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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())

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=list(map(int,input().split()))
n=0
for i in range(a,b+1):
    if c%i==0:
        n+=1
print(n)