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())
print(R//d - (L-1)//d)

Solution (Python):
def main():

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

    num_R = R // d
    num_L = (L-1) // d

    ans = num_R - num_L

    print(ans)

if __name__ == "__main__":
    main()

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())
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 - 1) // d)

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

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())
print(r//d - (l - 1)//d)

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

n1 = int(L / d)
if(L % d == 0):
  n1 -= 1
n2 = int(R / d)

print(n2 - n1)

Solution (Python):
L,R,d = (int(x) for x in 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())
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())
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())
cnt=0
for i in range(l,r+1,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 = map(int, input().split())
ans = 0
for i in range(l, r+1):
    if i%d == 0:
        ans += 1
print(ans)

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

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

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

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

if __name__ == '__main__':
    main()

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 - 1) // 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 = list(map(int,input().split(' ')))
count = 0
for i in range(R-L+1):
	if (i+L)%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(" "))

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

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(L, R+1, 1):
  if i % d == 0:
    ans += 1
    
print(ans)

Solution (Python):
i = list(map(int, input().split())) 

print(i[1]//i[2]-(i[0]-1)//i[2])

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy

l, r, d = map(int, sys.stdin.readline().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())

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, d, r = map(int, input().split())
ans = []
for i in range(l, d+1):
    if i % r == 0:
        ans.append(i)

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

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

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

Solution (Python):

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

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

print(c)

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

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

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

Solution (Python):
def main():
    left, right, div = [int(x) for x in input().split()]
    ans = right // div - (left - 1) // div
    print(ans)


if __name__ == '__main__':
    main()

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

first = L + (D - (L % D)) % D
last = R - (R % D)
ans = 0
if L <= first <= R and L <= last <= R:
    ans = (last - first) // D + 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())
print(r//d-(l-1)//d)

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


if __name__ == "__main__":
    main()

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

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



ans = 0

for i in range(L, R+1):
    if i % d == 0:
        ans = 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())
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())
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())
c = 0
x = (l // d) + 1
if(l % d == 0):
    c = 1
while(True):
    m = d * x
    x += 1
    if(m <= r):
        c += 1
    else:   break
print(c)

Solution (Python):
l,r,d=map(int,input().split())
ans=[]
for i in range(l,r+1):
  if i%d==0:
    ans+=i,
print(len(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())

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

print(counter)

Solution (Python):


import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")

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):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math

rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')

def main():
	L, R, d = rli()
	ans = 0
	for x in range(L, R+1):
		if x % d == 0:
			ans += 1
	print(ans)
	stdout.close()

if __name__ == "__main__":
	main()

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())
rd = r//d
ld = (l-1)//d
answer = rd -ld

print(answer)

Solution (Python):
a, b, x = map(int, input().split())
count = 0
for i in range(a, b+1):
    if i % x == 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())
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())
n = (l-1) // d + 1
m = r // d
print(m-n+1)

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

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

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

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 = map(int,input().split())
count=int(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=(r-l)//d
if r%d==0 or l%d==0:
    ans+=1
print(ans)

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

Solution (Python):
s,e,bai = [int(x) for x in input().split()]
count=0

for i in range(s,e+1):
    if i%bai == 0:
        count +=1
print(count)

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 math

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

l = math.ceil(L / d)
r = math.floor(R / d)

print(r - l + 1)

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

l = L // d
r = R // d

ans = r - l
if L % d == 0 and R % d == 0:
    ans += 1
    
print(ans)

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

print(p)

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

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

if L%d==0:
    st = L
else:
    st = (L//d+1)*d

count = 0
for i in range(st, R+1, d):
    if i <= R:
        count += 1
    else:
        break
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
    else:
        pass
print(count)

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

ans = R//d - (L-1)//d
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
    else:
        continue

print(cnt)

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

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

print(count)

Solution (Python):
import sys
l,r,d = map(int, sys.stdin.readline().rstrip("\n").split())
q1 = (l-1) // d
q2 = r // d
print(q2-q1)

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()))
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):
L, R, d = map(int, input().split())
print(R//d - (L-1)//d)

Solution (Python):
l,r,n = map(int,input().split(" "))
count = 0
for i in range(l,r+1):
    if i % n == 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 = 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())
l-=1
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 = map(int, input().split())
print(R//d-(L-1)//d)

Solution (Python):
a = a, b, c, = map(int, input().split())
bc = int(b/c)
ac = int((a-1)/c)
ans = bc-ac
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())

x = L
ans = 0

while x<=R:
  if x % d == 0:
    ans += 1
  x += 1

print(ans)

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

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

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

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

cnt = 0
for i in range(0, 101, d):
    if l <= i and r >= i:
        cnt += 1

print(cnt)

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

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

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

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

print(a)

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

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

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

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

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

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

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

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

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

Solution (Python):



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

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())
ans = (r // d) - ((l-1) // d)
print(ans)

Solution (Python):
l, r, d = map(int, input().split())
ans = r//d - (l-1)//d
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())
count = 0

