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

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(L, R, D):
    return R // D - (L-1) // D


def main():
    L, R, D = read_int_n()
    print(slv(L, R, D))


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

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):
        
try:
    inp = input().split()
    L = int(inp[0])
    R = int(inp[1])
    d = int(inp[2])
    
    if L >= 1 and R >= 1 and L <= R and L<=100 and R<=100 and d>=1 and d<=100:
        counter = 0
        for i in range(L,R+1):
            if i%d == 0:
                counter += 1
        print(counter)
        
except Exception as e:
    print(e)

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

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]


def main():
	L,R,d = inputMap()

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

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

Solution (Python):
def main():
    l,r,d = tuple([int(t)for t in 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())
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())
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 = r // d - l // d
if l % d == 0:
  ans += 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):
import sys
input = sys.stdin.readline

l,r,d=map(int,input().split())
v1 = l//d
if l%d==0:
    v1-=1
v2 = r//d
print(v2-v1)

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

print(ans)

Solution (Python):



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





i=0
num=int(a)
count=0

while(i!=int(b)-int(a)+1): 
    
    if (num%int(c)==0):
        count+=1
    num+=1
    i+=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());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):
a,b,c=map(int,input().split())
print(b//c-(a-1)//c)

Solution (Python):
import numpy as np
a, b, c = map(int,input().split())
count = 0

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

print(count)

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

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


num_list = list()

for x in range(L, R + 1):
    num_list.append(x)

dmul_list = list()
for i in num_list:
    x = i%d
    if x == 0:
        dmul_list.append(i)

print(len(dmul_list))

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

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

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

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

print(count)

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

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

print(cnt)

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

rest = l%d

if(rest == 0):
	num = int(r/d) - int(l/d) + 1
else:
  	num = int(r/d) - int(l/d)
    
print(num)

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()))
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(101):
    if d * i > r:
        break
    elif d * i >= l:
        ans += 1
        continue
    else:
        continue

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 n in range(L, R + 1):
    if n % 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
  else:
    a += 0

print(a)

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

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

print(b-a)

Solution (Python):
a = list(map(int,input().split()))
l=a[0]
r=a[1]
d=a[2]
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())
A = 0
for _ in range(L,R+1):
    if _ %d == 0:
        A += 1
print(A)

Solution (Python):


import sys
sys.setrecursionlimit(300000)


def solve(L: int, R: int, d: int):
    ret = R // d - (L - 1) // d
    print(ret)
    return

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):
import sys

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

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

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

Solution (Python):
l,r,d = map(int,input().split())
a = r // d
b = l // d
ans = a - b
c = r % d
e = l % d
if c == 0 and e == 0:
  print(ans + 1)
else:
  print(ans)

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




def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
	l,r,d=MI()

	ans=(r-l)//d

	a=l+ans*d

	if r//d*d==-(-a//d)*d:
		ans+=1

	print(ans)










if __name__ == "__main__":
	main()

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

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

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

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

print(cns)

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

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

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

Solution (Python):
l,r,d = map(int, input().split())
r = r+1
range_list = list(range(l,r))
per_list = []
for i in range_list:
    if i % d == 0:
        per_list.append(i)
    else:
        pass
print(len(per_list))

Solution (Python):
def main():
    L, R, d = input_ints()

    print(len([True for i in range(L, R+1) if i % d == 0]))




def input_ints():
    line_list = input().split()

    if len(line_list) == 1:
        return int(line_list[0])
    else:
        return map(int, line_list)


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


def input_int_tuple_list(n: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Solution (Python):
L, R, d = map(int, input().split())
ans = list(map((lambda x: x % d == 0) , [i for i in range(L, R+1)])).count(True)
print(ans)

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

now = d

count = 0

while now <= r:

    if now >= l:
        count += 1
    
    now += d

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):
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
l,r,d=get_ints()
count=0
for i in range(l,r+1):
    if i%d==0:
        count=count+1
print(count)

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

seq = list(range(L, R+1))
print(len(list(filter(lambda x: x%d==0,seq))))

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

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

Solution (Python):
import math
l,r,d = (int(i) for i in input().split())
z = int(math.floor(r/d)-math.floor(l/d))
if l%d == 0:
	print(z+1)
else:
	print(z)

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

r = [i for i in range(L,R+1)]

N = [k for k in r if k % D == 0]

print(len(N))

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

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  
from functools import reduce

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

Solution (Python):

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



d1 = d
count = 0

while d1 < L:
    d1 += d
    

while d1 <= R:
    count += 1
    d1 += d

print(count)

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

Solution (Python):
a,b,c=map(int,input().split())
if b%c==0 or a%c==0:
  print(int((b-a)/c)+1)
else:
  print(int((b-a)/c))

Solution (Python):
num = list(map(int, input().split()))
min_range = num[0]
max_range = num[1]
n = num[2]
ans = len([i for i in range(min_range, max_range+1) if i % n <= 0])
print(ans)

Solution (Python):



import sys


def get_ints():
    return map(int, sys.stdin.readline().strip().split())


def main():
    L, R, d = get_ints()
    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())
ans = [int(i) for i in range(L, R+1) if i % d == 0]

