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: Runtime Error

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

min_range = L
max_range = R
n = d

a = min_range / n
b = max_range / n
c = int(b) - int(a) + 1

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

Submission status: Runtime Error

Solution code:
N = int(input())
X = str(input())

import functools


def popcount(bits: str):
    return len([elm for elm in bits if elm == '1'])


@functools.lru_cache(maxsize=200000)
def f(num):
    if num == 0:
        return 0
    else:
        pc = popcount('{:b}'.format(num))
        return 1 + f(num % pc)


def reverse_bit(bits: str, digit):
    def toggle(a):
        if a == '1':
            return '0'
        else:
            return '1'

    ret = list(bits)
    ret[digit-1] = toggle(bits[digit-1])
    return ''.join(ret)

def convert(x: str):
    ans = 0
    i = 0
    for elm in list(x)[::-1]:
        if elm == '1':
            ans += 2 ** i
        i += 1
    return ans


for i in range(1, N+1):
    bits = reverse_bit(X, i)
    pc = popcount(bits)
    # print(f'# {bits} {convert(bits)} {pc}')
    print(f(convert(bits)))

Submission status: Runtime Error

Solution code:
import math
n=int(input())
for i in range(1,n+1):
    nn=int(math.sqrt(i))
    min=int((nn+1)/math.sqrt(3))
    min1=int((nn+1)/math.sqrt(2))
    count=0
    for x in range(1,min+1):
        for y in range(x,min1+1):
            for z in range(y,nn+1):
                #print(x*x+y*y+z*z+x*y+y*z+z*x)
                if (x*x+y*y+z*z+x*y+y*z+z*x)==i:
                    if x==y and y==z and z==x:
                        count=count+1
                    elif x!=y and y!=z and z!=x:
                        count=count+6
                    else:
                        count=count+3
    print(count)

Submission status: Runtime Error

Solution code:
import math
n = int(input())
f = [0] * n
sqrt_n = int(math.sqrt(n)) +1
for i in range(n) :
    for x in range(1,sqrt_n) :
        for y in range(1,sqrt_n) :
            for z in range(1,sqrt_n) :
                if x*x+y*y+z*z+x*y+y*z+z*x == i+1 :
                    f[i] += 1
for _ in range(n) :
    print(f[_])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

cnt = 0
for i in range(1, N+1, 2):
  if l[i-1] % 2 != 0:
    cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
import math
n=int(input())
for i in range(1,n+1):
    nn=int(math.sqrt(i))
    min=int((nn+1)/3)
    min1=int((nn+1)/2)
    count=0
    for x in range(1,min+1):
        for y in range(x,min1+1):
            for z in range(y,nn+1):
                #print(x*x+y*y+z*z+x*y+y*z+z*x)
                if (x*x+y*y+z*z+x*y+y*z+z*x)==i:
                    if x==y and y==z and z==x:
                        count=count+1
                    elif x!=y and y!=z and z!=x:
                        count=count+6
                    else:
                        count=count+3
    print(count)

Submission status: Runtime Error

Solution code:
import math
import numpy as np
from collections import Counter

N = int(input())

if N == 1:
    print(0)
else:
    xyz_lim = int(math.sqrt(N-2)) - 1

    def f(x, y, z):
        return ((x+y)**2 + (y+z)**2 + (z+x) ** 2) // 2

    cnt = Counter()
    for _x in range(xyz_lim):
        for _y in range(xyz_lim):
            x, y = _x+1, _y+1
            cnt.update([f(x, y, _z+1) for _z in range(xyz_lim)])

    for _n in range(N):
        n = _n + 1
        print(cnt[n])

Submission status: Runtime Error

Solution code:
import math
N = int(input())
x = 0
y =0 
z =0
for m in range(1,N+1):
  l = math.sqrt(m)
  li = int(l)
  count =0
  for i in range(li):
    x = i+1
    for k in range(x):
      y = k+1
      for j in range(y):
        z = j+1
        n = x*x+y*y+z*z+x*y+y*z+z*x
        if n==m:
          if  x==y or y==z or z==x:
            if x==y and y == z:
              count =count+1
            else:
              count = count+3
          else:
            count =count+6
  print(count)

Submission status: Runtime Error

Solution code:
N=int(input())
ans=0
mul=1
while ans<=N:
    ans=6*(mul**2)
    mul+=1
