peterverebics/CodeNet_Python_118 huggingface dataset:
import numpy as np

N, K = map(int, input().split())
p = np.array(list(map(int, input().split())))

begin = 0
till = K

max = np.sum(p[0:K])
partial = max
for i in range(N-K-1):
    partial = partial - p[begin] + p[till]
    if(max < partial):
        max = partial

    begin += 1
    till += 1

print((max + K) / 2)
import numpy as np
n, k = map(int,input().split())
p = list(map(int,input().split()))

e = [(i+1)/2 for i in p]
e = np.cumsum(e)
ans = 0
for i in range(n-k):
    ans = max(e[i+k]-e[i],ans)

print(ans)
N,K=map(int,input().split())
P=list(map(int,input().split()))
Ary=[]
a=0
for p in P:
    a+=(p+1)/2
    Ary.append(a)

left=0
ans=0
x=0
for right in range(K,N):
    x=Ary[right]-Ary[left]
    left+=1
    if ans<x:
        ans=x

print(ans)
def main():
    N,K = map(int, input().split())
    p = list(map(int, input().split()))
    
    csum = [sum(p[:i]) for i in range(1,K+1)]
    esum = [0]*(N-K+1)
    for i in range(N-K):
        csum.append(csum[-1]+p[i+K])
        esum[i] = csum[-1] - csum[i]
    print(  (max(esum)+K)*0.5  )
    return

if __name__=="__main__":
    main()
n,k = map(int,input().split())#サイコロの個数、「隣接した」サイコロを振る数
p = list(map(float,input().split()))#さいころの目の最大値
judge = []
ans = 0
for i in range(n-k):
    expect = 0
    for j in range(k):
        expect += (p[i+j] + 1)/2
    if ans < expect:
        ans = expect
print(ans)
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

p.sort(reverse=True)

e = 0

for i in range(K):
    e += (p[i] + 1) / 2

print(e)
n,k=map(int,input().split())
p=[int(x) for x in input().split()]
p.sort()
sum=0
for i in range(-k,0):
    sum += (p[i]+1)/2

print(sum)
x = list(map(int, input().split()))
y = list(map(int, input().split()))
y = [i/2+0.5 for i in y]
max_value = 0
for i in range(0, x[0]-x[1]+1):
  value = sum(y[i:i+4])
  max_value = max(max_value, value)
print(max_value)
N, K=map(int,input().split())
P=list(map(int,input().split()))
Sum=[0]* (N + 1)
for i in range(1,N-1):
    Sum[i+1]=Sum[i]+(P[i]+1)/2.0
Ans=0
for i in range(N-K+1):
    Ans=max(Ans,Sum[i+K]-Sum[i])
print(Ans)
n, k = map(int, input().split())
a = list(map(int, input().split()))

sum_tmp = sum(a[:3])
sum_max = sum_tmp
for i in range(3,len(a)):
    sum_tmp += a[i] - a[i-k]
    if sum_tmp > sum_max:
        sum_max = sum_tmp
print((sum_max + k)/2)
N, K = map(int, input().split())
P = list(map(int, input().split()))
if len(list(set(P))) == 1:
  print((P[0] + 1) / 2)
  exit()
sums = []
for i in range(N - K + 1):
  sums.append(sum(P[i:i + K]))
sums.sort()
print((sums[-1] + K) / 2)
N,K = map(int,input().split())
ps = list(map(int,input().split()))

dicesSum=[]
l1=ps[0:K]
dicesSum.append(sum(l1))

if K==N:
    exp= (K+ dicesSum[0])/2
    print(exp)
else:
    for i in range(1,N-K+1):
        dicesSum.append(dicesSum[i-1]-ps[i-1]+ps[i+K-1])
    print(dicesSum)
    max_value = max(dicesSum)
    exp= (K+ max_value)/2
    print(exp)
N,K = map(int,input().split())
p = list(map(int,input().split()))
total = sum(p[0:K])
if N != K:
  for i in range(N-K):
    if p[i] < p[i+K]:
      total = total - p[i] + p[i+K]
  total += K
else:
  total = sum(p)