print(len(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):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
INF = 10**18


if __name__ == "__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)

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

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

print(ans)

Solution (Python):
L, R, d = map(int, open(0).read().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):
inpl = lambda: list(map(int,input().split()))
L, R, d = inpl()
print(R//d - (L-1)//d)

Solution (Python):
L,R,D=map(int,input().split())
startno = L
while startno % D != 0:
    startno += 1 
lista=list(range(startno,R+1,D))

print(len(lista))

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

if __name__ == '__main__':
    main()

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

Solution (Python):
a=input().split(' ')
a[0]=int(a[0])
a[1]=int(a[1])
a[2]=int(a[2])
c=a[0]
m=0
while c<a[1]+1:
    if c%a[2]==0:
        m=m+1
    c=c+1
print(m)

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

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

print(count)

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

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):
from sys import stdin,stdout
l,r,d=list(map(int,stdin.readline().strip().split()))
c=0
if l%d==0 and r%d==0:
    stdout.write(str(int(r/d)-int(l/d)+1)+'\n')
else:
    stdout.write(str(int(r/d)-int(l/d))+'\n')

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

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

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

Solution (Python):
N, M, K = map(int, input().split())
count=0
for i in range(M-N+1):
    ans=N%K
    if ans==0:
        count=count+1
    N=N+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())

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

print(b-a)

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


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

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

    print(cnt)

resolve()

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):
if __name__ == "__main__":
    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, 1):
  if i % d == 0:
    cnt += 1

print(cnt)

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
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())
l = [x for x in range(L, R + 1) if x % d == 0]
print(len(l))

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

Solution (Python):

line = input().split(' ')
L = int(line[0])
R = int(line[1])
d = int(line[2])
count = 0
for i in range(L,R+1):
    if i % d == 0:
        count +=1

print(count)

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

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

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

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

Solution (Python):
L,R,d = [int(x) for x 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 = 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())
ls=[i for i in range(l,r+1) if i%d==0]
print(len(ls))

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

start = (l-1) // d
end = r // d
ans = end - start

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

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

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)

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):
from sys import stdin
input = stdin.readline

L,R,d = [int(x) for x in input().split()]
ans = 0
for i in range(L, R+1):
    if i % d == 0:
      ans = ans + 1
    if i == R:
      break
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, w = map(int, input().split())
count = 0
for i in range(L, R+1):
  
  if i % w == 0:
    count += 1
print(count)

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

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

Solution (Python):
list = list(map(int,input().split()))
large = list[1] // list[2]
small = list[0] // list[2]
amari = list[0] % list[2]
if amari == 0:
  print(large - small + 1)
  
else:
  print(large - small)

Solution (Python):
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(a%c==0):
    ans+=1
print(ans)

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

Solution (Python):
a, b, n = map(int, input().split())
count = 0
for k in range(a,b+1):
    if k % 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):
a = input("")
aa = a.split(" ")
aa = [int(s) for s in aa]
L = aa[0]
R = aa[1]
d = aa[2]
aaa = []
for i in range(L,R+1):
    aaa.append(i%d)
print(aaa.count(0))

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

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

a= L // d
b= R // d
c = L % d

if(d==1 or d==L ):
    print(b-a+1)
elif(c==0):
    print(b-a+1)
else:
    print(b-a)

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

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

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

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

num = 0

for i in list(range(L,R+1)):

  if i % d == 0:
    num += 1

print(num)

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
import itertools as it
import collections as cl
import math
from functools import reduce

def li():
    return [int(x) for x in input().split()]

L, R, d = li()

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()))
print(R//d - L//d + (0 if L%d else 1))

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


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

    return


if __name__ == '__main__':
    main()

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

Solution (Python):
a,b,c=map(int,input().split())
d=c
i=1
ct=0
while True:
    c=d*i
    
    if(c>=a and c<=b):
        ct=ct+1
        
    i=i+1
    if(c>=a and c>b):
        break
print(ct)

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 and R%d != 0:
  ans = (R-L)//d
elif L%d ==0:
  ans = (R-L)//d + 1
else:
  a0 = L - L%d + d
  ans = (R - a0)//d + 1
print(ans)

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

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

number_list = range(l, r+1, 1)
answer_list = []
for i in number_list:
    if i % d == 0:
        answer_list.append(i)

print(len(answer_list))

Solution (Python):
import math

L, R, d = map(int, input().split())
Lt = L%d
Rt = R%d
ans = 0

if Lt!=0 and Rt!=0:
    ans = math.floor(R/d) - math.floor(L/d)
elif Lt==0 and Rt==0:
    ans = int(R/d - L/d +1)
elif Lt!=0 and Rt==0:
    ans = int(R/d) - math.floor(L/d)
else:
    ans = math.floor(R/d) - int(L/d)

print(ans)

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

d = b - a

n = int(d / c)

if b % c == 0:
  n += 1

print(n)

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

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

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

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())
if d==1:
    print(R-L+1)
else:
    G=0
    A=0
    for i in range(0,100):
        i=i+1
        G=d*i
        if G>=L:
            if G<=R:
                A=A+1
            else:
                print(A)
                break

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

h = R // d
l = (L-1) // d

print(h - l)

Solution (Python):
from sys import stdin,stdout

l,r,d=map(int,stdin.readline().split())
left=l//d*d
if left<l:left+=d
right=r//d*d

print((right-left)//d+1)

Solution (Python):
input_list = input().split(" ")
count = 0
for i in range(int(input_list[0]),int(input_list[1])+1):
	if i%int(input_list[2]) == 0:
		count += 1
print(count)

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

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

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

Solution (Python):
param = input()
min, max, power = (param.split())

count = 0
for i in range(int(min), int(max)+1):
    if i % int(power) == 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())
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())

ll = L//d
if L % d != 0 :
    ll += 1
rr = R//d

print(rr-ll+1)