Problem:
 Score : 100 points    Problem Statement How many multiples of d are there among the integers between L and R (inclusive)?      Constraints  All values in input are integers.  1 \leq L \leq R \leq 100  1 \leq d \leq 100         Input Input is given from Standard Input in the following format:  L  R  d       Output Print the number of multiples of d among the integers between L and R (inclusive).        Sample Input 1 5 10 2      Sample Output 1 3   Among the integers between 5 and 10 , there are three multiples of 2 : 6 , 8 , and 10 .        Sample Input 2 6 20 7      Sample Output 2 2   Among the integers between 6 and 20 , there are two multiples of 7 : 7 and 14 .        Sample Input 3 1 100 1      Sample Output 3 100

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

Solution (Python):
L,R,d = map(int,input().split())
ans = 0
for i in range(L,R+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
(l,r,d) = map(int,input().split())


if l%d!=0:
	l = l + (d-l%d)
if r-l == 0:
	if (l%d==0):
		print(1)
	else:
		print(0)
elif l < r:
	print(r//d-l//d+1)
else:
	print(0)

Solution (Python):
l,r,d = map(int,input().split())

a = (l-1) // d
b = r // d

s = b - a

print(s)

Solution (Python):

def main():
    L, R, d = map(int, input().split())
    if L%d == 0:
        print(R//d - L//d+1)
    else:
        print(R//d - L//d)
    return
if __name__ == '__main__':
    main()

Solution (Python):
def resolve():
    L,R,d = map(int,input().split())
    if L % d == 0:
        ans = R//d - L//d + 1
    else:
        ans = R//d - L//d
    print(ans)
resolve()

Solution (Python):
L,R,d=map(int,input().split())

if (L%d==0):
  a=(R//d)-(L//d)+1
else:
  a=(R//d)-(L//d)

print(a)

Solution (Python):
l, r, d = map(int, input().split())
count = 0
for i in range(200):
    if (l <= i * d and i * d <= r):
        count += 1
print(count)

Solution (Python):
H,W,K=map(int,input().split())
a=int((H-1)/K)
b=int(W/K)
ans=b-a
print(ans)

Solution (Python):
L,R,d = map(int, input().split())
cnt = 0

for i in range(L,R+1):
    if i%d == 0:
        cnt +=1
print(cnt)

Solution (Python):
l,r,d = map(int,input().split())
print(r//d - (l-1)//d)

Solution (Python):
L,R,d=list(map(int,input().split()))
out=0
minn=R+1
for i in range(L,R+1):
    if i%d==0:
        minn=i
        break
for i in range(minn,R+1,d):
    out+=1
print(out)

Solution (Python):
L, R, d = map(int, input().split())
count = 0

for i in range(L, R + 1):
    if i % d == 0:
        count += 1

print(str(count))

Solution (Python):
L, R, D = map(int, input().split())
def Main(L, R, D):
    ans = 0
    for i in range(L, R+1):
        if i % D == 0:
            ans += 1
    return ans

print(Main(L, R, D))

Solution (Python):
l, r, d = map(int,input().split())

ans = 0

temp = d

while temp <= 100:
    if (l <= temp) and (temp <= r):
        ans += 1

    temp += d

print(ans)

Solution (Python):
def main():
    l,r,d = map(int,input().split())
    total = 0
    for i in range(l,r+1):
        if i%d == 0:
            total += 1

    print(total)
    

main()

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        for line in sys.stdin:
            lines.append(line.strip())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (l, r, d) = [int(e) for e in lines[0].split(' ')]

    return (l, r, d)


def solve(l, r, d):

    cnt = 0    
    for i in range(l, r+1):
        if i % d == 0:
            cnt = cnt + 1

    return cnt
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Solution (Python):


x = input().split(' ')
l = int(x[0])
r = int(x[1])
d = int(x[2])

s = 0
for i in range(l, r + 1):
    if i % d == 0:
        s += 1

print(s)

Solution (Python):
L, R, m = map(int, input().split())

count = 0
for x in range(L, R+1):
    if x % m == 0:
        count += 1
print(count)

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

Solution (Python):
import math
a,b,wari = map(int, input().split(" "))
if a % wari == 0 and b % wari == 0:
  print(b //wari - a // wari + 1)
else:
  print(b //wari - a // wari)

Solution (Python):
L, R, d = map(int, input().split())
ans = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    ans += 1
print(ans)

Solution (Python):
L, R, d = [int(digit) for digit in input().split()]
c = 0

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

print(c)

Solution (Python):
l, r, d = list(map(int, input().split()))

print(len([i for i in range(l, r + 1) if i % d == 0]))

Solution (Python):
L,R,d = map(int,input().split())
count = 0
for i in range(L,R+1):
  if i % d == 0:
    count += 1
print(count)

Solution (Python):
import sys 

readline = sys.stdin.readline

LRd = readline().split()
L = int(LRd[0])
R = int(LRd[1])
d = int(LRd[2])

counter = 0
for i in range(L, R+1):
    if i % d == 0:
        counter += 1

print(counter)

Solution (Python):
l,r,d = map(int,input().split())
total = 0
i = 1
while True:
  num = d*i
  if num >= l:
    break
  else:
    i+=1

while True:
  num = d*i
  if num <= r:
    total += 1
    i+=1
  else:
    break
print(total)

Solution (Python):

L, R, d = map(int, input().split())

cnt = 0

for i in range(L,R+1):
  if i%d==0:
    cnt +=1
    
print(cnt)

Solution (Python):
L, R, d = map(int, input().split())

res = 0
for i in range(L, R + 1):
    if i % d == 0:
        res += 1
print(res)

Solution (Python):
L, R, d = map(int, input().split())

long = R - L

count = 0

for i in range(long + 1):
    value = i + L
    if value % d == 0:
        count += 1

print(count)

Solution (Python):
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

L, R, d = input_int()

count=0
for i in range(L,R+1):
    if i%d==0:
        count+=1

print(count)

Solution (Python):

 
L, R, d = map(int, input().split())
 
if L%d==0:
    print(int(R/d)-int(L/d)+1)
else:
    print(int(R/d)-int(L/d))

Solution (Python):
l,r,d = map(int, input().split())

j = 0
for i in range(l,r+1):
    if i % d == 0:
        j += 1

print(j)

Solution (Python):
l,r,d = [int(x) for x in input().split()]

print(r//d - l//d + (l%d==0))

Solution (Python):
l,r,d= list(map(int, input().strip().split()))
if r%d==0:
    s=r//d
else:
    s=r//d
if l%d==0:
    t=l//d
else:
    t=l//d+1
    
print(s-t+1)

Solution (Python):
l, r, d = map(int,input().split())
ans = 0
for i in range(l,r+1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
L,R,d=map(int,input().split())
print((R//d)-((L-1)//d))

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

Solution (Python):
L, R, d = map(int, input().split())
count = 0
i = 1
while True:
    if d * i > R:
        break
    if d * i >= L:
        count += 1
    i += 1
print(count)

Solution (Python):
l, r, d = [int(_) for _ in input().split()]
ans = 0

for i in range(l, r+1):
    if i % d == 0:
        ans += 1

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
l,r,d=map(int,input().split())
ans = 0
for i in range(l,r+1):
    if i%d==0:
        ans+=1
print(ans)

Solution (Python):
L, R, d = [int(n) for n in input().split(' ')]

num = [n for n in range(L, R+1) if n%d==0]

print(len(num))

Solution (Python):
L, R, d = map(int, input().split())
print(int(R / d) - int((L - 1) / d))

Solution (Python):
L, R, d = map(int, input().split())

count = 0
for i in range(1, 101):
    if L <= d*i and d*i <= R:
        count += 1
    if d*i > R:
        break
print(count)

Solution (Python):
l,r,n = map(int, input().split())
L = l//n if l%n!=0 else (l//n)-1
R = r//n
print(R-L)

Solution (Python):
l,r,d = map(int,input().split())
print((r)//d-(l-1)//d)

Solution (Python):
L,R,d=map(int,input().split())
count = 0
for num in range(101):
  if(d*num==R):
    count += 1
    break
  if(d*num>R):
    break
  if(d*num>=L):
    count += 1
print(count)

Solution (Python):


import sys

def main():
    input = sys.stdin.readline
    l,r,d = map(int, input().split())
    l_count = l // d
    r_count = r // d
    result = 0
    if l % d == 0:
        print(r_count - l_count + 1)
    else:
        print(r_count - l_count)

    return


if __name__ == '__main__':
    main()

Solution (Python):
l,r,d=map(int,input('').split(' '))
s=0
for i in range(l,r+1):
    if i%d==0:
        s=s+1

print(s)

Solution (Python):
l,r,d=[int(i) for i in input().split()]

count=0
for i in range(l,r+1):
    if i%d==0:
        count+=1

print(count)

Solution (Python):
def main():
    l,r,d = map(int,input().split())
    ls = [i for i in range(l,r+1)]
    ans = 0
    for i in range(len(ls)):
        if ls[i]%d==0:
            ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
L, R, d = [int(v) for v in input().strip().split(" ")]



num = 0
for n in range(L, R+1):
    if n % d == 0:
        num += 1

print(num)

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

Solution (Python):
L,R,d = map(int, input().split())
count = 0
for i in range(L,R+1):
	if i % d == 0:
  		count = count + 1
print(count)

Solution (Python):
import sys
L, R, d = map(int, sys.stdin.readline().strip().split())

ans = (R-L)//d
if R%d == 0:
    ans += 1
elif L%d == 0:
    ans += 1
print(ans)

Solution (Python):
l, r, d = list( map( int, input().split() ) )

print(r//d - (l-1)//d)

Solution (Python):
l,r,d=map(int,input().split())
x=l//d
y=r//d
if l%d==0:
    x-=1
print(y-x)

Solution (Python):
def main():
    l,r,d=map(int,input().split())
    i=1
    j=d
    cnt=0
    while j <= r:
        if j >= l: cnt +=1
        i+=1
        j=d*i
    print(cnt)

    return

if __name__=='__main__':
    main()

Solution (Python):
l, r, d = map(int, input().split())
count = 0
for i in range(l, r+1):
  if i % d == 0:
    count += 1
print(count)

Solution (Python):
L,R,d = map(int,input().split())
ans=0
for i in range(L,R+1):
  if (i%d == 0):
    ans+=1
    
print(ans)

Solution (Python):
L,R,d = map(int,input().split())
ans = R//d - L//d
if L%d==0:
  ans+=1
print(ans)

Solution (Python):
l,r,d = map(int,input().split())

a = l // d 
b = r // d

if l % d == 0:
    print(b-a+1)
else:
    print(b-a)

Solution (Python):
L,R,d = map(int, input().split())

count = 0
for i in range(L, R+1):
    if i % d == 0:
        count += 1
        
print(count)

Solution (Python):


I1 = input().split()

l = int(I1[0])
r = int(I1[1])
d = int(I1[2])

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

print(i)

Solution (Python):
l, r, d = map(int, input().split())

r = r // d
if l % d == 0: 
  l = l // d 
  print(r-l+1)
else:
  l = l // d 
  print(r-l)

Solution (Python):
L, R, d = map(int, input().split())
ans = 0
for i in range(L, R + 1):
    if (i % d == 0):
        ans += 1

print(ans)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R+1, 1):
  if i % d == 0:
    count += 1

print(count)

Solution (Python):
L, R, d = map(int, input().split())

memo = [0]*(R+1)

i = 1
while d*i <= R:
  memo[d*i] = 1
  i += 1
  
print(sum(memo[L:]))

Solution (Python):
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
import copy


MOD = 10 ** 9 + 7




l, r, d = map(int, input().split())
a = l + (d - l%d) if l%d > 0 else l
b = r - r%d

print((b-a)//d + 1)

Solution (Python):
L, R, d = map(int, input().split())

print((R//d + 1) - ((L-1)//d+1))

Solution (Python):
L,R,d = map(int, input().split())
X = L//d
Y = R//d
if L%d == 0 and R%d == 0:
  if L>R:
    print(X-Y+1)
  else:
    print(Y-X+1)
else:
  if L >R:
    print(X-Y)
  else:
    print(Y-X)

Solution (Python):
l, r, d = map(int, input().split())

up = r // d
down = l // d
down_sur = l % d

if down_sur == 0:
    print(up - down + 1)
else:
    print(up -down)

Solution (Python):
import sys
input = sys.stdin.readline

l,r,d = map(int,input().split())
cnt=0
for i in range(l,r+1):
    if i%d==0:
        cnt+=1
print(cnt)

Solution (Python):
L, R, d = map(int, input().split(' '))
a = 0
for i in range(L, R+1):
    if i%d == 0:
        a += 1

print(a)

Solution (Python):
import math

L,R,d = map(int, input().split())

Li = math.ceil(L/d)
Ri = int(R/d)

ans = Ri-Li+1

print(ans)

Solution (Python):
L,R,d = map(int,input().split())
count= 0
for i in range(L,R+1):
    if i%d==0:
        count+=1
print(count)

Solution (Python):
L, R, d = map(int, input().split())

count = 0
for i in range(L, R+1):
  if i % d == 0:
    count += 1
    
print(count)

Solution (Python):

L,R,d = map(int,input().split())
print(R//d - (L-1)//d)

Solution (Python):
l, r, d = map(int, input().split())
if l%d==0:
    m=l//d
else:
    m=l//d + 1
n = r//d
 
print(n-m+1)

Solution (Python):
l,r,d=map(int,input().split())
answer=r//d-l//d
if l%d==0:
    answer+=1
print(answer)

Solution (Python):
l,r,d = map(int,input().split())
an=0
for i in range(l,r+1):
    if i%d ==0:
        an+=1
print(an)

Solution (Python):
l,r,d=map(int, input().split())
if d == 1:
  print(r-d+1)
else:
  print(r//d - (l+d-1)//d +1)

Solution (Python):
l, r, d = map(int, input().split())
l1 = l//d
l2 = l%d
r1 = r//d
if l2 == 0:
    r1 += 1
ans = r1 - l1
print(ans)

Solution (Python):
L, R, d = map(int, input().split())

ans = 0

for i in range(L, R + 1, 1):
	if i % d == 0:
		ans += 1
print(ans)

Solution (Python):
L , R , d = map(int, input().split())

ans = 0
for i in range(L,R+1):
    if i % d == 0:
        ans+=1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0

for i in range(l, r+1):
  if i%d == 0:
    cnt += 1
    
print(cnt)

Solution (Python):
def main():
    l,r,d = map(int, input().split())

    a = l//d
    b = r//d
    if (l%d==0):
        ans = b-a+1
    else:
        ans = b-a
    
    print(ans)

main()

Solution (Python):
def main():
    l, r, d=map(int, input().split())
    c=0
    for i in range(l,r+1):
        if not i%d:
            c+=1
    print(c)
    


if __name__=='__main__':
    main()

Solution (Python):
def main():
    l, r, d = map(int, input().split())
    a = r // d
    b = (l - 1) // d
    print(a - b)
            
    
if __name__ == '__main__':
    main()

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

d = int(a/c)

e = int(b/c)

z = 0

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

Solution (Python):
L, R, d = [int(x) for x in input().split()]
compteur = 0

for i in range(L, R+1):
  if i%d == 0:
    compteur += 1
   
print(compteur)

Solution (Python):
L,R,d = map(int,input().split())

count = 0
for i in range(L,R+1):
    if i % d == 0:
        count+= 1

print(count)

Solution (Python):
l, r, d = map(int, input().split())
a = r // d
b = (l - 1) // d
print(a - b)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0
for i in range(1, 101):
    if l<=i and r >= i and i % d ==0:
        ans +=1
print(ans)

Solution (Python):
L,R,d = map(int,input().split())

print(R//d - (L-1)//d)

Solution (Python):
l,r,d = list(map(int, input().split()))
count = 0

for i in range(l,r+1):
  if i%d == 0:
    count += 1
  else:
    count += 0
print(count)

Solution (Python):
L,R,d = map(int,input().split())
count= 0
for i in range(L,R+1):
    if i%d==0:
        count+=1
print(count)

Solution (Python):
l,r,d=map(int,input().split())
a=r//d-(l-1)//d

print(a)

Solution (Python):
L, R ,d = map(int,input().split())
q_L =  L // d
q_R =  R// d
answer = q_R -q_L
if L%d == 0:
    answer += 1
print(answer)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R+1):
    if i % d == 0:
        count += 1
        
print(count)

Solution (Python):
L, R, d = (int(x) for x in input().split())
a = L // d
b = R // d
if L % d == 0:
    b += 1
print(b - a)

Solution (Python):
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math

l,r,d=INPUT()
count=0
i=d*int(math.ceil(l/d))
while(i<=r):
    if i%d==0:
        count+=1
    i+=d
print(count)

Solution (Python):
L,R,d = map(int, input().split())

s_parts = L // d

if L % d == 0:
  s = s_parts
  
else:
  s = s_parts + 1
  
b = R // d

print(b - s + 1)

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


L, R, d = map(int, input().split())

res = 0
for i in range(L, R+1):
    if i % d == 0:
        res += 1
print(res)

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

Solution (Python):
L,R,N = map(int,input().split())
Ln = (L-1)//N
Rn = R//N
print(Rn-Ln)

Solution (Python):

l, r, d = map(int, input().split())
ans = 0
for i in range(l,r+1):
     if i%d == 0:
         ans += 1
print(ans)

Solution (Python):
L, R, d=map(int, input().split())
ans = 0
for i in range(L, R+1, 1):
  if i % d == 0:
      ans += 1
        
print(ans)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):
import sys
import math

def input():
    return sys.stdin.readline().rstrip()


def main():
    L,R,d =map(int,input().split())

    print(R//d - (L-1)//d)


if __name__ == "__main__":
    main()

Solution (Python):
L,R,d = map(int,input().split())
count = 0
for i in range(L,R+1):
    if i%d==0:
        count+=1

print(count)

Solution (Python):
import numpy as np
l, r, d = map(int, input().split()) 

arr = np.arange(l,r+1)
ans = 0
for i in range(r-l+1):
    if arr[i]%d == 0:
        ans = ans +1
print(ans)

Solution (Python):
L,R,d = map(int,input().split())
ans = R//d - L//d
if L%d == 0:
  ans += 1
print(ans)

Solution (Python):
import sys
import numpy as np


L,R,d = list(map(int, input().split()))

o = 0
for i in range(L, R + 1):
    if i % d == 0:
        o += 1

print(o)

Solution (Python):
l, r, d = map(int, input().split())
print(r // d - (l-1) // d)

Solution (Python):
l, r, d = map(int, input().split())
res = 0
for i in range(l, r+1):
  if i%d == 0: res += 1

print(res)

Solution (Python):
l,r,d=map(int,input().split())
print(r//d-(l-1)//d)

Solution (Python):

L,R,d = map(int, input().split())
counter = 0
for i in range(L,R+1):
    if i % d == 0:
        counter += 1
print(counter)

Solution (Python):
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]

L, R, D = rrm()
L = (L/D+int(L%D!=0))*D
R = R/D*D
n = R/D-L/D+1
print(n)

Solution (Python):
L,R,d = list(map(int, input().split()))
ans = 0
n = L
while(n<=R):
  if(n%d==0):
    ans += 1
  n += 1
print(ans)

Solution (Python):
l,r,d = map(int,input().split())

cnt = 0
for i in range(l,r+1):
    if i % d == 0:
        cnt += 1

print(cnt)

Solution (Python):

l, r, d = list(map(int, input().split()))
diff = r-l
ans = diff//d
if r%d==0:
	ans+=1
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0
for i in range(r - l + 1):
    if (l + i) % d == 0:
        cnt += 1
print(cnt)

Solution (Python):
L, R, d = map(int, input().split())
counter = 0
for i in range(L, R + 1):
    if i % d == 0:
        counter += 1

print(counter)

Solution (Python):
L, R, d = map(int, input().split())

ans = 0
for i in range(L,R+1):
    if i%d == 0:
        ans += 1

print(ans)

Solution (Python):
L, R, d = list(map(int, input().split()))
print(int(R/d) - int((L - 1)/d))

Solution (Python):
l, r, d = map(int, input().split())
res = 0
if(l %d == 0):
    start = l
else:
    start = l + d - l%d
while(start <=r):
    start+=d
    res +=1
print(res)

Solution (Python):
l,r,d = list(map(int,input().split()))
print(r//d - (l-1)//d)

Solution (Python):
L,R,d = map(int, input().split())

if L%d==0:
    print(R//d-L//d+1)
else:
    print(R//d-L//d)

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

print(result)

Solution (Python):
l,r,d = map(int,input().split())

ans = 0

for i in range(r-l+1):
    if (l+i) % d == 0:
        ans += 1
        
print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

l, r, d = map(int, readline().split())

if l % d == 0:
    ans = r // d - l // d + 1
else:
    ans = r // d - l // d
print(ans)

Solution (Python):
L,R,d = map(int, input().split())
count = 0

for i in range(L,R+1):
    if i % d == 0:
       count += 1

print(count)

Solution (Python):
L, R, d = map(int, input().split())

count = 0

for i in range(L,R+1):
    if i % d == 0:
        count += 1
    i += 1
    
print(count)

Solution (Python):
start,end,num=input().split()

li=[int (i) for i in range(int(start),int(end)+1) if int(i)%int(num)==0]
print(len(li))

Solution (Python):
s = list(map(int, input().split())) 
L = s[0]
R = s[1]
d = s[2]

count = 0
for i in range(L,R+1):
  if i%d == 0:
    count = count + 1

print(count)

Solution (Python):
L, R,d = map(int,input().split())
s=0
for i in range(L,R+1):
    if i%d==0:
        s+=1
print(s)

Solution (Python):
l, r, d = map(int, input().split())
ans = 0

for i in range(l, r + 1):
    if i % d == 0:
        ans += 1

print(ans)

Solution (Python):
L, R, d = map(int, input().split())
cnt = 0
for i in range(L, R+1):
    if i%d == 0:
        cnt += 1
print(cnt)

Solution (Python):
nn=input("").split(" ")
l=int(nn[0])
r=int(nn[1])
d=int(nn[2])
i=l
s=0
while(i<r+1):
    if (i%d==0):
        s+=1
    


    i+=1
print(s)

Solution (Python):
L, R, d = [int(s) for s in input().split()]

print(R//d - (L-1)//d)

Solution (Python):
import sys
import numpy as np
import math
import collections
import copy
from collections import deque 
from functools import reduce
from itertools import product



L, R, d = map(int, input().split())
if L % d == 0:
    print(R//d-L//d+1)
else:
    print(R//d-L//d)

Solution (Python):
l,r,d=map(int,input().split())
ans=0
for i in range(l,r+1):
  if i%d==0:
    ans+=1
print(ans)

Solution (Python):
L, R, d = list(map(int, input().split(' ')))
count = 0
for i in range(L, R+1):
	if i % d == 0:
		count += 1

print(count)

Solution (Python):
import math
L, R, d = map(int,input().split())

if L%d==0:
    print(R//d - L//d+1)
else:
    print(R//d - L//d)

Solution (Python):
L,R,d = map(int, input().split())
if(L%d == 0):
    print((R//d)-(L//d)+1)
else:
    print((R//d)-(L//d))

Solution (Python):
l,r,k=map(int,input().split())
ans=0
for i in range(l,r+1):
  if i%k==0:
    ans+=1
print(ans)

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

        
if __name__ == '__main__':
    main()

Solution (Python):
L, R, d = map(int, input().split())
if d == 1:
    print(R-L+1)
else:
    if R == L:
        if R % d == 0:
            print(1)
        else:
            print(0)
    else:
        print(R//d - L//d)

Solution (Python):
L,R,d=map(int,input().split())
if L%d==0 :
    ans=R//d-L//d+1
else :
    ans=R//d-L//d

print(ans)

Solution (Python):
L, R, d = map(int, input().split())

if (L%d) == 0:
    print((R//d)-(L//d)+1)
else:
    print((R//d)-(L//d))

Solution (Python):
L, R, d = map(int, input().split())
print(R//d-L//d+(L%d==0))

Solution (Python):

import math

def main():
    l, r, d = map(int, input().split())
    l = math.ceil(l / d)
    r = math.floor(r / d)
    ret = r - l + 1

    print(ret)

if __name__ == '__main__':
    main()

Solution (Python):

"""エイシング プログラミング コンテスト 2020: A - Number of Multiples
https://atcoder.jp/contests/aising2020/tasks/aising2020_a
"""


def main():
    L, R, d = list(map(int, input().split()))
    ans = 0
    for n in range(L, R + 1):
        if n % d == 0:
            ans += 1
    print('{}'.format(ans))


if __name__ == '__main__':
    main()

Solution (Python):
l,r,d=map(int,input().split())

print(r//d - (l-1)//d)

Solution (Python):
L, R, d = map(int, input().split())
r = 0
for i in range(L, R+1):
    if i % d == 0:
        r += 1
print(r)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
for i in range(R+1):
    if(i<L):
        continue
    if(i%d==0):
        count += 1
print(count)

Solution (Python):
L, R, d = list(map(int, input().split()))

count = 0

for i in range(L, R+1):
    if( i % d == 0):
        count += 1

print(count)

Solution (Python):

import sys
sys.setrecursionlimit(500005)


def solve(L: int, R: int, d: int):
    counter = 0
    for i in range(L,R+1):
        if (i % d == 0):
            counter += 1
    print(counter)




def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    L = int(next(tokens))  
    R = int(next(tokens))  
    d = int(next(tokens))  
    solve(L, R, d)

if __name__ == '__main__':
    main()

Solution (Python):
l, r, d = map(int, input().split())

ans = int(r/d)-int((l-1)/d)
print(ans)

Solution (Python):
a = input().split()
l = int(a[0])
h = int(a[1])
n = int(a[2])
i = 0
while(h>=l):
  if(l%n==0):
    i+=1
  l+=1
print(i)

Solution (Python):
L, R, d = list(map(int, input().split()))

ans = 0
for i in range(L, R + 1):
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
l,r,d=map(int, input().split())
num1=l//d
if l%d!=0:
    num1=num1+1
num2=r//d
print((num2-num1)+1)

Solution (Python):
L, R, d = map(int, input().split())

count = 0

for i in range(L, R+1):
  if i % d == 0:
    count += 1
    
print(count)

Solution (Python):
l, r, d =  map(int, input().split())
ans = 0

multiple1 = r // d
multiple2 = l // d
ans = multiple1 - multiple2
if l % d == 0:
    ans += 1

print(ans)

Solution (Python):
l,r,d=map(int,input().split())

if l%d==0:
  l-=1
print(r//d-l//d)

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r+1):
    if i % d == 0:
        cnt += 1
print(cnt)

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

Solution (Python):
l, r, d = [int(x) for x in input().split()]
count = 0
for i in range(l, r+1):
  if not i%d:
    count += 1
print(count)

Solution (Python):
L, R, d = map(int, input().split())
count = 0
for i in range(L, R+1):
  if i%d == 0:
    count += 1
print(count)

Solution (Python):













from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
import numpy as np
import random
import bisect
import copy



MOD = 1000000007
INF = float('inf')
alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]

def keta(kazu): 
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers): 
    return reduce(math.gcd, numbers)

def combination(m,n): 
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
    return K * x

def fact(n): 
    arr = {}
    temp = n
    for i in range(2,int(n**0.5)+1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr[i] = cnt
    if temp != 1:
        arr[temp] = 1
    if arr == {}:
        arr[n] = 1
    return arr


    
def main():
    l, r, d = [int(x) for x in stdin.readline().rstrip().split()]
    print(r//d - (l-1)//d)
main()

Solution (Python):
L, R, D = map(int, input().split())
cnt = 0
for i in range(L, R+1):
    if i % D == 0:
        cnt += 1


print(cnt)

Solution (Python):

import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

l,r,d = map(int, input().split())

ll = l//d
rr = r//d

ans = rr-ll

if l%d==0:
    ans+=1


print(ans)

Solution (Python):
l,r,d=map(int,input().split())
if l%d!=0:
  print(r//d-l//d)
else:
  print((r//d-l//d)+1)

Solution (Python):
def NumberOfMultiples():

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

    count = 0

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

if __name__ == '__main__':
    NumberOfMultiples()

Solution (Python):
L,R,d = map(int, input().split())
count = 0

for i in range(L,R+1):
    if i % d == 0:
        count = count + 1

print(count)

Solution (Python):
L, R, d = map(int, input().split())

result = 0
for i in range(L, R+1):
    result += i%d==0
print(result)

Solution (Python):
l,r,d=map(int,input().split())

left=(-(-l//d))
right=r//d
print(right-left+1)

Solution (Python):
def main():
    l,r,d = [int(v) for v in input().split()]

    res = [v for v in range(l, r+1) if v % d == 0]
    print(len(res))

main()

Solution (Python):
def main():

    L, R, d = map(int, input().split())
    ans = 0
    for i in range(L, R + 1):
        if i % d == 0:
            ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
l,r,d=map(int,input().split())

if l%d==0:
    s=(l//d)-1
else:
    s=l//d
print((r//d)-s)

Solution (Python):
from math import ceil

l, r, d = map(int, input().split())

print(r // d - ceil(l / d) + 1)

Solution (Python):
L,R,d = map(int,input().split())
ans = 0
for i in range(L,R+1):
    if i%d == 0:
        ans += 1

print(ans)

Solution (Python):
l,r,d = map(int, open(0).read().split())

print(r//d -(0--l//d) + 1)

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

Solution (Python):
Line = [int(s) for s in input().split()]

L,R,d = Line[0],Line[1],Line[2]

ans = 0

for i in range(L,R+1):
    if i % d == 0:
        ans += 1
        
print(ans)

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    L, R, d = map(int, input().split())
    ans = 0
    for i in range(L, R+1):
        if i%d == 0:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
l,r,d = map(int, input().split())

if l%d == 0:
  print(r//d-l//d+1)
else:
  print(r//d-l//d)

Solution (Python):
import sys

L,R,d = map(int, sys.stdin.readline().split())


ans = 0
for i in range(1,int(R/d) + 1):
    if d * i < L:
        continue
    if d * i > R:
        break

    ans += 1

print(ans)

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r + 1):
  if i % d == 0:
    cnt += 1
print(cnt)

Solution (Python):
l,r,d = map(int, input().split())
print((r//d) - ((l-1)//d))

Solution (Python):


def main():
    L, R, d = map(int, input().split())
    ans = 0
    for i in range(L, R + 1):
        if (i % d) == 0:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
l, r, d = map(int, input().split())
cnt = 0
for i in range(r-l+1):
    if (i+l)%d == 0:
        cnt+=1
print(cnt)