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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(divisor)

Submission status: Accepted

Solution code:
import math
import copy
from copy import deepcopy
import sys
import fractions
# import numpy as np
from functools import reduce
# import statistics
import heapq
import collections
import itertools
sys.setrecursionlimit(100001)

# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)

# ===FUNCTION===

def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList


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

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

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8
s = list(map(int,input().split()))
ans = 0
for i in range(s[0],s[1]+1):
    if s[2]%i==0:
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 2020-03-18
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())
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())
ya_count = 0

for ya in range(a,b+1):
    if c%ya == 0:
        ya_count+=1
print(ya_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())
n = 0
while a <= b:
    if c % a == 0:
        n += 1
    a += 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())
l = []
for i in range(a,b+1):
    if c % i == 0:
        l.append(i)
    
print(len(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


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

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

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

Submission status: Accepted

Solution code:
ans = 0
a, b, c = [int(n) for n in input().split()]
for n in range(a, b+1):
    if (c/n).is_integer():
        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())
counter = []
for i in range(a, b+1):
    counter.append(c%i==0)
print(sum(counter))

Submission status: Accepted

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

Submission status: Accepted

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

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

print("{}".format(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())
num=0
for i in range(a,b+1):
    if c%i==0:
        num+=1
print(num)

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

print(ans)

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

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:
# 約数の数

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

# initialization
count = 0

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

print(count)

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_value = input()

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

divisors_counter = 0

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

print(divisors_counter)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

    divisors.sort()
  return divisors

a, b ,c = map(int, input().split())
divisors = make_divisors(c)
ans = []
for i in divisors:
  if  a <= i <= b:
    ans.append(i)
print(len(ans))

Submission status: Accepted

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

x = 0
d = a

while True:
    if c%d == 0:
        x += 1
    d += 1
    if d > b:
        break

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

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

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 = counter + 1

print(counter)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3.4.3

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

    # divisors.sort()
    return divisors
  
  
def main():
  a, b, c = map(int, input().split(' '))
  
  divisors = make_divisors(c)
  count = 0
  
  for i in range(a, b+1):
    if i in divisors:
      count+=1

  print(count)


if __name__ == "__main__":
  main()

Submission status: Accepted

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

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

for n in range(a,b+1):
    if n in x:
        ans.append(n)

print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input()
a,b,c = list(map(int, l.split()))
num = 0
B = b + 1
for i in range(a, B):
    M = c%i
    if M == 0:
        num = num + 1
    
print(f"{num}")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

res = 0

if a > b:
    a, b = b, a

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

print(res)

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

a, b, c = list(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:
def count_divisor(a, b, c):
    count = 0
    value = a
    while value <= b:
        if c % value == 0:
            count += 1
        value += 1
    return count


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

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

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

print(count)

Submission status: Accepted

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

#tmp= int(input())
tmp = input().split()
a,b,c = list(map(lambda a: int(a), tmp))

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

print(tmp)

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

if(a == b and b == c):
    print(1)

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

target = 0

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

print(target)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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
input = sys.stdin.readline

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

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

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

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

Submission status: Accepted

Solution code:
#input
a,b,c=map(int,input().split())
#a wo hensuu de kiroku
i=a
ans=0
#loop
while i<=b:
    #waretara kotae no hennsuu ni 1 wo kuwaeru
    if c%i==0:
        ans+=1
    i+=1

print(ans)

Submission status: Accepted

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

ans = 0
n = a

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

print(ans)

Submission status: Accepted

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

    divisors.sort()
    return divisors
a, b, c = map(int, input().split())
div = make_divisors(c)
print(len([1 for d in div if a <= d <= b]))

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = 0

data_list = list(map(int, input().split()))

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

print(count)

Submission status: Accepted

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

print(str(count))

Submission status: Accepted

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

a = int(l[0])
b = int(l[1])
c = int(l[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())
yaku=0
for i in range(a,b+1):
    if(c%i==0):
        yaku+=1

print(yaku)

Submission status: Accepted

Solution code:
import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

ans = 0
A = [int(i) for i in readline().split()]
for i in range(A[0], A[1] + 1):
    if A[-1] % i == 0:
        ans += 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys
line = sys.stdin.readline().split(' ')
a = int(line[0])
b = int(line[1])
c = int(line[2])
n_divisors = 0
for i in range(a, b+1):
  if c % i == 0:
    n_divisors += 1
print n_divisors

Submission status: Accepted

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(divisors)

Submission status: Accepted

Solution code:
a,b,c=(int(x) for x in input().split())
l=[]
for i in range(1,int(c**0.5)+1):
  if c%i==0:
    l.append(i)
    if i!=c//i:
      l.append(c//i)
count=0
for j in range(len(l)):
  if a<=l[j]<=b:
    count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i)

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

bma = b - a
result = 0

for i in range(bma+1):
    if c % a == 0:
        result+=1
    a+=1

print(result)

Submission status: Accepted

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

x = a
y = 0

while x <= b:
    if c % x == 0:
        y += 1
        x += 1
    else:
        x += 1

print(y)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

count = 0
for j in range(0, len(x)):
    if a <= x[j] and x[j] <= b:
        count = count + 1

print(count)

Submission status: Accepted

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

i = a
count=0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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)