for i in range(1, 101):
    temp = i * d
    if l <= temp and temp <= r:
        count += 1
    elif temp > r:
        break

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

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

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

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

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

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):
def func(num, div):
    return num // div


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

print(func(r, d) - func(l - 1, d))

Solution (Python):

def main():
    L, R, D = map(int, input().split())
    print(R // D - (L - 1) // D)


if __name__ == "__main__":
    main()

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):
lower, upper, d_baisuu = map(int, input().split())
 
cnt = 0
 
for num in range(lower, upper + 1):
    if (num % d_baisuu == 0):
        cnt += 1
 
print(cnt)

Solution (Python):
l, r, d = map(int, input().split())
ans = (r // d) - ((l-1) // d)
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())
print((R // d) - (L // d) + (1 if L % d == 0 else 0))

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

Solution (Python):
L, R, d  = map(int, input().split())
pq = 0
for x in range(R+1):
    y = d * x
    if y>=L and y<=R:
        pq += 1
print(pq)

Solution (Python):
L, R, d  = map(int, input().split())
lst = list()
for x in range(R+1):
    y = d * x
    if y>=L and y<=R:
        lst.append(y)
print(len(lst))

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

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):
    
    if i % d == 0:
        ans += 1
print(ans)

Solution (Python):
a, z, mult = input().split()

a, z, mult = int(a), int(z), int(mult)

cont = 0
for i in range(a, z+1):
    if i%mult == 0:
        cont += 1;
        
print(cont)

Solution (Python):
a,b,c=map(int,input().split())
if a%c==0:
	l=a 
else:
	l=(a//c+1)*c 
if b%c==0:
	u=b 
else:
	u=(b//c)*c 

print(max(0,(u-l)//c+1))

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 = list(map(int,input().strip().split()))
print(R//d-(L-1)//d)

Solution (Python):
l, r, d = [int(i) for i in input().split(" ")]
l -= 1
print(r//d - l//d)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
count = 0
l, r, d= [int(x) for x in readline().rstrip().split()]

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


import sys
input=sys.stdin.readline

l,r,d=map(int,input().split())
cnt1=r//d
cnt2=(l-1)//d
print(cnt1-cnt2)

Solution (Python):
L,R,d=map(int, input().split())
print(R//d-(L-1)//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())
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 = r//d - (l-1)//d
print(ans)

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
import sys


def main():
    input = sys.stdin.buffer.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):
inputLine = [int(i) for i in input().split()]
L = inputLine[0]
R = inputLine[1]
d = inputLine[2]
count = 0
for x in range(L,R+1):
  if ( x%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())
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())
print(r//d-~-l//d)

Solution (Python):
l,r,d=map(int,input().split())
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):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


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):
L, R, d = input().split()
if int(L)%int(d) == 0:
    print(int(R)//int(d) - int(L)//int(d) + 1)
else:
    print(int(R)//int(d) - int(L)//int(d))

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

Solution (Python):
[L,R,d] = map(int,input().split())
n = R - L + 1
c = 0
for i in range(n):
    if (L + i) % d == 0 :
        c = 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())

print(r//d-(l-1)//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 = 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):
  if i % d == 0:
    ans += 1
print(ans)

Solution (Python):
l,r,d=map(int,input().split())
s=r//d-l//d
if l%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())
print(r // d - (l - 1) // d)

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

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

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
n=b//c
y=(a-1)//c
print(n-y)

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
import math



input = sys.stdin.readline
 

def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))



l,r,d=invr()
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):
  if i % d == 0:
    ans += 1
print(ans)

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())
print(r//d-(l-1)//d)

Solution (Python):
import sys

def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  

L,R,d = LI()
print(R//d-(L-1)//d)

Solution (Python):
x,y,z=map(int,input().split())
print(y//z-(x-1)//z)

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())
print(sum([True for T in range(L,R+1) if T%d==0]))

Solution (Python):
li =list(map(int,input().split()))
n =li[0]
m =li[1]
k =li[2]
count =0
for i in range(n,m+1):
    if i%k ==0:
        count +=1

print(count)

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

Solution (Python):
def count(n, d):
    return n // d


def main():
    L, R, d = map(int, input().split())
    ans = count(R, d) - count(L - 1, d)
    print(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 = 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, 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())
t = 1
res = 0
while t * d <= R: 
    if L <= t * d <= R:
        res += 1
    t += 1
print(res)

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())
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):
a, b, c =map(int, input().split())
d=(a-1)//c
e=b//c
ans=e-d
print(ans)

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    l, r, d = map(int, input().split())
    print(r // d - (l - 1) // d)
resolve()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

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

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

ans = 0
for x in range(L, R + 1):
    if (x % 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 = map(int, input().split())

ans = 0

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

print(ans)

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

Solution (Python):
l,r,d=map(int,input().split())
c=0
for i in range(1,101):
  if l<=d*i<=r:
    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())
print(r//d-(l-1)//d)

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



L,R,d = LI()

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

print(ans)