ANS={}
for i in range(1,101):
    for j in range(i,101):
        for k in range(j,101):
            if i!=j and j!=k and k!=i:
                ANS[i*i+j*j+k*k+i*j+j*k+i*k]=6
            elif i==j and j==k and k==i:
                ANS[i*i+j*j+k*k+i*j+j*k+i*k]=1
            else:
                ANS[i*i+j*j+k*k+i*j+j*k+i*k]=3
for Z in range(1,N+1):
    if Z in ANS.keys():
        print(ANS[Z])
    else:
        print(0)

Submission status: Runtime Error

Solution code:
L = int(input())
R = int(input())
d = int(input())
chucun = []
for i in range(L,R+1):
    if i%d == 0:
        chucun.append(i)
print(len(chucun))

Submission status: Runtime Error

Solution code:
import math
n=int(input())
for i in range(1,n+1):
    nn=int(math.sqrt(i))
    min=int((nn+1)/3)
    min1=int((nn+1)/2)
    count=0
    for x in range(1,min+1):
        for y in range(x,min1+1):
            for z in range(y,nn+1):
                #print(x*x+y*y+z*z+x*y+y*z+z*x)
                if (x*x+y*y+z*z+x*y+y*z+z*x)==i:
                    if x==y and y==z and z==y:
                        count=count+1
                    elif x!=y and y!=z and z!=y:
                        count=count+6
                    else:
                        count=count+3
    print(count)

Submission status: Runtime Error

Solution code:
L=int(input())
R=int(input())
d=int(input())

min_range = L
max_range = R
n = d

a = min_range / n
b = max_range / n
c = int(b) - int(a) + 1

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

Submission status: Runtime Error

Solution code:
n=int(input())
for i in range(1,n+1):
 ans=0
 for x in range(1,i):
  for y in range(1,i):
   for z in range(1,i):
    if i==(x+y+z)**2-x*y-x*z-y*z:
      ans+=1
 print(ans)

Submission status: Runtime Error

Solution code:
L=int(input())

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

Submission status: Runtime Error

Solution code:
n=int(input())
for i in range(1,n+1):
 ans=0
 for x in range(1,i):
  for y in range(1,i):
   for z in range(1,i):
    if i==(x+y+z)**2-x*y-x*z-y*z:
      ans+=1
 print(ans)

Submission status: Runtime Error

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

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

print(r- l)

Submission status: Runtime Error

Solution code:
def main():
    a=int(input())
    for w in range(1,a+1):
        if w<5:
            print(0)
        else:
            total=0
            for i in range(1,w):
                for j in range(1,w):
                    for k in range(1,w):
                        if (i**2)+(j**2)+(k**2)+i*k+i*j+k*j==w:
                            total+=1
            print(total)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n=int(input())
for i in range(1,n+1):
 ans=0
 for x in range(1,i):
  for y in range(1,i):
   for z in range(1,i):
    if i==x*x+y*y+z*z+x*y+x*z+y*z:
      ans+=1
 print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=int(input())
for w in range(1,a+1):
    if w<5:
        print(0)
    else:
        total=0
        for i in range(1,w):
            for j in range(1,w):
                for k in range(1,w):
                    if (i**2)+(j**2)+(k**2)+i*k+i*j+k*j==w:
                        total+=1
        print(total)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

n = int(input())

a = [0]*n

for x in range(1, int(math.sqrt(n))+1):
    for y in range(1, x+1):
        for z in range(1, y+1):
            t = x**2+y**2+z**2+x*y+y*z+z*x-1
            if t >= n:
                break
            if ((x==y)and(y!=z))or((x==z)and(y!=x))or((y==z)and(x!=z)):
                a[t] += 3
            elif (x!=y)and(y!=z)and(x!=z):
                a[t] += 6
            else:
                a[t] += 1

for i in range(n):
    print(a[i])

Submission status: Runtime Error

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

print(cnt)

Submission status: Runtime Error

Solution code:
import math

n = int(input())

a = [0]*n

for x in range(1, int(math.sqrt(n))+1):
    for y in range(1, x+1):
        for z in range(1, y+1):
            t = x**2+y**2+z**2+x*y+y*z+z*x-1
            if t >= n:
                break
            if ((x==y)and(y!=z))or((x==z)and(y!=x))or((y==z)and(x!=z)):
                a[t] = 3
            elif (x!=y)and(y!=z)and(x!=z):
                a[t] = 6
            else:
                a[t] = 1