total = K + total
print(total/2)
def main():
    import sys
    import numpy as np
    input = sys.stdin.readline

    N, K = map(int, input().split())
    P = np.array(list(map(float, input().split())))
    p_cumsum = np.cumsum(P)

    ans = 0
    for i in range(len(p_cumsum)-K):
        ans = max(ans, p_cumsum[i+K]-p_cumsum[i])
    ans = (K + ans) * 0.5

    print(ans)

if __name__ == '__main__':
    main()
N,K=map(int,input().split())
p = list(map(int,input().split()))
ki=[]


m=0
ml=[]
if(K!=1):
    for i in range(N-K):
        tmp=0
        tmpl=[]
        for j in range(i,K+i):
            tmp+=p[j]
            tmpl.append(p[j])
        if(tmp > m):
            m=tmp
            ml=tmpl
else:
    ml=[max(p)]
kitai=0
for pi in ml:
    for i in range(1,pi+1):
        kitai+=i/pi

print(kitai)
n,k = map(int, input().split())
p = list(map(int, input().split()))
for i in range(n):
    p[i] = (p[i] + 1)/2
ans = 0
tmp = 0
for i in range(k):
    tmp += p[i]
for i in range(1,n - k + 1):
    tmp = tmp - p[i - 1] + p[i + k - 1]
    if ans < tmp:
        ans = tmp
print("{:.10f}".format(ans))
N,K=map(int,input().split())
A=list(map(int, input().split()))
cnt=0
for i in range(N):
    if K+i<=N:
        if cnt<=sum(A[i:K+i]):
            B=A[i:K+i]
res=[]
for b in B:
    tmp=0
    for i in range(1,b+1):
        tmp+=(i/b)
    res.append(tmp)
print(sum(res))
N,K,*P = map(int,open(0).read().split())
m = [0]*N
E = [((n+1))/2 for n in range(1,1001)]
print(E[:N])
for i in range(0,N-K+1):
  tmp_sum = 0
  for j in range(K):
    tmp_sum+=E[P[i+j]-1]
  m[i]=tmp_sum
print(max(m))
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = 0
tmp = sum(p[:k])
for i in range(k,n):
    tmp += p[i]-p[i-k]
    ans = max(ans, tmp)
print('{:.12f}'.format(ans))
import sys
n, k = map(int, sys.stdin.readline().rstrip().split())
pi = list(map(int, sys.stdin.readline().rstrip().split()))
pi.sort()
pi = pi[::-1]
res = 0
for i in range(k):
    if pi[i] % 2 == 0:
        res += pi[i] / 2 + 0.5
    else:
        res += pi[i] // 2 + 1
