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

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 (g % z == 0) and (h % z == 0) :
    c = c + 1
print(c)

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]+1
  print(int(b/a[2]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l,r,d = map(int,input().split())
print(int((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] != 0:
  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

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

L = int()
R = int()
d = int()

for i in range(L, R):

    if i % d == 0:
        print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (a[1] - a[0]) % a[2] != 0:
  count = 0
elif (a[1] - a[0]) != 0 & 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:
#!/usr/bin/env python3
#%% for atcoder uniittest use
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))
#%%code
def resolve():
    L,R,d=pin()
    cnt=0
    for i in range(L,R+1):
        if i%d==0:cnt+=1

    print(cnt)
#%%submit!
#resolve()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(cnt)

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 = count + 1
  else :
    count

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
count = 0
for i in range(1, b+1):
    if i % c == 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 = count + 1
  else :
    count
    
print("{}以上{}以下の{}範囲内での倍数は{}個あります".format(L,R,d,count))

Submission status: Wrong Answer

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

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

print(b-a)

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    l, r, d = map(int, input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a[2] == 1:
  count = a[1]
elif (a[1] - a[0]) % a[2] != 0:
  count = 0
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:
L,R,d = map(int, input().split())
cnt = 0
for i in range(L, R + 1):
    print(i)
    if i % d == 0:
        cnt += 1

print(cnt)

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

Submission status: Wrong Answer

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

if 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:
L,R,d = [int(x) for x in input().split()]

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

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

del r[::D]
if L != 0:
  print(len(A)-len(r) -1)
else:
  print(len(A)-len(r) - 2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
L, R, d = map(int, input().split())
  
if d > R:
  print("0")
elif L % d == 0:
  print(len(list(range(L, R, d))) + 1)
else:
  print(len(list(range(L, R, d))))

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
if a != b:
  if b !=c:
    if 1 <= a:
      if b <= 100:
        if a < b:
          if 1 <= c <= 100:
            print((b-a)//c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, M, K = map(int, input().split())
count=0
if K==1:
    count=M-N+1
else: 
    for i in range(M-N+1):
        if N&K==0:
            count=count+1
        N=N+1
 
print(count)

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
if 1 <= a:
  if b <= 100:
    if a < b:
      if 1 <= c <= 100:
        print((b-a)//c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if a[2] == 1:
  count = a[1]

print(count)

Submission status: Wrong Answer

Solution code:
a,b,c=(int(x) for x in input().split())
print((b-a)//c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

if a[2] == 1:
  count = a[1]

print(count)

Submission status: Wrong Answer

Solution code:
L,R,d = map(int, input().split())
cnt = 0
if d % L != 0:
    L += d % L

while L <= R:
    cnt += 1
    L += d
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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 
    count+=((r-l)//d)
    print(count)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

print(int(a)-int(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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:
    k+=-(l//d)+(l+x-1)//d
print(k)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s1 = l // d
s2 = r // d

print(s2-s1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(100):
    if d * i <= l:
        ans += 1
    if d * i >= r:
        ans += 1
        break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
nyuu = list(map(int, input().split()))
sho1 = nyuu[1] // nyuu[2]
sho2 = nyuu[0] // nyuu[2]
print(sho1 - sho2)

Submission status: Wrong Answer

Solution code:
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:
    k+=-l//d+(l+x-1)//d
print(k)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

count = 0
i = 0

w = r - l
if w==99:
    w = 100

for i in range(w):
    mod = i % d
    if mod == 0:
        count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

Solution code:
L,R,d = map(int,input().split())
count = 0
tmp = 0
while(True):
    if tmp <= L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
if d == 1:
    print(R- L + 1)
else:
    print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while res<=r:
  res = d*(iter+1)
  iter+=1
#print(res)
print(iter-1)

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())
count = 0
i = L

while i < R:
    if i % d == 0:
        count = count+1
        pass
    pass
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 = list(map(int, input().split()))
if a[0]<=100 and a[1]<=100 and a[2]<=100:
  b = a[1]-a[0]+1
  print(int(b/a[2]))

Submission status: Wrong Answer

Solution code:
list = list(map(int, input().split()))
print(list[1] // list[2]-list[0] // list[2])

Submission status: Wrong Answer

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

num_lower = int(L / d)
num_upper = int(R / d)
ans = num_upper - num_lower

print(ans)

Submission status: Wrong Answer

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

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

if R % D == 0:
  ANS += 1
 
ANS += (R-L)//D
print(ANS)

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())
	a=l+r
	print(a%d//2)

main()

Submission status: Wrong Answer

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

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

del r[::D]

print(len(A)-len(r) -1)

Submission status: Wrong Answer

Solution code:
l, r, d = map(int, input().split())
res = 0
iter = 0
p = 0
if d <= l:
  while res<=l:
    res = d*(p+1)
    p+=1
    if res>=l:
  	  iter+=1
#print(iter)
while res<=r:
  res = res+ d*(iter)
  if res <= r:
  	iter+=1
#print(res)
print(iter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, M, K = map(int, input().split())
count=0
for i in range(M-N):
    if N&K==0:
        count=count+1
    N=N+1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L,R,d= map(int, input().split())
if L==R and d!=L:
    print(0)
else:
    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
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
if(c==1):
    ans+=1
if(a==c):
    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:
import math
#=input()
#=int(input())
l,r,d=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]

if (l % d == 0) and (r % d == 0):
    print(math.ceil(r / d) - math.floor(l / d) + 1)
print(math.ceil(r / d) - math.floor(l / d))

Submission status: Wrong Answer

Solution code:
L,R,d=list(map(int,(input().split())))
if ((R//d-L//d)==99):
  print(100)
elif (((R//d-L//d)==0)):
  print(1)
else:
  print(R//d-L//d)

Submission status: Wrong Answer

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

count = 0

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

print(count)

Submission status: Wrong Answer

Solution code:
#import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
def main():
    L,R,d = map(int, input().split())
    if R < d:
        print(0)
    else :
        print((R-R%d)//d - (L+(L+d)%d)//d + 1)

main()

Submission status: Wrong Answer

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

for i in range(b):
  c = b + i + 1
  if a[2] == 1:
    count = a[1]
  elif c % a[2] == 0:
    count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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=list(map(int,(input().split())))
if((R//d-L//d)==99):
  print(100)
else:
  print(R//d-L//d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

lst = list(range(1, 101, d))

ret = list(filter(lambda x: L <= x <= R, lst))

# print(ret)
print(len(ret))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L,R,d=list(map(int,input().split()))
I=R-L+1
if 1<=L<=R<=100 and 1<=d<=100:
    print(I//d)

Submission status: Wrong Answer

Solution code:
def A_Q(L,R,d):
    count = 0
    for num in range(L,R+1):
        if num % d == 0:
            count += 1
    return count

Submission status: Wrong Answer

Solution code:
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):
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 
a,b,n = map(int,input().split())
ans = (b-(a-1))/n
print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
list = list(map(int, input().split()))
sho1 = list[1] // list[2]
sho2 = list[0] // list[2]
print(sho2-sho1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import *
l,r,d=map(int,input().split())

c=l//d
k=r//d
ans=k-c
print(ans)

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
def multiples(l,r,d):
  
  c = 0
  if d == 1:
    return r-l+1
  for i in range(l,r+1):
    if i%d==0:
      c += 1
    
  return c


if __name__ == '__main__':

  lrd = input().split()
  l = int(lrd[0])
  r = int(lrd[1])
  d = int(lrd[2])
  result = multiples(l,r,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())
res = (R - L + 1) // d
if (R - L) % d == 0:
    res += 1

print(res)

Submission status: Wrong Answer

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

s = a / c + 1

n = 1

while True:
  if s * c < b:
    n += 1
    s += 1
  else:
    break

print(n + 1)

Submission status: Wrong Answer

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

print(divLR())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
def main():
    L,R,d = map(int, input().split())
    if d < L or R < d:
        print(0)
    else :
        print((R-R%d)//d - (L+(L+d)%d)//d + 1)

main()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

mod = (L+d) % d
# print((R - L - mod) // d)
lst = list(range(L+mod, R+1, d))
print(list(lst))
print(len(lst))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b,c=list(map(int, input().split())) 
kotae1=math.floor(b/c)
kotae2=math.floor(a/c)
ans=kotae1-kotae2
print(ans)

Submission status: Wrong Answer

Solution code:
import io
import sys

_INPUT = '''\
5 10 2
'''
sys.stdin = io.StringIO(_INPUT)

def main():
    L,R,d = map(int,input().split())
    maxnum = R // d
    lownum = L // d
    add = 0
    if L % d == 0:
        add = 1
    print(maxnum - lownum + add)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
x = (a[1] // a[2]) - (a[0] // a[2])
print (x)

Submission status: Wrong Answer

Solution code:
L,R,d = (int(x) for x in input().split())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(L)

Submission status: Wrong Answer

Solution code:
L, R, D = map(int,input().split())
if D == 1: print(R - L + 1)
elif L % D == 0 and R % D == 0: print(R // D - L // D + 2)
elif L % D == 0 or R % D == 0: 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())

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

Submission status: Wrong Answer

Solution code:
import math
from collections import *
import sys
inp=sys.stdin.readline

def linp(x):
    return list(map(int,x.split()))
def minp(x):
    return map(int,x.split())
    
def main():
    l,r,d = minp(inp())
    rem = l%d
    l += d-rem
    if l>r:
        print(0)
    else:
        c=0
        while l<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

gap = (l+d)%d

if gap > r-l:
    print(0)
else:
    print(1 + (r-l-gap)//d)

Submission status: Wrong Answer

Solution code:
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())
count = 0
tmp = 0
while(True):
    if tmp <= L:
        tmp = tmp + d
    elif L <= tmp and tmp<= R:
        count += 1
        tmp = tmp + d
    else:
        break
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math 

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

print(math.ceil((r - l) / d))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

L = A[0]
R = A[1]
d = A[2]
result = 1
tmp = L

for i in range(d):
    if tmp % d == 0:
        break
    tmp += 1


for i in range(R):
    tmp += d
    if tmp > R:
        break
    result += 1



print(result)

Submission status: Wrong Answer

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

if d!=1:
    ansR = R / d
    ansL = L / d
    #print(ansR,ansL)
    ans = int(ansR) - int(ansL)
else:
    ans = R

print(int(ans))

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

L,R,d = map(int, input().split())
cou = 1
count = 0

while 1:
    if R < cou*d:
        break


    if L<cou*d:
        count+=1
    cou+=1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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