for i in range(n):
    print(a[i])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L=int(input())
R=int(input())
d=int(input())

a=L/d
b=R/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: Runtime Error

Solution code:
n = int(input())

a = [0]*n

for x in range(1, int(sqrt(n))+1):
    for y in range(1, x+1):
        for z in range(1, y+1):
            t = x**2+y**2+z**2+x*y+y*z+z*x-1
            if t >= n:
                break
            if ((x==y)and(y!=z))or((x==z)and(y!=x))or((y==z)and(x!=z)):
                a[t] = 3
            elif (x!=y)and(y!=z)and(x!=z):
                a[t] = 6
            else:
                a[t] = 1

for i in range(n):
    print(a[i])

Submission status: Runtime Error

Solution code:
a = 5 < a < 10
print "3"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int,input().split()))
O = [i for i in range(N) if(i%2==0 and A[i]%2==1)]
print(len(O))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
n=int(input())
for i in range(1,n+1):
  max = int(math.sqrt(i))
  result = 0
  for x in range(1,max+1):
    for y in range(1,max+1):
      for z in range(1,max+1):
        if x * x + y * y + z * z + x * y + y * z + x * z == i:
          result += 1
  print(result)

Submission status: Runtime Error

Solution code:
import math
n=int(input())
for i in range(1,n+1):
  max = int(math.sqrt(i))
  result = 0
  for x in range(1,max):
    for y in range(1,max):
      for z in range(1,max):
        if x * x + y * y + z * z + x * y + y * z + x * z == i:
          result += 1
  print(result)

Submission status: Runtime Error

Solution code:
for i in range(1, 1 + int(input())):

  match_pattern = []

  for x in range(1, 32):
    for y in range(1, 32):
      for z in range(1, 32):

        if i == (x**2 + y ** 2 + z ** 2 + x * y + y * z + z * x):
          match_pattern.append([x, y, z])
  
  print(len(match_pattern))

Submission status: Runtime Error

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l,d,r = map(int,input().split())
def div(n): 
  return True if n%r==0 else False
print(len(filter(div,range(l,d+1))))

Submission status: Runtime Error

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

te=R-L+1
num=0

for i in range(te):
    if L%d==0:
        num+=1
        L+=1
    else:
        L+=1
    
    print(i)

