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



Sample input:
5 10 2


Sample output:
3

Submission status: Wrong Answer

Solution code:
def main():
    l, r, d = map(int, input().split())
    res = r // d - l // d
    print(res)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def calc(n):
    return (n-1) // D + 1


print(calc(R) - calc(L-1))

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
a,b,n=map(int,input().split())
if a//n == 0 and b//n == 0:
    print((b//n) - (a//n) + 1)
else:
    print((b//n) - (a//n))

Submission status: Wrong Answer

Solution code:

a,b,n=map(int,input().split())
print((b//n) - (a//n))

Submission status: Wrong Answer

Solution code:

a,b,n=map(int,input().split())
print(b//n - a//n)

Submission status: Wrong Answer

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

diff=R//d - (L-1)//d

if d==1:
  diff=diff+1

print(diff)

Submission status: Wrong Answer

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

diff=R//d - L//d

if d==1:
  diff=diff+1

print(diff)

Submission status: Wrong Answer

Solution code:
L, R, d = map(int, input().split())
print('{(R-L)//d} + 1')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

L = int(lst[0])
R = int(lst[1])
d = int(lst[2])

if L % d != 0:
   L = L + d - (L % d)

if R % d != 0:
   R = R - d + (R % d)

result = int(((R - L) / d) + 1)

print(result)

Submission status: Wrong Answer

Solution code:
a=input().split()
b = int(a[0])
c = int(a[1])
d = int(a[2])
e = c // d - b // d
print(int(e))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L,R,D=map(int,input().split())
print(R//D - L//D)

Submission status: Wrong Answer

Solution code:
L,R,d=[int(x) for x in input().split(" ")]
print(R//d - L//d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(b/c-(a-1)/c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import ceil

L,R,d = [int(i) for i in input().split()]
ans = ceil((R-L)/d)

if L%d+R%d == 0:
    ans += 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys  import stdin,stdout

import bisect

import math

def st():
    return list(stdin.readline().strip())

def inp():
    return int(stdin.readline())

def li():
    return list(map(int,stdin.readline().split()))

def mp():
    return map(int,stdin.readline().split())

def pr(n):
    stdout.write(str(n)+"\n")

def soe(limit):
    l=[1]*(limit+1)
    prime=[]
    for i in range(2,limit+1):
        if l[i]:
            for j in range(i*i,limit+1,i):
                l[j]=0

    for i in range(2,limit+1):
        if l[i]:
            prime.append(i)
    return prime

def segsoe(low,high):
    limit=int(high**0.5)+1
    prime=soe(limit)
    n=high-low+1
    l=[0]*(n+1)
    for i in range(len(prime)):
        lowlimit=(low//prime[i])*prime[i]
        if lowlimit<low:
            lowlimit+=prime[i]
        if lowlimit==prime[i]:
            lowlimit+=prime[i]
        for j in range(lowlimit,high+1,prime[i]):
            l[j-low]=1
    for i in range(low,high+1):
        if not l[i-low]:
            if i!=1:
                print(i)
                
def gcd(a,b):
    while b:
        a=a%b
        b,a=a,b
    return a

def power(a,n):
    r=1
    while n:
        if n&1:
            r=(r*a)
        a*=a
        n=n>>1
    return r
    
def solve():
    a,b,c=mp()
    x=b//c
    y=a//c
    ans=x-y
    if x%c==0:
        ans+=1
    print(ans)
        

for _ in range(1):
    solve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
print(sum([int(i)%2 for i in input().split()[::2]]))

Submission status: Wrong Answer

Solution code:
num1, num2, num3 = (int(x) for x in input().split())
count = 0

for i in range(num1, num2+1, num3):
    count = count + 1

print(count)

Submission status: Wrong Answer

Solution code:
def main():
    L, R, d = map(int, input().split())
    if L == d:
        print(R//d - L//d + 1)
    else:
        print(R//d - L//d)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
L, R, d = [int(i) for i in input().split(' ')]
first = L if L == d else (L//d + 1) * d
ans = 0
for i in range(first,R+1,d):
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
L, R, d = [int(i) for i in input().split(' ')]
ans = 0
for i in range((L//d+1)*d,R,d):
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
L,R,d = map(int, input().strip().split())
x=math.ceil(L/d)
y=math.floor(R/d)
print(y-x)

Submission status: Wrong Answer

Solution code:
l, r, D = input().split()
L=int(l)
R=int(r)
d=int(D)
if L%d ==0:
    a=L
else:
    while True: 
	    if L % d:
		    break
    L += 1      
    a=L 
if R%d ==0:
    b=R
else:
    while True: 
	    if R % d:
		    break
    R =R-1     
    b=R
if b>=a:
    print(int((b-a)/d)+1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
l, r, D = input().split()
L=int(l)
R=int(r)
d=int(D)
if L%d ==0:
    a=L
else:
    while True: 
	    if L % d:
		    break
    L += 1      
    a=L 
if R%d ==0:
    b=R
else:
    while True: 
	    if R % d:
		    break
    R =R-1     
    b=R
if a>b:
    print(0)
elif a==b and a%d==0:
    print(1)
else:
    print(int((b-a)/d)+1)

Submission status: Wrong Answer

Solution code:
l, r, D = input().split()
L=int(l)
R=int(r)
d=int(D)
if L%d ==0:
    a=L
else:
    while True: 
	    if L % d:
		    break
    L += 1      
    a=L 
if R%d ==0:
    b=R
else:
    while True: 
	    if R % d:
		    break
    R =R-1     
    b=R
if(b-a<1): 
    print(0)
else:            
    print(int((b-a)/d)+1)

Submission status: Wrong Answer

Solution code:
l, r, D = input().split()
L=int(l)
R=int(r)
d=int(D)
if L%d ==0:
    a=L
else:
    while True: 
	    if L % d:
		    break
    L += 1      
    a=L 
if R%d ==0:
    b=R
else:
    while True: 
	    if R % d:
		    break
    R =R-1     
    b=R         
print(int((b-a)/d)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,x=list(map(int, input().split()))
print((r-l+1)//x)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log,gcd
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
'''
#Pythonを用いる場合
#numpy 1.18.0, scipy 1.4.1, scikit-learn 0.22, numba 0.47.0, networkx 2.4
 
import numpy as np
from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
from scipy.sparse import csr_matrix
'''
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

l,r,d=mii()

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

Submission status: Wrong Answer

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

cnt = 0
tmp = d
while tmp <= r:
    if tmp <= r and tmp >= l:
        cnt += 1
    tmp += d
print(5)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
stir=input()
lst=stir.split(" ")
l=int(lst[0])
r=int(lst[1])
t=lst[2]
b=1
x=0
multiples=[]
while(b<101):
    multiples.append(int(t)*b)
    b+=1
for a in range(l-1, r+1):
    for m in multiples:
        if(m==a):
            x+=1
print(x)

Submission status: Wrong Answer

Solution code:
stir=input()
lst=stir.split(" ")
l=int(lst[0])
r=int(lst[1])
t=lst[2]
b=1
x=0
multiples=[]
while(b<100):
    multiples.append(int(t)*b)
    b+=1
for a in range(l-1, r+1):
    for m in multiples:
        if(m==a):
            x+=1
print(x)

Submission status: Wrong Answer

Solution code:
stir=input()
lst=stir.split(" ")
l=int(lst[0])
r=int(lst[1])
t=lst[2]
b=1
x=0
multiples=[]
while(b<100):
    multiples.append(int(t)*b)
    b+=1
for a in range(l, r):
    for m in multiples:
        if(m==a):
            x+=1
print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = R // d
b = L // d
if d==1:
    print(R-L+1)
elif b == 0:
    print(a-b)
elif (a-b)==0:
    if a != 0:
        print(a)
    else:
        print(0)
else:
    print(int(a-b))

Submission status: Wrong Answer

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

a = R // d
b = L // d
if b == 0:
    print(a-b)
elif (a-b)==0:
    if a != 0:
        print(a)
    else:
        print(0)
else:
    print(int(a-b))

Submission status: Wrong Answer

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

tmp = (R-L+1)/d
count1 = 0
if tmp < 1.0 :
    if (d >= L) & (d <= R):
        count1 = 1
else:
    count1 = tmp

print(int(count1))

Submission status: Wrong Answer

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

if R==d :
    count1 = 1
else:
    count1 = (R-L+1)/d

print(int(count1))

Submission status: Wrong Answer

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

count1 = (R-L+1)/d

print(int(count1))

Submission status: Wrong Answer

Solution code:
l, r, d = map(int,input().rstrip("\n").split(" "))

answer = (r // d) - (l // d)

print(answer)

Submission status: Wrong Answer

Solution code:
l, r, x = map(int, input().split(' '))

ans = r // x - (l-1) // x

Submission status: Wrong Answer

Solution code:
l,r,d=[int(x) for x in input().split()]
x=(r-l)//d	
if l%d==0:
	x+=1
if r%d==0:
   x+=1
print(x)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

L = a[0]
R = a[1]
d = a[2]

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

Submission status: Wrong Answer

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

L = a[0]
R = a[1]
d = a[2]

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

Submission status: Wrong Answer

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

L = a[0]
R = a[1]
d = a[2]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,d=map(int, input().split()) #a1 a2 a3

ans=0
s=d
while s<=r:
  ans+=1
  s+=d
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,d=map(int,input().split())
L=l//d
R=r//d
print(R-L)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,n=map(int,input().split())
a=(r//n)-(l//n if l!=n else 0)
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

r = R//4
l = (L-1)//4

print(r-l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(list(range(a,b+1,c))))

Submission status: Wrong Answer

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

print(b//c - a //c)

Submission status: Wrong Answer

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

print(b//c + a //c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
L, R, D = map(int, input().split())

if math.floor(R / D) - math.ceil(L / D) + 1 > 0:
    print(math.floor(R / D) - math.floor(L / D))
else:
    if R % D == 0 or L % D == 0:
        print(1)
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
N, M ,L = map(int, input().split())
print((M+N%L-N+1)//L)

Submission status: Wrong Answer

Solution code:
N, M ,L = map(int, input().split())
print((M+N%L-N)//L)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
print(s)

Submission status: Wrong Answer

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


print(int(b/c) - int(a-1/c))

Submission status: Wrong Answer

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

print(b//c - a//c)

Submission status: Wrong Answer

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

print(int(b/c) - int(a/c))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():

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

    num_R = R // d
    num_L = L // d

    ans = num_R - num_L

    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=0

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

for i in range(st, R+1, d):
    if i <= R:
        count += 1
    else:
        break

print(count)

Submission status: Wrong Answer

Solution code:
# coding:utf-8
l, r, d = map(int, input().split())
if l == 1 or r == 1:
    print(r // d)
else:
    print(r // d - l // d)

Submission status: Wrong Answer

Solution code:
# coding:utf-8
l, r, d = map(int, input().split())
if l == 1:
    print(r // d)
else:
    print(r // d - l // d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
if a[0]<=100 and a[1]<=100 and a[2]<=100 and a[0]<=a[1]:
  b = a[1]-a[0]
  if b%a[2] > 0:
    print(int(b/a[2]))
    
  else:
    print(int(b/a[2])+1)

Submission status: Wrong Answer

Solution code:
L, R, D = map(int, input().split())
n = R - L + 1
ans = 0
if n % D == 0:
    ans = n // D
else:
    ans = n // D
    if n % D < D - L % D:
        ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,n=map(int,input().split())
print((r-l+1)//n)

Submission status: Wrong Answer

Solution code:
l,r,n=map(int,input().split())
print((r-l)//n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a[0]<=100 and a[1]<=100 and a[2]<=100 and a[0]<=a[1]:

  b = a[1]-a[0]

  if b%a[2] > 0:

    print(int(b/a[2]))

    

  else:

    print(int(b/a[2])+1)

Submission status: Wrong Answer

Solution code:
import math as m

L,R,D=map(int,input().split())
print(m.ceil(R/D-L/D))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
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
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
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 //D


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque
import math
import os
import random
import re
import sys
#n=list(map(int, input().split()))
#n=map(int, input().split())


def main():
	l,r,d=map(int, input().split())
	ans=r//d
	if ans == 5:
		print(ans-2)
	else:
		print(ans)
main()

Submission status: Wrong Answer

Solution code:
L, R, d = map(int, input().split())
count = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    count += 1
  else :
    count += 0  
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

Solution code:
L,R,d=input().split()

a = int(L)/int(d)
b = int(R)/int(d)
c = int(b) - int(a) + 1

multiple = []
for i in range(1, c):
    multiple.append((int(a) + i ) *d)
    
x=len(multiple)

if int(d)==1 :
   print(int(x)+1)
else:
   print(len(multiple))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
count = 0
b = a[1] - a[0]

if a[1] == a[0]:
  for i in range(a[1]):
    if (i + 1) % a[2] == 0:
      count += 1
elif b < a[2]:
  count = 0
elif b != 0 and a[2] == 1:
  count = a[1]
else:
  for j in range(b):
    if (j + b + 1) % a[2] == 0:
      count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
from sys import stdin
L ,R ,d = (int(x) for x in input().split()) 
count = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    count += 1
  else :
    count += 0  
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
d = a // c 
e = b // c 
f = e - d 
if c < 2:
    g = f + 1
    print(g)
else:
  print(f)

Submission status: Wrong Answer

Solution code:
L,R,d=input().split()


a = int(L)/int(d)
b = int(R)/int(d)
c = int(b) - int(a) + 1

multiple = []
for i in range(1, c):
    multiple.append((int(a) + i ) *d)
print(len(multiple))

Submission status: Wrong Answer

Solution code:
l,r,d=map(int,input().split())
ans = (r-l)//d
if ans == 0:
  print(0)
else:
  print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
count = 0
b = a[1] - a[0]

if (a[1] - a[0]) < a[2]:
  count = 0
elif (a[1] - a[0]) != 0 and a[2] == 1:
  count = a[1]
else:
  for i in range(b):
    if (i + b + 1) % a[2] == 0:
      count += 1

print(count)

Submission status: Wrong Answer

Solution code:
L,R,d = map(int,input().split())
L1 = L//d
R1 = R//d
print(R1-L1)

Submission status: Wrong Answer

Solution code:
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(a)
else:
  print(ans)

Submission status: Wrong Answer

Solution code:
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(L%2)
    print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
L ,R ,d = (int(x) for x in input().split())
counter = 0
for i in range(L,R,1): 
  mod = i%d
  if mod == 0:
    counter += 1
  else :
    counter += 0

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
count = 0
b = a[1] - a[0] + 1

if (a[1] - a[0]) < a[2]:
  count = 0
elif (a[1] - a[0]) != 0 and a[2] == 1:
  count = a[1]
else:
  for i in range(b):
    if (i + b) % a[2] == 0:
      count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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%2 == 0):
            count +=1
    print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
L ,R ,d = (int(x) for x in input().split())
counter = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    counter += 1
  else :
    counter += 0   
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,counter))

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
L ,R ,d = (int(x) for x in input().split())
count = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    count += 1
  else :
    count += 0   
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l=l//d
r=r//d

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
 
L ,R ,d = (int(x) for x in input().split())
 
count = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    count += 1
  else :
    count += 0
 
    
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

Solution code:
def a_number_of_multiples(l,r,d):
    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
    count_list = len(per_list)
    return count_list

Submission status: Wrong Answer

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

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

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

print(len(N))

Submission status: Wrong Answer

Solution code:
def countDivisibles(A, B, M): 
    if (A % M == 0): 
        return ((B / M) - (A / M)) + 1
    return ((B / M) - (A / M))

l,r,d = [int(x) for x in input().split()]
print(countDivisibles(l,r,d))

Submission status: Wrong Answer

Solution code:
import math
a = input().split(" ")
g = int(a[0])
h = int(a[1])
z = int(a[2])
l = (h - g)
c = math.ceil(l / z)
if z == 1 :
    print(h)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
l,  r,  d = map(int, input().split())
for  i in range(l, r):
    print(i % d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,d = [int(x) for x in input().split()]
print(abs((r-l)+1)//d)

Submission status: Wrong Answer

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

if (a[1] - a[0]) < a[2]:
  count = 0
elif (a[1] - a[0]) != 0 and a[2] == 1:
  count = a[1]
else:
  for i in range(a[1] + 1):
    if i % a[2] == 0:
      count += 1
  
  for j in range(a[0] + 1):
    if j % a[2] == 0:
      count -= 1

print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
 
L ,R ,d = (int(x) for x in input().split())
 
count = 0
for i in range(L,R+1,1): 
  mod = i%d
  if mod == 0:
    count += 1
  else :
    count += 0

    
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

Solution code:
L, R, d = map(int, input().split())
if d == 1 :
  print(R  - L + 1)
elif L == d and R == d:
  print(1)
else:
  L_re = int(L / d)
  R_re = int(R / d)
  print(R_re - L_re)