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

Solution code:
"""
    Satwik_Tiwari ;) .
    12th july , 2020  - Sunday
"""

#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function

from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase

from itertools import *
import bisect
from heapq import *
from math import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
#If the element is already present in the list,
# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect
#If the element is already present in the list,
# the right most position where element has to be inserted is returned

#==============================================================================================

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

# inp = lambda: sys.stdin.readline().rstrip("\r\n")

#===============================================================================================
#some shortcuts

mod = 1000000007
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def out(var): sys.stdout.write(str(var))  #for fast output, always take string
def lis(): return list(map(int, inp().split()))
def stringlis(): return list(map(str, inp().split()))
def sep(): return map(int, inp().split())
def strsep(): return map(str, inp().split())
# def graph(vertex): return [[] for i in range(0,vertex+1)]
def zerolist(n): return [0]*n
def nextline(): out("\n")  #as stdout.write always print sring.
def testcase(t):
    for p in range(t):
        solve()
def printlist(a) :
    for p in range(0,len(a)):
        out(str(a[p]) + ' ')
def lcm(a,b): return (a*b)//gcd(a,b)
def power(a,b):
    ans = 1
    while(b>0):
        if(b%2==1):
            ans*=a
        a*=a
        b//=2
    return ans
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
def isPrime(n) : # Check Prime Number or not
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) :
        if (n % i == 0 or n % (i + 2) == 0) :
            return False
        i = i + 6
    return True

#===============================================================================================
# code here ;))


def solve():
    l,r,d =sep()
    print((r//d)-((l-1)//d))



testcase(1)
# testcase(int(inp()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(result)

Submission status: Accepted

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

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)

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)

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)

Submission status: Accepted

Solution code:
l, h, d = map(int, input().split())
c = 0
for num in range(l, h+1):
  if num % d == 0:
    c += 1
print(c)

Submission status: Accepted

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

ans = R//d - L//d

if L%d == 0:
    print(ans+1)
else:
    print(ans)

Submission status: Accepted

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

def get_input() -> tuple:
    """
    標準入力を取得する.

    Returns:\n
        tuple: 標準入力
    """
    L, R, d = list(map(int, input().split()))

    return L, R, d


def main(L: int, R: int, d: int) -> None:
    """
    メイン処理.

    Args:\n
        L (int): 整数（1 <= L <= R <= 100）
        R (int): 整数（1 <= L <= R <= 100）
        d (int): 整数（1 <= d <= 100）
    """
    # 求解処理
    ans = R // d - (L - 1) // d

    # 結果出力
    print(ans)


if __name__ == "__main__":
    # 標準入力を取得
    L, R, d = get_input()

    # メイン処理
    main(L, R, d)

Submission status: Accepted

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

Solution code:
# -*- coding: utf-8 -*-
# 標準入力を取得
L, R, d = list(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)

Submission status: Accepted

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

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)

Submission status: Accepted

Solution code:
#!/usr/bin/env pypy
l, r, d = map(int, input().split())
print(r//d - (l-1)//d)

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:
from sys import stdin
L, R, d = [int(_) for _ in stdin.readline().rstrip().split()]
ans = 0
for i in range(L, R+1):
    if i % d == 0:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = input().rstrip().split(' ')
l = int(input_line[0])
r = int(input_line[1])
d = int(input_line[2])

output = 0

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

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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(l, r, d):
    return r // d - (l-1) // d

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

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)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

L, R, d = LI()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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

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

    ans = num_R - num_L

    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(n2 - n1)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
#n = int(input())
l, r, d = map(int, sys.stdin.readline().split())
#s = input()
#a = list(map(int, sys.stdin.readline().split()))

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

print(ans)

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

print(len(ans))

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)

Submission status: Accepted

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

for i in range(a[0],a[1]+1):
    if i % a[2] == 0:
        counter += 1
print(counter)

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
l, r, d = map(int, input().split())
print(r // d - (l - 1) // d)

Submission status: Accepted

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

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

first = L + (D - (L % D)) % D
last = R - (R % D)
ans = 0
if L <= first <= R and L <= last <= R:
    ans = (last - first) // D + 1

print(ans)

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)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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)

Submission status: Accepted

Solution code:
l, r, d = map(int, input().split())
c = 0
x = (l // d) + 1
if(l % d == 0):
    c = 1
while(True):
    m = d * x
    x += 1
    if(m <= r):
        c += 1
    else:   break
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(counter)

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math

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

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

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

if __name__ == "__main__":
	main()

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)

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

print(r - l + 1)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(p)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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)

Submission status: Accepted

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

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)

Submission status: Accepted

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

Submission status: Accepted

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

x = L
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

Solution code:
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353

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

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

Submission status: Accepted

Solution code:
#!/usr/bin python3
# -*- coding: utf-8 -*-

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

if __name__ == '__main__':
    main()

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(i)
print(ans)

Submission status: Accepted

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

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

print(count)

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)

Submission status: Accepted

Solution code:
import sys

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


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Solution code:
def func(num, div):
    return num // div


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

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

Submission status: Accepted

Solution code:
# A - Number of Multiples
def main():
    L, R, D = map(int, input().split())
    print(R // D - (L - 1) // D)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lower, upper, d_baisuu = map(int, input().split())
 
cnt = 0
 
for num in range(lower, upper + 1):
    if (num % d_baisuu == 0):
        cnt += 1
 
print(cnt)

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)

Submission status: Accepted

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

Submission status: Accepted

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