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())
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())
counter = 0
for i in range(b-a+1):
	if c%(i+a) == 0:
		counter += 1
print(counter)

Submission status: Accepted

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

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 = 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:
n = 0
l = list(map(int, input().split()))
a = l[0]

while True:
    if l[2] % a == 0:
        n += 1
    a += 1
    if a > l[1]:
        break
print(n)

Submission status: Accepted

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

while True:
    if x > b:
        break
    elif  c % x == 0:
        y.append(x)
        x += 1
    elif x <= b:
        x += 1

print(len(y))

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

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

Submission status: Accepted

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

i=0

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(wakasa)

Submission status: Accepted

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

x = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if c%a==0:
    y=1
else:
    y=0

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

print(y)

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:
x=0
a,b,c=map(int,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())

sum=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = 0

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

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())
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())
x=a;y=0
for i in range(a,b+1):
    s=c%x
    x+=1
    if s==0:
        y+=1
print(y)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

print(count)

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


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

n = mapt(int, input().split(" "))
aa(*n)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(n_CF)

Submission status: Accepted

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

Submission status: Accepted

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

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:
AA,BB,n=map(int,input().split())
CC=[]

if n==1:
    L=[1]
    l = sum(i >= AA for i in L)
    ll = sum(i > BB for i in L)
    print(l-ll)
    
else:
    def sample_code():
        fct = factorize(n)
        for div in divisorize(fct):
            C=(num(div))
            CC.append(C)


    def divisorize(fct):
        b, e = fct.pop()  # base, exponent
        pre_div = divisorize(fct) if fct else [[]]
        suf_div = [[(b, k)] for k in range(e + 1)]
        return [pre + suf for pre in pre_div for suf in suf_div]
    def factorize(n):
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def num(fct):
        a = 1
        for base, exponent in fct:
            a = a * base**exponent
        return a
    if __name__ == '__main__':
        sample_code()
    CCC=sorted(CC)
    nnn = sum(i >= AA for i in CCC)
    NNN = sum(i > BB for i in CCC)
    print(nnn-NNN)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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
C=list(range(a,b+1))
for k in range(len(C)):
  if c%C[k]==0:
    ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
# 3d
#

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(divs)

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

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

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

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

con = a
ans = 0

while b>=con:
    if c%con ==0:
        ans +=1
    con +=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())
count=0
for i in range(1, c+1):
  if c%i==0:
    if i>=a and i<=b:
      count+=1
print(count)

Submission status: Accepted

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

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:
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())
count = 0
for i in range(a,b+1):
    mod = c % i

    if (mod == 0):
        count += 1
    else:
        continue
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())
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())

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

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

print(cnt)

Submission status: Accepted

Solution code:
x=0
a,b,c=map(int,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, open(0).read().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())

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

print(sm)

Submission status: Accepted

Solution code:

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

total_divisors = 0

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

print(total_divisors)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
s = input().split()
a,b,c = int(s[0]),int(s[1]),int(s[2])
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())
n = 0
if a == b :
    if c % a == 0 :
        n = n + 1
else :
    i = list(range(a, b+1))
    for x in i :
        if c % x == 0 :
            n = 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 = [int(x) for x in input().split()]
r = list(range(a,b+1))
count = 0
for i in r:
    if c % i == 0:
        count += 1
    else:
        pass
print(count)

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

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


resolve()

Submission status: Accepted

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

print(len(deta))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def make_divisors(n:int):
    upper_div = []
    lowwer_div = []
    i = 1
    while i*i <= n:
        if n%i == 0:
            lowwer_div.append(i)
            if n//i != i:
                upper_div.append(n//i)
        i+=1
    return lowwer_div + upper_div[::-1]

def main():
    a,b,c = [int(i) for i in input().strip().split()]
    ans = 0
    divs = make_divisors(c)
    
    for d in divs:
        if a <= d  and d <= b:
            ans += 1
    
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
i,j,k=input().split()
count=0
i=int(i)
j=int(j)
k=int(k)
while i<=j:
    if k%i==0:
        count+=1
    i+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
def divisor(n): #約数の列挙
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table
a,b,c=map(int,input().split())
yakusu=divisor(c)
sum=0
for i in yakusu:
    if a<=i and b>=i:
        sum+=1
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

a,b,c= map(int, input().split())
tempc = c
result=0
PF=[]

for i in range(1,c+1):
  if tempc % i == 0:
    PF.append(i)

for j in range(len(PF)):
  if a <= PF[j] and PF[j] <= b:
    result+=1
    
print(result)

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

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 = 0
b = 0
c = 0
count = 0

i = 0
j = 0

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

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

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

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

if __name__=="__main__":
    main()

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())
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 = 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())
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())
x = 0
for y in range(a,b + 1):
    if c % y == 0:
        x = x + 1
print(x)

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

Submission status: Accepted

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

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

if a>b: 
    y=a
    a=b
    b=y

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())
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())
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())
d=0
for i in range(a,b+1,1):
    if c%i==0:
        d=d+1
    else:
        pass

print(d)

Submission status: Accepted

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

print(num)

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

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

Submission status: Accepted

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

a=0

for i in range(x,y+1):
    if z%i==0:
        a+=1
    else:
        pass

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def divisible(x, y):
    return x % y == 0

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

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

print(count)

Submission status: Accepted

Solution code:
a, b, c = list(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:
#３つの整数aa、bb、ccを読み込み、aaから bbまでの整数の中に、
# ccの約数がいくつあるかを求めるプログラム

list = input().split()
count = 0
a = int(list[0]); b = int(list[1]); c = int(list[2])

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:
a,b,c = map(int,input().split())
d = list(range(a,b+1))
x = 0

for i in d:
    if c % i == 0:
        x = x + 1

print(x)

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

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

print(count)