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

Submission status: Accepted

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

import fileinput
import math

def main():
    for line in fileinput.input():
        a, b, c = map(int, line.strip().split())

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

        print(count)

if __name__ == '__main__':
    main()

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

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def getDivisor(a,b,c):
    l = 0
    for i in range(a, b+1):
        if (c % i == 0):
            l += 1
    return l

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

Submission status: Accepted

Solution code:
def main():
    data = []
    n = input().split()
    a = int(n[0])
    b = int(n[1])
    c = int(n[2])
    div = 0

    one_div=(a == b) and c % a == 0 or c % b == 0

    if one_div:
        div = 1

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

    print(div)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(counter)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
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:
count = 0
count = int(count)
a,b,c = map(int,input().split())
while a <= b:
    if c % a == 0 :
        count = count + 1
    a = a + 1       
print('{}'.format(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:
numbers = input().split(" ")
sol_count = 0
for walkaz in range(int(numbers[0]), int(numbers[1])+1):
	if(int(numbers[2])%walkaz == 0):
		sol_count += 1

print(sol_count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a, b, c = map(int, sys.stdin.readline().strip().split())
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
    else:
        continue

print(cnt)

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:
# coding:utf-8
array = map(int, raw_input().split())
cnt = 0
for i in range(array[0],array[1] + 1):
    if array[2] % i == 0:
        cnt += 1
else:
    print cnt

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def string_two_numbers_spliter():
    a, b, c = [int(i) for i in input().split()]
    return a, b, c
 
 
def count_nums_of_divisors_of_c_in_a_and_b(a, b, c):
    count = 0
    for i in range(1, c+1):
        if (c % i == 0):
            if i >= a and i <= b:
                count += 1
    return count
 
 
def main():
    a, b, c = string_two_numbers_spliter()
    print(count_nums_of_divisors_of_c_in_a_and_b(a, b, c))
 
 
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

def main():
    a, b, c = spliter()
    print(count(a, b, c))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
instr = input()
instrSp = instr.split()

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

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

Submission status: Accepted

Solution code:
import sys

a = ""
count = 0
for input in sys.stdin:
    a += (input)
a = a.split()
for i in range(0,len(a)):
    a[i] = int(a[i])
for i in range(a[0],a[1]+1):
    if(a[2] % i == 0):
        count += 1
print count

Submission status: Accepted

Solution code:
import math

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

cnt = 0
for i in range(a, b+1):
    if math.floor(c/i) == math.ceil(c/i):
        cnt = cnt + 1

print(cnt)

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
nums = input()
a,b,c = nums.split(' ')
nd = 0

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

print(nd)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
#Repetitive Processing - How Many Divisors?

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:
def func():
    a,b,c = input().split(" ")
    a = int(a)
    b = int(b)
    c = int(c)
    cnt = 0

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

    print(cnt)

    return 0

if __name__ == "__main__":
    ret = func()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding: utf-8

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

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

print(answer)

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:
#!/usr/bin/python3
# -*- coding: utf-8 -*-

import sys

a, b, c = map(int, sys.stdin.readline().split())

num_div = 0

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

print(num_div)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=list(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:
while True:
    a, b, c = map(int, input().split())
    if a >= 1 and a <= 10000:
        if b >= 1 and b <= 10000:
            if c >= 1 and c <= 10000:
                if a <= b:
                    break
                    
i = 0
for num in range(a, b+1):
    if c%num == 0:
        i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

if __name__ == '__main__':
    a, b, c = map(int, raw_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())
cnt = 0
for i in range(a, b+1):
    if(not(c % i)):
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

def judge(c,n):
    if c%n==0:
        return 1
    else:
        return 0
n=a
result=0
while n<=b:
    result=result+judge(c,n)
    n=n+1

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = 0
lis = [int(x) for x in input().split()]
while lis[0] <= lis[1]:
    if lis[2]%lis[0] == 0:
        count = count+1
    lis[0] = lis[0]+1
print(count)

Submission status: Accepted

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

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

print(k)

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

Submission status: Accepted

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

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

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

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

print(ans)

Submission status: Accepted

Solution code:
def testfunc(start,end,target):
    cnt=0
    for num in range(start,end+1):
        if target % num ==0:
            cnt+=1
    print(cnt)

tmp=list(map(int,input().split()))
testfunc(tmp[0],tmp[1],tmp[2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*- 
### 数値　a b c をスペース区切りで読み込み
### c の約数がa<=b の間にいくつあるかを表示する。

#数値入力・変換
str_in = raw_input()
int_in = map(int, str_in.split())

# a〜bの約数の数を求める
counter = 0
for i in range(int_in[0], int_in[1]+1):
	if int_in[2] % i == 0:
		counter = counter + 1
		
# 個数を表示する。
print(counter)

Submission status: Accepted

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

print(result)

Submission status: Accepted

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

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

a, b, c = map(int, input().split())
#print(str(a) + str(b) + str(c))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
temp = raw_input()
temp_list = temp.split()
a = int(temp_list[0])
b = int(temp_list[1])
c = int(temp_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())
count = 0;
while a <= b:
    if (c % a) == 0:
        count += 1
    a += 1

print(count)

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

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

print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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
	else:
		n=n
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

yakusuu = []

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

    if (c % i == 0):
 
        yakusuu.append(i)

print(len(yakusuu))

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:
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
while a<=b:
	if c%a==0:
		n+=1
		a+=1
	else:
		a+=1
print(n)

Submission status: Accepted

Solution code:
#! python3
# how_many_divisors.py

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

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

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=input().split()
count=0
a=int(a)
b=int(b)
c=int(c)
while a<=b:
    if c%a==0:
        count+=1
    a+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print (cnt)

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(s) for s 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 numinput():
    a = input().split()
    for i in range(len(a)):
        a[i] = int(a[i])
    return a

def main():
    a = numinput()
    count = 0
    for d in range(a[0], a[1] + 1):
        if a[2] % d == 0:
            count += 1
    print(count)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

print(len(d))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
	a,b,c=map(int,sys.stdin.read().split())
	cnt=0
	for i in range(a,b+1):
		if c%i==0:
			cnt+=1
	print cnt

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = list(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 x in range(a, b+1):
    if c%x == 0:
        count += 1
print(str(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())
d=0
for i in range(a,b+1):
  if c%i==0: d+=1
print(d)

Submission status: Accepted

Solution code:
def list_maker(num):
    num_list = []
    for i in range(1, num + 1):
        num_list.append(i)
    return num_list


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

num_list = list_maker(c)
divisor_list = []

for i in num_list:
    if c % i == 0:
        if i >= a and i <= b:
            divisor_list.append(i)

print(len(divisor_list))

Submission status: Accepted

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

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

print sum

Submission status: Accepted

Solution code:
# How Many Divisors?

n = [int(i) for i in input().rstrip().split()]
a = n[0]
b = n[1]
c = n[2]

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

print(divisorsCount)

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())
l1=[]
l2=[]
cnt=0
for i in range(a,b+1):
    l2.append(i)
for i in range(1,c+1):
    if c%i==0:
        if i in l2:
            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:
def main():
    inp = input()
    x, y, z = tuple(map(int, inp.split()))
    count = 0
    for i in range(x, y + 1):
        count += 1 if z % i == 0 else 0
    print(count)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(line):
    a = line[0]
    b = line[1]
    c = line[2]
    c_divisors=[]
    count=0
    for i in range(1,c+1):
        if c%i==0:
            c_divisors.append(i)
    
    for x in range(a,b+1):
        if x in c_divisors:
            count+=1
    print(count)



    
def answer():
    line = list(map(int,input().split()))
    solve(line)

if __name__ =='__main__':
    answer()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

(a, b, c) = [int(i) for i in sys.stdin.readline().split(' ')]

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

print(divisorCount)

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 0
j = 0

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

Submission status: Accepted

Solution code:


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

def divisor(c):
    i = 1
    table = []
    while i * i <= c:
        if c%i == 0:
            table.append(i)
            table.append(c//i)
        i += 1
    table = list(set(table))
    return table
    
x=divisor(c)
x=sorted(x)


x=[i for i in x if a <= i < b+1]
print(len(x))

Submission status: Accepted

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

Submission status: Accepted

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

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

a = len(x)
print(a)

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

def divisor(c): 
    i = 1
    table = []
    while i * i <= c:
        if c%i == 0:
            table.append(i)
            table.append(c//i)
        i += 1
    table = list(set(table))
    return table
    
x=divisor(c)
x=sorted(x)

x=[i for i in x if a<=i<b+1]
print(len(x))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0 #約数の個数

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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)