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:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time,itertools
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    l,r,d = invr()
    c = 0
    for i in range(l,r + 1):
        if d % i == 0:
            c = c + 1
    print(c)
    
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)

def counter_elements(a):
    q = dict()
    for i in range(len(a)):
        if a[i] not in q:
            q[a[i]] = 0
        q[a[i]] = q[a[i]] + 1
    return(q)

def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)
 
def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))
 
def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

def transpose(a):
    n,m = len(a),len(a[0])
    b = [[0] * n for i in range(m)]
    for i in range(m): 
        for j in range(n): 
            b[i][j] = a[j][i]
    return(b)

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
x = 0
y = 0
for i in range(b):
    x = c * (i + 1)
    if x < a:
        continue
    else:
        if x < b:
            y = y + 1
print(y + 1)

Submission status: Wrong Answer

Solution code:
def resolve():
    import sys
    sys.setrecursionlimit(10 ** 6)  # 再帰関数の再帰の深さを設定
    to_index = lambda x: int(x) - 1  # 入力した数字に1を引いたものを返す
    print_list_in_2D = lambda x: print(*x, sep="\n")  # リストの要素を改行を挟んで表示する関数

    # 入力を整数に変換して受け取る
    def input_int(): return int(input())

    def map_int_input(): return map(int, input())

    MII = map_int_input

    def MII_split(): return map(int, input().split())

    def MII_to_index(): return map(to_index, input())

    def MII_split_to_index(): return map(to_index, input().split())

    # 入力全てを整数に変換したものの配列を受け取る
    def list_int_inputs(): return list(map(int, input()))

    LII = list_int_inputs

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

    # 2次元リスト化
    def LII_2D(rows_number): return [LII() for _ in range(rows_number)]

    def LII_split_2D(rows_number): return [LII_split() for _ in range(rows_number)]

    L, R, d = MII_split()
    amari = (R - L) % d
    ans = (R - L) / d
    if L % d + amari >= d or d == 1:
        ans += 1

    print(int(ans))
resolve()

Submission status: Wrong Answer

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

dlist = [i*d for i in range(100) ]

ans = 0

for a in dlist:
  if l<=a and a<=r:
    ans += 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

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

main()

Submission status: Wrong Answer

Solution code:
l = [int(s) for s in input().split()]

print(int(l[1] / l[2]) - int(l[0] / l[2]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math as ma
l,r,d = (int(x) for x in input().split())
L = ma.floor (l/d)
R = ma.ceil (r/d)
print (R-L)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    return

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

dd = int((R-L+1)/d)
print(dd)

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from math import *
l,r,d=map(int,input().split())
k=r-l+1
ans=k//d
print(ans)

Submission status: Wrong Answer

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


num1 = l // d
num2 = r // d

if l == d:
    num2 += 1
print(num2-num1)

Submission status: Wrong Answer

Solution code:

l, r, d = (int(x) for x in input().split())

tmp1 = r//d
tmp2 = l//d

if(tmp1%d == 0 and tmp2%d ==0):
    print(tmp1 - tmp2 + 1)
else:
    print(tmp1 - tmp2)

Submission status: Wrong Answer

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

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)

Submission status: Wrong Answer

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

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

res = r - l
if L == d:
    res += 1

print(res)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = (R//d) - (L//d)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
l,r,d=map(int,input().split())
v1 = r//d
v2 = l//d
if v2==1:
    v2-=1
print(abs(v1-v2))

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a=(R//d)-(L//d)

print(a)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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())
if l==1:
  a=0
else:
  a=l/d
print(int(r/d)-int(a))

Submission status: Wrong Answer

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

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 += rem
    if l>r:
        print(0)
    else:
        c=1
        while l+d<=r:
            c+=1
            l+=d
        print(c)



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

count = 0
for i in range(L, R + 1, d):
    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:
  print(b-a)
else:
  print(b)

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
# Coding is about expressing your feeling, and
# there is always a better way to express your feeling_feelme
import sys
import math
# sys.stdin=open('input.txt','r')
# sys.stdout=open('output2.txt','w')
from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=int(1e9 + 7)

l,r,d=iia()
print((r-l+1)//d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

diff = r-l+1
ans = diff//d

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

else:
  print(R//d - L//d)

Submission status: Wrong Answer

Solution code:
# 別変数の整数複数個
L, R, d = [int(x) for x in input().strip().split(" ")]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

l_d = math.floor(L/d)
r_d = math.floor((R-1)/d)

ans = r_d - l_d
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

for x in range(1, 100):
    if x >= l and x <= r and x % d == 0:
        count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if d != 1:
  print(int(r//d -l //d))
else:
  print(r-l+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((r-l+1) // d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = int((R-L)/d)+1
print(n)

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

Submission status: Wrong Answer

Solution code:
# itne me hi thakk gaye?
from math import *
a, b, c = map(int, input().split())
print((b-a+1)//c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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:
a,b,c=map(int,input().split())
n=a//c
y=b//c
print(y-n)

Submission status: Wrong Answer

Solution code:
L,R,d = map(int,input().split())
if d != 1:
  a = L//d
  b = R//d
  print(b-a)
else:
  print(R-L+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,k = map(int,input().split())
t = r-l+1
ans = t//k
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    l, r , d = map(int, input().split())
    ans = (r-l)//d
    if l%d == 0:
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

num1 = l // d
num2 = r // d

print(num2-num1)

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 = [int(s) for s in input().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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())
if not d == 1:
    print(R // d - L // d)
else:
    print(R-L)

Submission status: Wrong Answer

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

l_d = math.floor(L/d)
r_d = math.floor(R/d)

ans = r_d - l_d
print(ans)

Submission status: Wrong Answer

Solution code:
# Coding is about expressing your feeling, and
# there is always a better way to express your feeling_feelme
import sys
import math
# sys.stdin=open('input.txt','r')
# sys.stdout=open('output2.txt','w')
from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=int(1e9 + 7)

l,r,d=iia()
print((r-l)//d)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

def one_str():
    return input()

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

L, R, d = input_int()

mins = L//d
maxs = R//d

print(maxs-mins)

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
print(B//C-(A//C))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    l,r,d = IL()
    print(math.ceil((r-l)/d))
    return

if __name__=='__main__':
    Main()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import sys,math,collections,itertools
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

l,r,d=nm()

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

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    l,r,d = IL()
    print(math.ceil((r-l)//d))
    return

if __name__=='__main__':
    Main()

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

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

Submission status: Wrong Answer

Solution code:
LI = lambda: list(map(int,input().split()) )
MI = lambda: map(int,input().split())
SI = lambda: input()
II = lambda: int(input())
a,b,d = MI()
print(b//d-a//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:
# A

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

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

Submission status: Wrong Answer

Solution code:
import math
from collections import defaultdict

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())
c =0
for i in (L,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:
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
l,r,d=map(int,stdin.readline().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:
a,b,n=map(int,input().split())
print(b//n-a//n)

Submission status: Wrong Answer

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

Submission status: Accepted

Solution code:
n = input()
n = n.split(" ")
conta = 0
for num in range(int(n[0]), int(n[1])+1):
    if num % int(n[2]) == 0:
        conta += 1
print(conta)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().rstrip().split()))
resto=a[0]%a[-1]
if resto >0:
    o = a[0]+a[-1]- resto
else:
    o= a[0]
print((a[1]-o)//a[-1]+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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