print(res)
def main():
    H,A  = map(int, input().split()) 
    print(-(-H//A))



if __name__ == '__main__':
    main()
import math

i, j = map(int, input().split())

print(math.ceil(i / j))
import math

H,A = map(int, input().split())
print(math.ceil(H/A))
H, A = map(int, input().split())
print(H//A if H % A == 0 else H//A+1)
H, A = map(int, input().split())

tenpH = H
for n in range(10000):
    tenpH = tenpH - A

    if(tenpH <= 0):
        print(int(n+1))
        break
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def solve(inp):
    import math
    (H, A) = map(int, inp.readline().strip().split(' '))

    r = math.ceil(H / A)
    return r


def main():
    import sys
    result = solve(sys.stdin)
    if result is not None and result != '':
        print(result)


if __name__ == '__main__':
    main()
h,a = map(int,input().split())

print(h//a if h%a == 0 else h//a +1)
h, a = map(int, input().split())

if h % a == 0:
  print(h//a)
else:
  print(h//a + 1)
def main():
    h, a = map(int, input().split())
    if h % a == 0:
        print(h // a)
    else:
        print(h // a + 1)


if __name__ == "__main__":
    main()
h,a=map(int,input().split())
ans=h//a
if h%a!=0:
    ans+=1
print(ans)
import math

h,a = (int(x) for x in input().split())
print(math.ceil(h/a))
H, A = map(int, input().split())
print((H + A - 1) // A)
a,b=map(int,input().split())
if a%b == 0:
    print(a//b)
else:
    print(a//b+1)
H, A = map(int, input().split())
c = int(H / A)
if H % A != 0:
    c += 1
print(c)
a = 0

li = input().split()
li = [int(i) for i in li]

while 0 < li[0]:
    a += 1
    li[0] -= li[1]

print(a)
h, a = map(int, input().split())

div, mod = divmod(h, a)

if mod > 0:
    print(div + 1)
else:
    print(div)
import math

h, a = list(map(int, input().split()))
result = math.ceil(h / a)
print(result)
import math

H, A = map(int, input().split())
print(math.ceil(H / A))
# A - Serval vs Monster
def main():
    H, A = map(int, input().split())
    print((H + A - 1) // A)


if __name__ == "__main__":
    main()
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

def main():
    H,A=mis()
    print(math.ceil(H/A))


main()
def main():
    h, a = map(int, input().split())
    if h % a == 0:
        ans = h // a
    else:
        ans = h // a + 1
    print(ans)

if __name__ == '__main__':
    main()
# -*- coding: utf-8 -*-
H, A = map(int, input().split())
ans = H // A
if H % A == 0:
  print(ans)
else:
  print(ans + 1)
h,a=map(int,input().split())
x=0
if h%a>0:
  x=1
print(h//a+x)
#!/usr/bin/env python3
H, A = map(int,input().split())
count=0
while H>0:
    count+=1
    H-=A
print(count)
H, A = map(int, input().split())


ans = 0
while H > 0:
  ans += 1
  H -= A

print(ans)
import math
h, a = map(int, input().split())
print(math.ceil(h/a))
h,a=map(int,input().split())
print(h//a if h%a==0 else h//a+1)
import math
h, a = map(int, input().split())
print(math.ceil(h / a))
import math
h,a=map(int,input().split())

print(math.ceil(h/a))
h,a = map(int, input().split())
n = h//a
m = h%a
if m == 0:
    print(n)
else:
    print(n + 1)
from sys import stdin
H,A = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
while True:
    H -= A
    ans += 1
    if H <= 0:
        break
print(ans)
import math
H, A = map(int, input().split())

print(math.ceil(H / A))
H, A = list(map(int, input().split()))

cnt = 0
while H > 0:
    cnt += 1
    H -= A
print(cnt)
def main():
    
    h,a = map(int, input().split())

    if h <= a:
        print(1)

    elif h%a== 0:
        print(h//a)
    else:
        print(h//a+1)


if __name__ == '__main__':
    main()
h,a = map(int,input().split())
if h % a == 0:
  print(h//a)
else:
  print(h//a+1)
H, A = map(int, input().split())

count =0
while True:
    H = H - A
    count += 1
    if H <= 0:
        break
    
print(count)
h , a = map(int,input().split(" "))

if h % a == 0:
    ans = h // a
else:
    ans = h // a  + 1
print(ans)
h,a = map(int,input().split())

if h%a==0:
  print(h//a)
else:
  print(h//a+1)
a, b = map(int, input().split())
ans = a//b
if a % b != 0:
    ans += 1

print(ans)
import sys
import math
ha=input().rstrip().split(" ")
h=int(ha[0])
a=int(ha[1])
i=0
hp=h
while hp>0:
    hp=hp-a
    i=i+1
print(i)
[H,A] = list(map(int,input().split()))

output = H//A+1
if H%A==0:
    output += -1
print(output)
def main():
    h, a = map(int, input().split())

    ans = 0
    while h > 0:
        h -= a
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()
h,a=map(int,input().split())
if h%a==0:
    print(int(h/a))
else:
    print(int(h/a+1))
print((lambda x: (x[0]-1)//x[1]+1)(list(map(int,input().split()))))
data = input().split()

h = int(data[0])
a = int(data[1])

div = h // a

if h % a != 0:
  div += 1

print(div)
Input1 = list(map(int,input().split()))
H = Input1[0]
A = Input1[1]

import math
Ans = math.ceil(H / A)

print(Ans)
H, A = map(int, input().split())

i = 0

while H > 0:
  H -= A
  i += 1
  
print(i)
import math

a,b = map(int, input().split())


if a % b == 0:
    ans = math.floor(a / b)
else:
    ans = math.floor(a / b) + 1

print(ans)
a,b=(int(x) for x in input().split())
sum=0
while a>0:
    a-=b
    sum+=1
print(sum)
A=[int(y) for y in input().split()]

if A[0]%A[1]==0:
   print(A[0]//A[1])
else:
   print(A[0]//A[1]+1)
H,A=map(int,input().split())

a=0

while H>0:
  H=H-A
  a+=1
  
print(a)
hp, attack = map(int, input().split())
print(hp // attack ) if hp % attack == 0 else print(hp // attack + 1)
x, y = map(int,input().split())

if x % y == 0:
  ans = x // y
else:
  ans = x // y + 1
 
print(ans)
H, A = map(int, input().split())
count = 0
while(1):
    count += 1
    H = H - A
    if H <= 0:
        break
print(count)
import math
s = list(map(int, input().split()))
print(str(math.ceil(s[0] / s[1])))
h, a = map(int, input().split())
print(h // a if h % a == 0 else h // a + 1)
H,A=map(int,input().split())
print((H+A-1)//A)
H,A=map(int,input().split())
if H%A==0:
    print(H//A)
else:
    print(H//A+1)
#Macで実行する時
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	#print(name)
	sys.stdin = open(name)

a, b = map(int,input().split())

c = int(a/b)

if a%b!=0:
    c+=1

print(c)
H, A = list(map(int, input().split()))
print((H+A-1)//A)
H,A = map(int, input().split())
t = 0

if H <= A:
    # print(str(t) + 'の攻撃で、〇〇は倒れた')
    print(1)
else:
    while H > 0:
        H -= A
        t += 1
        # print('◆◆の攻撃' + str(A) + 'のダメージ' + '、〇〇の残り体力' + str(H))
    else:
        # print(str(t) + '回の攻撃で、〇〇は倒れた')
        print(t)
import math


def solve(h, a):
    return math.ceil(h / a)


def main():
    h, a = map(int, input().split())

    ans = solve(h, a)
    print(ans)


main()
h, a = map(int, input().split())

n = 0
while h > 0:
    h = h - a
    n += 1
print(n)
import math
H, A = map(int, input().split())
print(math.ceil(H / A))
h,a=map(int,input().split());print((h+a-1)//a)
import math

H,A=map(int, input().split())

print(int(math.ceil(H/A)))
h, a = map(int, input().split())

num = 0
while(1):
    num += 1
    h -= a
    if h <= 0:
        print(num)
        break
H, A=list(map(int, input().split()))
if H%A==0:
    print(H//A)
else:
    print(H//A+1)
H, A = map(int, input().split())

X = H//A

print(X if H%A == 0 else X+1)
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

h,a = map(int, input().split())

# 切り上げ
print((h+a-1)//a)
h,a=map(int, input().split())
n=(h-1)//a+1
print(n)
h, a = map(int, input().split())
ttk = h // a
if h%a != 0:
    ttk += 1
else:
    ttk = ttk
print(ttk)
h, a = map(int,input().split())
ans = h//a
if h%a!=0:
    ans+=1
print(ans)
h, a = [int(x) for x in input().split()]

if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)
h,a = map(int,input().split())
count = 0

while h > 0:
  h -= a
  count+=1
print(count)
import math
a,b=map(int,input().split())

print(math.ceil(a/b))
H, A = map(int, input().split())
i = 0
while H > 0:
  H = H - A
  i = i + 1
print(i)
import math
H,A=map(int, input().split())
print(math.ceil(H/A))
import numpy as np
H, A =map(int, input().split())
print(int(np.ceil(H / A)))
myinput = input()
mylist = list(map(int, myinput.split(" ")))
H = mylist[0]
A = mylist[1]
x = 0
while H > 0:
  H -= A
  x += 1
print(x)
import math

a,b = map(int , input().split())

num = a/b
print(math.ceil(num))
def solve():
    h, a = map(int, input().split())
    print(-(-h//a))

if __name__ == '__main__':
    solve()
import math
def A():
    temp = [int(i) for i in input().split()]
    print(int(math.ceil(temp[0]/temp[1])))

A()
h, a = map(int, input().split())
r = h // a
if h % a:
  r += 1
print(r)
h,a=map(int,input().split())
print((h-1)//a+1)
h,a = map(int,input().split())
if h%a==0:
  print(h//a)
else:
  print(h//a+1)
def main():
    a, b = map(int, input().split())
    if a % b != 0:
        print(a // b + 1)
    else:
        print(a // b)


if __name__ == "__main__":
    main()
import math
H, A = map(int, input().split())
print(math.ceil(H/A))
H, A = map(int,input().split())

if H % A == 0:
    print(H // A)
else:
    print((H // A) + 1)
x = input().split()
h = int(x[0])
a = int(x[1])
count = 0
while h > 0:
  count += 1
  h = h - a
print(count)
L = input().split()
H, A = int(L[0]), int(L[1])

t = 0
while H > 0:
    H -= A
    t += 1
print(str(t))
H, A = map(int, input().split())

if H % A == 0:
    ans = H // A
else:
    ans = H // A + 1
    



print(ans)
x,y=map(int,input().split())
a = x // y
if x%y:a+=1
print(a)
h, a = input().split()
h = int(h)
a = int(a)
x = a
attack = 1

while h > x :
    h -= x
    attack += 1

print(attack)
h, a = map(int,input().split())
ans = h // a
if (h % a != 0):
    ans += 1
print(ans)
import math

H,A=map(int,input().split())
print(math.ceil(H/A))
a=input().split()
(n,m)=map(int,a)
if n%m==0:
    print(n//m)
else:
    print((n+m-(n%m))//m)
h, a = [int(i) for i in input("").split(" ")]
print((h+a-1)//a)
H,A=map(int,input().split())

if(H%A==0):
    print(H//A)
else:
    print(H//A+1)
import math
H,A = map(int, input().split())
print(math.ceil(H/A))
import math
h,a = map(int,input().split())
print(math.ceil(h/a))
H, A = map(int,input().split())
i = 1

while 0 < (H-A):
    H = H - A
    i = i+1

print(i)
z=list(map(int,input().split()))
a=z[0]//z[1]
if z[0]%z[1]!=0:
       a+=1
print(a)
def solve(string):
    h, a = map(int, string.split())
    return str((h - 1) // a + 1)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))
h, a = map(int, input().split())

if h%a==0:
	print(h//a)
else:
	print(h//a+1)
import math
a,b=map(int,input().split())
print(math.ceil(a/b))
from math import ceil
h, a = map(int, input().split())
print(ceil(h/a))
h, a =map(int, input().split())
print(h//a + 1 if h % a != 0 else h//a)
h, a = map(int, input().split())
cnt = 0
while h > 0:
    cnt += 1
    h = h - a
print(cnt)
H, A = list(map(int, input().split()))

ans = (H + A - 1 ) // A
print(int(ans))
H,A = map(int,input().split())

if(H%A > 0):
  print(H//A+1)
else:
  print(H//A)
h, a=map(int,input().split())
if h%a == 0:
    count=h//a
else:
    count = h//a+1
print(count)
a,b = map(int, input().split())
if a%b == 0:
  print(a//b)
else:
  c = a//b
  print(c+1)
H,A = map(int,input().split())
 
i = 1
while (A*i < H):
    i = i+1

print(i)
H, A = map(int, input().split())

c = 0
while H > 0:
    H -= A
    c += 1

print(c)
import math
a,b = map(int,input().split())
print(math.ceil(a/b))
h,a=map(int, input().split())
print((h-1)//a+1)
H, A = map(int, input().split())

if H % A == 0:
    print(H // A)
else:
    print((H // A) + 1)
from sys import stdin

H,A = [int(x) for x in stdin.readline().rstrip().split()]
if H%A==0:
    print(int(H/A))
elif A>H :
    print(1)
else :
    print(1+int(H/A))
h,a = map(int,input().split())
print(h//a if h%a == 0 else h//a+1)
import math
H,A=map(int,input().split())
print(math.ceil(H/A))
a,b=map(int,input().split())
print((a+b-1)//b)
h,a = map(int,input().split())
if h % a == 0:
  ans = h // a 
else:
  ans = (h // a) + 1
print(ans)
H, A = map(int, input().split())
print(H // A if H % A == 0 else H // A + 1)
h,a = input().split()
h = int(h)
a = int(a)

ans = h//a
if(h%a!=0):
    ans+=1
print(ans)
H = input()
arr = [int(i) for i in H.split(' ')]
count = 1
if(arr[0]<arr[1]):
	print(count)
else:
	while arr[0]>arr[1]:
		arr[0] = arr[0] - arr[1]
		count = count + 1
	print(count)
h, a = map(int, input().split())
i = 0
while h > 0:
    h -= a
    i += 1

print(i)
import math
H, A = [int(x) for x in input().split()]
print(math.ceil(H/A))
H, A = map(int, input().split())

print((H + A - 1)//A)
H,A=map(int,input().split())
ans=0
while H>0:
    H=H-A
    ans+=1
print(ans)
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

h, a = MAP()
print(h//a) if h % a == 0 else print(1 + h//a)
# A - Serval vs Monster
# https://atcoder.jp/contests/abc153/tasks/abc153_a?lang=en
# s[0],[1]
# a = input().split()strs
def main():
  s = list(map(int,input().split()))
  hp = s[0]
  ad = s[1]
  ans = int(hp / ad)
  if(ans * ad < hp):ans = ans + 1
  print(ans)
if __name__ == '__main__':
  main()
import math
H,A=map(int, input().split())
print(math.ceil (H/A))
h,a = list(map(int, input().split())) 
import math
print(math.ceil(h/a))
h , a = map(int , input().split())
ans = 0

while h > 0:
    h -= a
    ans += 1
print(ans)
h,a=map(int,input().split())
count=0
while True:
    h-=a
    count+=1
    if h<=0:
        print(count)
        exit()
from math import ceil
h,a = map(int,input().split())

print(ceil(h/a))
n,k=map(int,input().split())
print((n-1)//k+1)
from sys import stdin
lines = stdin.readlines()
 
H, A = map(int, lines[0].split())

cnt = 1
while cnt <= 10000:
  if cnt * A >= H:
    print(cnt)
    break
  cnt += 1
H, A = map(int,input().split())
if H <= A:
  print(1)
else:
  if H%A==0:
    print(H//A)
  else:
    print(H//A+1)
h, a = map(int,input().split())
if h%a==0:
    print(h//a)
else:
    print(h//a+1)
h, a = map(int, input().split())
print(int((h-0.1)//a + 1))
h,a = map(int,input().split())
ans = 0
for _ in range(h):
  h -= a
  ans += 1
  if h <= 0:
    break
print(ans)
h, a = map(int, input().split())
print((h + a - 1) // a)
a,b=map(int,input().split())
print(0--a//b)
a,b=map(int,input().split(' '))
print((a+b-1)//b)
h, a = map(int, input().split())

cnt = 0
while h > 0:
    h -= a
    cnt += 1

print(cnt)
H, A = map(int,input().split())
print( H//A if H%A == 0 else H//A+1)
h, a = list(map(int, input().split()))
print((h+a-1)//a)
i = list(map(int, input().split()))
count = 0
if i[0] <= i[1]:
    print("1")
else:
    while i[0] > 0:
        i[0] -= i[1]
        count += 1
    print(count)
h, a = map(int, input().split())
if (h % a == 0):
    print(h // a)
else:
    print(h // a + 1)
s=list(map(int,input().split()))
a=s[0]//s[1]
if s[0]%s[1]==0:
  print(int(a))
else:
  print(int(a+1))
h,a = map(int,input().split())
ans = (h//a)
if h%a==0:
    print(ans)
else:
    print(ans+1)
import math
h, a = map(int, input().split())

print(math.ceil(h / a))
h,a=map(int,input().split())
ans=0
while h > 0:
    h -= a
    ans += 1
print(ans)
H, A = map(int, input().split())

if H%A==0:
  ans = int(H/A)
else:
  ans = 1 + int(H/A)

print(ans)
a,b=input().split()
print(-(-int(a)//int(b)))
import math

H, A = map(int, input().split(' '))
print(math.ceil(H/A))
h,a = [int(x) for x in input().split()]
n = 0
while(h>0):
	h = h - a
	n = n + 1
print(n)
H,A=map(int,input().split())
count=0
while H>0:
    H=H-A
    count=count+1
print(count)
h, a = map(int, input().split(' '))
print(h // a + 1 if h % a != 0 else h // a)
import math

H, A = [int(x) for x in input().split()]
print(math.ceil(H/A))
h, n = map(int,input().split())
ans = int(h // n)
if h % n:
    ans += 1
print(ans)
H,A = map(int,input().split())
if A == 0:
    print(0)
b = H/A//1
if H/A > b:
    print(int(b+1))
else:
    print(int(b))
H,A=map(int,input().split())
count = 0
while H > 0:
  count+=1
  H -= A
print(count)
H, A = map(int, input().split())

if H % A == 0:
    print(H//A)
else:
    print(H//A + 1)
h,a=map(int,input().split())
print(h//a+1 if h%a else h//a)
# coding: utf-8
# Your code here!
 
a = input().split(" ")
H = int(a[0])
A = int(a[1])
ans = 0
while H > 0:
    H -= A
    ans += 1
print(ans)
#a,b = map(int, input().split())
import math
if __name__ == "__main__":
    H,A = map(int,input().split())
    print(math.ceil(H / A))
import math
h,a=map(int,input().split())
print(math.ceil(h/a))
# coding: utf-8

(h,a) = map(int, input().rstrip().split(" "))

ans = int(h/a) + min(1, h % a)
print(ans)
H, A = map(int,input().split())
count = 0
while H > 0:
  H -= A
  count += 1
  
print(count)
import math
h, a = list(map(int, input().split()))

print(math.ceil(h/a))
def resolve():
    import sys
    input = sys.stdin.readline
    
    H, A = map(int, input().split())

    d = H // A
    r = H % A

    if r != 0:
        print(d + 1)
    else:
        print(d)


if __name__ == "__main__":
    resolve()
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    print(str(math.ceil(hp / attack)))


if __name__ == '__main__':
    main()
H , A = (int(x) for x in input().split())
count = 0

while H > 0:
    H = H - A
    count += 1


print(count)
import math

hp , attack = map(int,input().split())

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.ceil(hp / attack))

print(int(ans))
import math
H, A = map(int, input().split())
 
# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print((H+A-1) // A)
H, A = map(int,input().split())
 
for i in range(H+1):
    if H > 0:
        H = H - A
    else:
        print(i)
        break
H,A = map(int,input().split())
if H%A == 0:print(H//A)
else : print(H//A+1)
H, A = map(int, input().split())
print((H-1)//A+1)
import math
h, a = map(int,input().split())
print(math.ceil(h/a))
a, b = map(int, input().split())
if a % b == 0:
  print(a // b)
else:
  print(a // b + 1)
s,a=input().split()
ss=int(s)
aa=int(a)
c=0 
while ss>0:
    c=c+1
    ss=ss-aa
print(c)
import math

input = input().split()
h = int(input[0])
a = int(input[1])

answer = int(math.ceil(h / a))
print(answer)
l = list(map(int, input().split()))

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H > 0:
        H -= A
        cnt += 1
    return cnt

print(attack(l))
H,A = map(int,input().split())
i = 1
while A < H:
        H = H - A
        i += 1 
print(i)
import math
a, b = map(float, input().split())
x = a / b
if (x.is_integer() == False):
    print(math.ceil(x))
else:
    print(int(x))
#N = int(input())
H,A = list(map(int,input().split()))
#A = [int(input()) for i in range(M)]
print((H+A-1)//A)
def main():
    h, a = map(int, input().split())

    print(h // a if h % a == 0 else h // a + 1)


if __name__ == '__main__':
    main()