peterverebics/CodeNet_Python_118 huggingface dataset:
h, a = map(int, input().split())

print((h - 1) // a + 1)
import math

if __name__ == '__main__':
    # a = int(input())
    # a, b = map(int, input().split())

    h, a = map(int, input().split())
    print(math.ceil(h / a))
H, A = [int(i) for i in input().split()]
print((H + A -1)//A)
a=input()
H,A=int(a.split()[0]),int(a.split()[1])
count=0
while H>0:
  H-=A
  count+=1
print(count)
h, a = map(int, input().split())
print( - ( - h // a))
h,a = map(int, input().split())
print(((h+a-1)//a))
#ABC153A
import sys
import math
H, A = map(int, sys.stdin.readline().split())

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


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

print(count)
H,A=map(int,input().split())
if H%A==0:
  print(H//A)
else:
  print(H//A+1)
import math
x,y = map(int,input().split())
s = math.ceil(x/y)
print(s)
# -*- coding: utf-8 -*-
from math import ceil
h,a = map(int, input().split())
print(ceil(h/a))
h, a = map(int, input().split())
print( int( (h+a-1)/a ) )
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:
    print(h // a)
else:
    print(h // a + 1)
h,a =map(int,input().split())
print((h+a-1)//a)
h,a=map(int,input().split())
print(h//a+(h%a>0))
h,a=map(int,input().split())

if(h%a == 0):
    print(h//a)
else: 
    print(h//a + 1)
import math
ha = list(map(int, input().split()))
res = math.ceil(ha[0] / ha[1])
print(res)
import sys
sys.setrecursionlimit(100000) 
H, A = map(int, input().split())

def calc_atack(H, A, counter =0):
    H -= A
    counter += 1
    if H <= 0:
        return counter
    else:
        return calc_atack( H, A, counter = counter)


print(calc_atack(H, A))
inp =input().split(" ")
ans = (int(inp[0])+int(inp[1])-1)//int(inp[1])

print("{}".format(ans))
h,a = map(int,input().split())
print((h+a-1)//a)
h, a = map(int, input().split())

i = 0
while h > 0:
  h -= a
  i += 1
else:
  print(i)
h,a = map(int,input().split())
if h % a == 0:
    print(h // a)
else:    
    print((h // a) + 1)
# -*- coding: utf-8 -*-
import math
H, A = map(int, input().split())
print(int(math.ceil(H/A)))
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())
ans = (h+a-1)//a
print(ans)
H, A = map(int, input().split())

ans = (H - 1) // A + 1
print(ans)
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())
ans = 0
while H > 0:
    H -= A
    ans += 1

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

print((a + b - 1) // b)
H,A=map(int,input().split())
print(H//A if H%A==0 else H//A+1)
import math
h, a = list(map(int, input().split()))
 
print(math.ceil(h/a))
#!/usr/bin/env python3
import sys


def solve(H: int, A: int):
    print(-(-H//A))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()
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())

    ans = 0

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

    print(ans)

        
if __name__ == '__main__':
    main()
H,A = map(int,input().split())
count =0
while H > 0:
    H -= A
    count +=1
print(count)
x = [int(i) for i in input().split(" ")]
floor = x[0] // x[1]
if x[0] % x[1] == 0:
  print(floor)
else:
  print(floor + 1)
# https://atcoder.jp/contests/abc153/tasks/abc153_a
H, A = map(int, input().split())

print((H + A - 1) // A)
x = input()
hp = int(x.split()[0])
attack = int(x.split()[1])
count = 1

while (hp - attack) > 0:
    count = count + 1
    hp = hp - attack
   
print(count)
h,a = map(int,input().split())
if(h%a == 0):
  print(int(h/a))
else:
  print(int(h/a)+1)
h,a=map(int, input().split())
res = int(h/a) + (1 if not h%a == 0 else 0)
print(res)
# coding: utf-8
# Your code here!


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

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

else:
    print(int(h/a))
# coding: utf-8
h,a = [int(x) for x in 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())

count=h//a
if h%a!=0:
  count+=1
print(count)
import sys
inputs = sys.stdin.readline()
inputs = inputs.split()
# inputs = inputs.split('')

H, A = int(inputs[0]), int(inputs[1])

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

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

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

print(math.ceil(h/a))
import math

Health, Attach = map(int, input().split())
attackCount = math.ceil(Health / Attach)

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

import math
print(math.ceil(H / A))
H,A=map(int,input().split())
ans=0
if H%A==0:
    print(H//A)
else:
    print(H//A+1)
a,b = list(map(int,input().split()))
if a % b == 0:
  print(a//b)
else:
  print(a//b+1)
H, A = map(int, input().split())
if H % A == 0:
  times = H // A
else:
  times = (H // A) + 1
  
print(times)
a,b=map(int,input().split())
x=0
for i in range(a):
    if 0<a-b:
        a-=b
        x+=1
    else:
        x+=1
        print(x)
        break
def resolve():
    H, A = map(int, input().split())
    Ans = H // A
    _Ans = H % A

    if _Ans >= 1 :
        print(Ans + 1)

    else :
        print(Ans)
        
resolve()
from sys import stdin
import math

def main():
    n,m = map(int,stdin.readline().split())
    print(math.ceil(n/m))
main()
h, a = map(int, input().split())
print(-((-h)//a))
l = list(map(int, input().split()))
if l[0]%l[1]==0:
    print(int(l[0]/l[1]))
else:
    print(l[0]//l[1]+1)
h,a = map(int,input().split())
print(h//a+1-int(h%a==0))
H, A = map(int, input().split())
cnt = 0
while H > 0:
  H -= A
  cnt += 1
print(cnt)
H, A = map(int, input().split())
if H % A == 0:
    print(H // A)
else:
    print(H // A + 1)
H,A = list(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(1+H//A)
yes="yes"
no="no"
Yes="Yes"
No="No"
h,a=map(int,input().split())
print(0--h//a)
hp,atk = map(int, input().split())

count = 0
while hp > 0:
    hp -= atk
    count += 1

print("{}".format(count))
import math

H, A = [int(n) for n in input().split()]

n = math.ceil(H / A)

print(n)
import math
tmp = input().split(" ")
 
HP = int(tmp[0])
attack = int(tmp[1])
 
print(math.ceil(HP/attack))
h, a = map(int, input().split())
if h%a == 0:
    print(h//a)
else:
    print(h//a+1)
h,a = map(int,input().split())
i = 0

while True:
  if a*i < h:
    i += 1
  else:
    break

print(i)
import sys
import math

def main():
    # sys.stdin = open('input153a.txt')
     
    h, a = map(int, input().split())

    print(math.ceil(h / a))

if __name__ == '__main__':
    main()
H, A = map(int, input().lower().split())
count = 0
while(True):
    H = H - A
    if H <= 0:
        count = count + 1
        break
    else:
        count = count + 1

print(count)
H,A=map(int,input().split())
if H%A==0:
    print(H//A)
else:
    print(H//A +1)
h,a=(int(x) for x in input().split())
count=0
while True:
	count+=1
	h-=a
	if h<=0:
		break
print(count)
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()
N, M = map(int, input().split())
if N % M == 0:
  print(N // M)
else:
  print(N // M + 1)
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
H, A = map(int, input().split())

kaisu = 0
for num in range(100000):
    H=H-A
    kaisu = kaisu + 1
    if H <= 0:
        break

print(kaisu)
from math import ceil
num = [int(_) for _ in input().split()]
print(ceil(num[0] / num[1]))
H,A = map(int,input().split())
b = H // A
c = H % A
if c != 0:
    b += 1
print(b)
H,A=(int(x) for x in input().split())
if H%A == 0:
 print(int(H/A))
elif H%A !=0:
 print(int(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())
ans = 0
while h > 0:
    h -= a
    ans += 1
print(ans)
h, a = map(int, input(). split())
n = 0
while True:
    h = h - a
    n = n + 1
    if h <= 0:
        break
print(n)
a,b = map(int,input().split())
print(a//b if a%b ==0 else a//b+1)
import math

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

print(math.ceil(H/A))
def main():
    H, A = map(int, input().split())
    ct = 0
    while H > 0:
        H -= A
        ct += 1
    print(ct)
    

main()
h,a = map(int,input().split())
import math
print(math.ceil(h/a))
import math
h,a = map(int, input().split())
print(math.ceil(h/a))
H,A=map(int,input().split());
print((H+A-1)//A);
H, A= map(int,input().split())
print(int((H-1)//A +1))
#!/usr/bin/env python3
import sys


def solve(H: int, A: int):
    print(int(H/A) if H%A==0 else int(H/A)+1)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()
h, a = map(int, input().split())
num = h // a + (1 if 0 != h % a else 0)
print(num)
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


H, A = list(map(int, sys.stdin.buffer.readline().split()))

ans = math.ceil(H / A)
print(ans)
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(H: int, A: int):
    from math import ceil
    print(ceil(H/A))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()
import math
H,A = [int(number) for number in input().split()]
print(math.ceil(H/A))
N = list(map(int, input().split()))
 
if N[0]%N[1] == 0:
  print(N[0]//N[1])
else:
  print(N[0]//N[1] + 1)
h, a = [int(i) for i in input().split()]
if h%a==0:
    print(h//a)
else:
    print(h//a+1)
from math import ceil
h, a = map(int, input().split())

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

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

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

    print(count)


if __name__ == "__main__":
    main()
H,A=map(int,input().split())
k=0
while H>0:
    H-=A
    k+=1
print(k)
h,a=map(int,input().split())

if h%a==0:
 print(h//a)
else:
 print(h//a+1)
a, b = list(map(int, input().split()))
c = a % b
if c == a:
  my_result = 1
elif c == 0:
  my_result = a / b
else:
  my_result = (a - c) / b + 1
print(int(my_result))
from math import ceil

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

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

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

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

if H<=A:
    print(1)
elif H%A==0:
    print(int(H/A))
else:
    print(int(H/A)+1)
import math
H,A = map(int,input().split())
X = math.ceil(H/A)
print(X)
H,A = map(int,input().split())
cnt = 0
while True:
    if H <= 0:
        print(cnt)
        break
    else:
        H -= A
        cnt += 1
import math
a,b = map(int,input().split())
count = math.ceil(a / b) 
print(count)
h,a=map(int,input().split())
b=int((h-1)/a)+1
print(b)
import math
h,a = list(map(int, input().split()))
print(math.ceil(h/a))
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
H, A = map(int, input().split())
kaisu=0
q,mod = divmod(H,A)

if mod==0:
    kaisu=q
else:
    kaisu=q+1


print(kaisu)
import math
H,A = map(int,input().split())
print(math.ceil(H/A))
h,a=map(int,input().split())
print((a+h-1)//a)
h,a=map(int,input().split())
if h%a!=0:
  print(h//a+1)
else:
  print(h//a)
def main():
    H, A = map( int, input().split())
    print((H+A-1)//A)
if __name__ == '__main__':
    main()
x,y=map(int,input().split())
if x%y==0:
    print(x//y)
else:
    print(x//y+1)
h,a=[int(i)for i in input().split()]
if h%a==0:
  print(h//a)
else:
  print(h//a+1)
h,a = input().split()
result = int(h)
times=0
while result > 0:
    result-=int(a)
    times+=1
print(times)
H,A = map(int, input().split())
print(H//A) if H%A == 0 else print(H//A + 1)
H,A=map(int,input().split())
B=H//A
if H%A==0:
    print(B)
else:
    print(B+1)
# coding utf-8
import math
H, A = map(int, input().rstrip().split())

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

# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print(math.ceil(H/A))
def solve():
    H, A = map(int,input().split())
    ans = H // A
    if H % A >= 1:
        print(ans + 1)
    else:
        print(ans)


if __name__ == '__main__':
    solve()
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 if h%a==0 else h//a+1)
h, a = map(int, input().split())
if h % a == 0:
    print(int(h / a))
else:
    print(int(h / a) + 1)
H, A = map(int, input().split())
i = 0
while H > 0:
  H -= A
  i += 1
print(i)
h, a = input().split()
h = int(h)
a = int(a)
c = 0

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

print(c)
from math import ceil
H, A = map(int, input().split())
print("{}".format(ceil(H / A)))
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


def main():
    H,A = map(int,input().split())

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

    print(res)



main()
import math
H,A = map(int, input().split())

print(math.ceil(H/A))
h,a = list(map(int, input().split()))
mod = 1
if h%a == 0:
    mod = 0
print(h//a + mod)
h,a=(int(x) for x in input().split())
i = 0
while h > 0:
    h = h - a
    i = i + 1
print(i)
a,b=map(int,input().split())

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

ans = -(-H // A)
print(ans)
h,a=map(int,input().split())

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

cnt = 0
while hp > 0:
    hp -= attack
    cnt += 1
    
print(cnt)
H , A = map( int,input().split() )

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

print(count)
import math
query=[int(x) for x in input().split()]
N = query[0]
K = query[1]
print(math.ceil(N/K))
import math

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

print(math.ceil(H / A))
h, a = map(int, input().split())
cnt = - ( -h // a)
print(cnt)
h,a=map(int,input().split())
if h<=a:
    print(1)
else:
    print(-(-h//a))
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(1 + H // A) if H % A != 0 else print(H // A)
h, a = map(int, input().split())
import math
print(int(math.ceil(h/a)))
x = [int(x) for x in input().split()]

import math

print(math.ceil(x[0]/x[1]))
h, a = [int(x) for x in input().split()]
print((h + a - 1)//a)
l = list(map(int, input().split()))
count=1
ll=l[0]
while ll-l[1]>0:
    count+=1
    ll=ll-l[1]
print(count)
h, a = [int(v) for v in input().split()]

count = h // a
if h % a != 0:
    count += 1

print(count)
#153_A
h, a = map(int, input().split())
print(-(-h//a))
h,a=map(int,input().split())

ans=0

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

n = ceil(h / a)
print(int(n))
a,b=input().split()
a=int(a)
b=int(b)
if a%b==0:
  print(int(a/b))
else:
  print(int((a/b)+1))
import numpy as np
N, a = list(map(int, input().split()))
 
print(int(np.ceil(N/a)))
H,A=[int(i) for i in input().split(" ")]
if H%A==0:
    print(H//A)
else:
    print(H//A+1)
h,a=[int(x) for x in input().split()]
if h%a==0:
    print(h//a)
else:
    print(h//a+1)
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
h,a = map(int, input().split())
r=h//a

if h-(r*a)!=0:
  r=r+1
print(r)
H,A=map(int,input().split())
i=0
if H/A-H//A > 0:
    print(H//A+1)
else:
    print(H//A)
h, a = map(int, input().split())
if 1 <= h <= 10000 and 1 <= a <= 10000:
    d = h // a
    if d * a < h:
        d += 1
    print(d)
H,A = map(int,input().split())
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)
import math
h,a = map(int,input().split())
print(str(math.ceil(h/a)))
import sys
import math
import bisect

def main():
    a, b = map(int, input().split())
    ans = (a + b - 1) // b
    print(ans)

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())
cnt = 0
while H > 0:
    H -= A
    cnt += 1
print(cnt)
h,a=map(int,input().split())
count=0
while h>0:
    h=h-a
    count+=1
print(count)
N, A =  map(int, input().split())

count = 0
while N > 0:
    N = N - A
    count = count + 1
print(count)
h, a = map(int, input().split())
print((h - 1) // a + 1)
import sys
 
for line in sys.stdin:
    h, a = list(map(lambda x: int(x), line.split()))
    hits = h // a
    if h % a == 0 and a > 0:
        print(hits)
    else:
    	print(hits + 1)
H, A = map(int, input().split())

ans = 0

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

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

while(hp>0):
    hp -= attack
    attack_count += 1
print(attack_count)
import sys
from itertools import count

H, A = map(int, next(sys.stdin.buffer).split())
for i in count(1):
  H -= A
  if H <= 0:
    break
print(i)
H, A = map(int, input().split())

if H % A == 0:
    print(H//A)
else:
    print(H//A+1)
# n,k,*a=map(int,open(0).read().split())

# h = int(input())
h, k = [int(x) for x in input().split()]
# k = int(input())

# ヨコ
# m = [int(x) for x in input().split()]

# タテ
# m = [int(input()) for _ in range(N)]

if h < k:
  print(1)

elif h/k == h//k:
  print(h//k)

else:
  print(h//k+1)
import math

def func():
    l = list(map(int, input().split()))
    try:
        for n in l:
            1<= n <= 10**4
            print( math.ceil(l[0] / l[1]) )
            break
    except:
            print("Error")

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

print(count)
H, A = map(int, input().split())
res = H // A + (H % A > 0)
print(res)
H,A=map(int,input().split())
if H%A==0:
  print(int(H/A))
else:
  print(int(H/A)+1)
hp, attack = input().split(' ')
print(int((int(hp) + int(attack) - 1) / int(attack)))
h,a = map(int,input().split())
h -= 1
print(1 + h // a)
h, a = map(int, input().split())

if h % a:
  print(h // a + 1)
else:
  print(h // a)
import math
H,A = map(int,input().split())
print(1 if H < A else math.ceil(H/A))
h,a=map(int,input().split())
print(h//a+1 if h%a!=0 else h//a)
h,a = list(map(int,input().split()))
amari = 0
if h%a>0:
    amari=1
print(h//a+amari)
H,A=map(int,input().split())
if H%A==0:
  ans=int(H/A)
else:
  ans=int(H/A)+1
print(int(ans))
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    H,A=map(int,input().split())
    print(-(-H//A))

if __name__ == '__main__':
    main()
# ABC153A

def f(h, a):
    ans = h // a
    if ans * a < h:
        ans += 1
    print(ans)

h, a = map(int, input().split())
f(h, a)
h,a = map(int,input().split())
ans = 0
while h>0:
  h-=a
  ans+=1
print(ans)
# -*- coding:utf-8 -*-
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())

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

print(ans)
import numpy

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

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

print(ans)
from math import ceil

def get_num_attacks(H, A):
  print(ceil(H/A))

if __name__ == "__main__":
  H, A = map(int, input().split())
  get_num_attacks(H, A)
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)
h,a=map(int, input().split())

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())
hp = h//a 
hp2 =h%a
#print(str(hp2))
if hp2 == 0:
    print(str(hp))
else:
    times = hp + 1
    print(str(times))
import math

h, a = map(int, input().split(' '))
if a >= h:
  print(1)
else:
  print(math.ceil(h/a))
H,A = map(int,input().split())

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

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

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

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

c = H // A
if (H % A == 0) :
    print(c)
else :
    print(c+1)
a, b = map(int, input().split())
q=a%b
if q==0:
    print(int(a/b))
else:
    print(int(a/b)+1)
a, b = map(int, input().split())

ans = 0

while a > 0:
    a -= b
    ans += 1

print(ans)
import math
x,y=map(int,input().split())
print(math.ceil(x/y))
h,a= map(int,input().split())
ans = int((h+a-1)/a)
print(ans)
import itertools
import sys
import math
import numpy as np
from collections import deque
from itertools import combinations
from functools import lru_cache
sys.setrecursionlimit(10**9)


def main():
    H,A = map(int,input().split())

    m,r = divmod(H,A)

    print(m if r == 0 else m + 1)

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

print(math.ceil(h/a))
def main():
    h,a=map(int,input().split())
    print(h//a+bool(h%a))
    
if __name__ == '__main__':
    main()
a,b=[int(i) for i in input().split()]
if(a%b==0):
    print(a//b)
else:
    print((a//b)+1)
H, A = map(int, input().split())
times, mod = divmod(H, A)
if mod != 0:
    times += 1
print(times)
h, a=input().split()
h = int(h)
a = int(a)

cnt = 0

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

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

print((H-1)//A+1)
i = list(map(int, input().split()))
if i[0] % i[1] > 0:
  print(i[0] // i[1] + 1)
else:
  print(int(i[0] / i[1]))
H, A = [int(i) for i in input().split()]

q, r = divmod(H, A)

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

if h % a != 0:
    ans = int(h / a) + 1
else:
    ans = int(h / a)

print(ans)