print(num

Submission status: Runtime Error

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

a=L/d
b=R/d
c=int(b)-int(a)+1
multiple = []
for i in range(1, c):
    multiple.append((int(a) + i ) * n)
print(len(multiple)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())

ch=[0]*10001

for i in range(1,100):
  for j in range(1,100):
    for k in range(1,100):
      x=i**2+j**2+k**2+i*j+j*k+k*i
      if x<=10000:
        ch[x]+=1
for i in range(n):
  print(ch[i+1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

n = int(input())
ans = []
for x in range(1, math.ceil(n**(1/2))+1):
    for y in range(1, math.ceil(n**(1/2))+1):
        for z in range(1, math.ceil(n**(1/2))+1):
            ans.append(x**2 + y**2 + z**2 + x*y + y*z + z*x)
ans.sort()
for i in range(1, n+1):
    tmp = 0
    for x in ans:
        if x == i:
            tmp += 1
        elif x > i:
            print(tmp)
            break

Submission status: Runtime Error

Solution code:
L, R, d = map(int, input().split())
count = 0
for (L,L<=R,L++){
  if (L%2 == 0){
    count +=1
    
  }
}
print(count)

Submission status: Runtime Error

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

a=L/d
b=R/d
c=int(b)-int(a)+1
multiple = []
for i in range(1, c):
    multiple.append((int(a) + i ) * n)
print(multiple)

Submission status: Runtime Error

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: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, raw_input().split())
print(int(b/c)-int(a/c+0.999)+1)

Submission status: Runtime Error

Solution code:
li = input().split()
count = 0
for num in range(li[0],li[1]+1):
  if num % li[2] == 0:
    count += 1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for k in c:
  if j%2==1 and int(k)%2==1:
    i +=1
  j +=1
print(i)

Submission status: Runtime Error

Solution code:
min = int(input())
max = int(input())+1
power = int(input())

count = 0
for i in range(min, max):
    if i % power == 0:
        count += 1

print(count)

Submission status: Runtime Error

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: Runtime Error

Solution code:
import math

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

num = 0
start_d = int(math.ceil(L / d))
end_d = int(math.floor(R / d))

print(end_d - start_d +1)

Submission status: Runtime Error

Solution code:
L=int(input)

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

Submission status: Runtime Error

Solution code:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s); sys.stdout.write('\n')
def wi(n): sys.stdout.write(str(n)); sys.stdout.write('\n')
def wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\n')


def main():
    n = ri()
    for nn in range(1, n+1):
        s = int(nn**0.5) + 2
        cnt = 0
        for x in range(1, s):
            for y in range(1, s):
                r1 = x*x + y*y + x*y
                if r1 > nn:
                    break
                for z in range(1, s):
                    r = x*x + y*y + z*z + x*y + y*z + z*x
                    if r > nn:
                        break
                    if r == nn:
                        cnt += 1
        wi(cnt)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math

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

num = 0
start_d = int(math.ceil(L / d))
end_d = int(math.floor(R / d))

return end_d - start_d +1

Submission status: Runtime Error

Solution code:
input_line = raw_input()
a = []
for m in input_line.split(" "):
	a += [int(m)]
print(int(a[1]/a[2])-int(a[0]/a[2]+0.999)+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

N = ii()

cnt = [0] * (10**4+1)


for i in range(1, 101):
    for j in range(1, 101):
        for k in range(1, 101):
            tmp = ((i+j)**2 + (j+k)**2 + (k+i)**2) // 2
            if tmp < 10**4 + 1:
                cnt[tmp] += 1

for i in range(1, N+1):
    print(cnt[i])

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

Solution code:
input_line = raw_input()
for m in input_line.split(" "):
	a += [int(m)]
print(int(a[1]/a[2])-int(a[0]/a[2]+0.999)+1)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

top = b // c
if a%c == 0:
  bottom = a//c - 1
else:
  bottom = a//c

print(top-bottom)

Submission status: Runtime Error

Solution code:
input_line = input()
for m in input_line.split(" "):
	a += [int(m)]
print(int(a[1]/a[2])-int(a[0]/a[2]+0.999)+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

for i in range(r, l-1, -1):
  if i % d == 0:
    maximum = i
    break

print(int((maximum - minimum) / d + 1))

Submission status: Runtime Error

Solution code:
from __future__ import print_function
import sys


if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


def solve():
    ans = 0
    for i in range(1, n+1):
        if i % 2 == 1 and a[i-1] % 2 == 1:
            ans += 1
    print(ans)
    return




n = RN()
a = RA()
solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

for i in range(r, l-1, -1):
  if i % d == 0:
    maximum = i
    break

print(int((maximum - minimum) / d + 1))

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a = input()
b = input()
c = input()
print(int(b/c)-int(a/c+0.999)+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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: Runtime Error

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: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Runtime Error

Solution code:
L, R, d = [int(digit) for digit in input()]
c = 0

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

print(c)

Submission status: Runtime Error

Solution code:
import math
import itertools as p
l = int(input())
r = int(input())
d = int(input())
count = 0
for i in range(l,r+1):
	if i%d == 0:
		count+=1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L, R, d = [int(digit) for digit in input()]
c = 0

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans = 0
for i,ai in enumerate(a):
  if (i+1)%2 == 1 and ai%2 == 1:
    ans += 1
print(ans)

Submission status: Runtime Error

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: Runtime Error

Solution code:
result = 0
for n in range (L, R + 1):
    if n % D == 0:
        result += 1
print(result)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
/*     <<<  J A I ~ S H R E E ~ R A M  >>>     */

// Title: aising2020_a.cpp
// dated: 11-07-2020 17:30:42
// Creator & Template by : Udit Gupta @luctivud


// #include "bits/stdc++.h"
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>

using namespace std;

const long long int MOD_JOHAN {1000000007};
const long long int MOD_LIGHT {998244353};
const long long int MAXN_EYEPATCH = 1e6 + 1LL;
const long long int MAXN_FULLMETAL = 501LL;

typedef long long int lld;
typedef unsigned long long int llu;
typedef vector<int> v_int;
typedef vector<lld> v_lld;
typedef pair<int, int> p_int;
typedef pair<lld, lld> p_lld;


#define                   GREED_FOR_SPEED   ios_base::sync_with_stdio(false); cin.tie(0)
#define             TESTCASES_ARE_THERE()   _SC4N(Test0xcs); TotalT35tC4ses = Test0xcs; while(Test0xcs--)
#define                  mems(A77AY,V4LU)   memset((A77AY), V4LU, sizeof((A77AY)))
#define   FOR4WD(IT7T, ST47T, E9xD, St3P)   for(auto IT7T = ST47T; IT7T < E9xD; IT7T += St3P)
#define   FOR8WD(IT7T, ST47T, E9xD, St3P)   for(auto IT7T = ST47T; IT7T > E9xD; IT7T -= St3P)
#define  FOR4NGE(IT7T, ST47T, E9xD, St3P)   for(auto IT7T = ST47T;((St3P<0) ? IT7T>E9xD : IT7T<E9xD); IT7T += St3P)
#define                              endl   "\n"
#define            FORE4CH(V3CT07_, IT7T)   for(auto IT7T = V3CT07_.begin(); IT7T != V3CT07_.end(); IT7T++)
#define                    INP4T(V3CT07_)   for(auto &V3CT07____IT7T : V3CT07_) _SC4N(V3CT07____IT7T)
#define                                PI   3.1415926535897932384626433832795
#define                          INF1N1TY   1000000000000000005LL;
#define                    A47L(V3CT07_t)   V3CT07_t.begin(), V3CT07_t.end()
#define             L3N(V3CT07_x, Typ30F)   (Typ30F) V3CT07_x.size()
#define                            un_map   unordered_map
#define                            un_set   unordered_set


template<typename T> void _SC4N(T &x) { 
    x = 0; bool neg = 0; 
    register T c = getchar();
    if (c == '-') neg = 1, c = getchar();
    while ((c < 48) || (c > 57)) c = getchar();
    for ( ; c < 48||c > 57 ; c = getchar());
    for ( ; c > 47 && c < 58; c = getchar() ) x= (x << 3) + ( x << 1 ) + ( c & 15 );
    if (neg) x *= -1;
}


void printYesNo(bool Expr, int YNType = 1, string FirstChoice = "Ud", string SecondChoice = "Ud") { 
    if (YNType == 1) puts(Expr ? "YES" : "NO");
    else if (YNType == 2) puts(Expr ? "Yes" : "No");
    else if (YNType == 3) puts(Expr ? "yes" : "no");
    else if (YNType == 4) cout << (Expr ? FirstChoice : SecondChoice);
}



void solveEach(lld TestCaseNumber = 1) {
    int l, r, d;
    cin >> l >> r >> d;
    cout << (r/d)-((l+d-1)/d) + 1;

    cout << "\n"; 
    return;
}


signed main() {

    // GREED_FOR_SPEED;

    lld Test0xcs = 0, TotalT35tC4ses = 1;

    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif 

    // TESTCASES_ARE_THERE()
        solveEach(TotalT35tC4ses - Test0xcs);
    return 0;
}

/*
THE LOGIC AND APPROACH IS MINE ( UDIT GUPTA )
SOME PARTS OF THE CODE MAY HAVE BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)ch|=spacelo &=_up change case
*/

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

t = int(input())
r = int(input())
s = int(input())
print(r//s - (t-1)//s)

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

#define ll long long int

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	    int l,r,d;
	    cin>>l>>r>>d;
  int c=0;
      for(int i=l;i<=r;i++)
      {
        if(i%d==0)
          c++;
      }
  cout<<c;

  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
  int l, r, d; cin >> l >> r >> d;

  int ans = 0

  for(int i = l; i <= r; i++){
    if(i % d == 0) ans++;
  }

  cout << ans << endl;
}

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEBUG(x) cout<<#x<<":"<<x<<"\n"
#define DEBUGS(v) cout << #v << ":";for(auto x:v){cout<<x<<" ";}cout<<"\n"
#endif
#ifndef __DEBUG__
#define CH_P(a) 
#define DEBUG(x) 
#define DEBUGS(v) 
#endif
#define TIMER_S(start) chrono::system_clock::time_point start = chrono::system_clock::now();
#define TIMER_E(end) chrono::system_clock::time_point end = chrono::system_clock::now();
#define TIME(start, end) cout << static_cast<double>(chrono::duration_cast<chrono::microseconds>(end - start).count()) << "ms" << "\n";
/* clang-format on */

int main() {
  ll l,r,d;
  cin >> l >> r >> d;
  ll ans=0;
  for (ll i = l; i <= r; i++) {
    if(i%d==0)ans++;
  }
  cout << ans << "\n";
  return 0;
}