Problem:
 Score : 100 points    Problem Statement Serval is fighting with a monster.  The health of the monster is H .  In one attack, Serval can decrease the monster's health by A .
There is no other way to decrease the monster's health.  Serval wins when the monster's health becomes 0 or below.  Find the number of attacks Serval needs to make before winning.      Constraints  1 \leq H \leq 10^4  1 \leq A \leq 10^4  All values in input are integers.         Input Input is given from Standard Input in the following format:  H  A       Output Print the number of attacks Serval needs to make before winning.        Sample Input 1 10 4      Sample Output 1 3   After one attack, the monster's health will be 6 .  After two attacks, the monster's health will be 2 .  After three attacks, the monster's health will be -2 .   Thus, Serval needs to make three attacks to win.       Sample Input 2 1 10000      Sample Output 2 1       Sample Input 3 10000 1      Sample Output 3 10000

Solution (Python):
H, A = map(int, input().split())
for i in range(1, 2*(10**4)):
  H -= A
  if H <= 0:
    break
print(i)

Solution (Python):
h ,a =map(int,input().split())

y = h // a

if (h % a) > 0:
    y = y + 1

print(y)

Solution (Python):
cont=0
h,a = map(int,input().split())
while h>0:
  h-=a
  cont+=1
print(cont)

Solution (Python):
h,a = [int(i) for i in input().split()]

cont=0

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

Solution (Python):
h,a = map(int, input().split())

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

Solution (Python):

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

import math
print(math.ceil(H/A))

Solution (Python):
H,A = map(int, input().split())
cnt = H//A
if (H%A):
  cnt +=1
print(cnt)

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

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

Solution (Python):
a, b = map(int, input().split())
print(0 - -a // b)

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

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

Solution (Python):
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

Solution (Python):
h,a = map(int,input().split())
if h%a == 0:
  print(h//a)

else:
  print(h//a + 1)

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

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

Solution (Python):
import sys
input = sys.stdin.readline
h,a=map(int,input().split())
count=0
while h>0:
    h=h-a
    count+=1
print(count)

Solution (Python):
h,a=map(int,input().split())
ans=0
while h>0:
    h-=a
    ans+=1
print(ans)

Solution (Python):
h , a = map(int,input().split())
turn = 0
while h > 0:
  h -= a
  turn += 1
print(turn)

Solution (Python):
print((lambda x: (x[0]-1)//x[1]+1)(list(map(int,input().split()))))

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):
H,A = map(int,input().split())

print(H//A if H%A == 0 else (H//A)+1)

Solution (Python):
import math
h, a = map(int, input().split())

print(math.ceil(h/a))

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):
from math import ceil
h,a = map(int,input().split())
print(ceil(h/a))

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

Solution (Python):
H,A = map(int, input().split())

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

Solution (Python):
h, a = map(int, input().split())
attack = 0
while h > 0:
    h -= a
    attack += 1

print(attack)

Solution (Python):

a,b=map(int,input().split())
p=a//b
if a==0:
    print(1)
else:
    if p*b==a:
        print(p)
    else:
        print(p+1)

Solution (Python):
h,a = [int(x) for x in input().split()]
i = 0
while h > 0:
    h -= a
    i += 1
print(i)

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

Solution (Python):
S = input().split()
def SvM(H, A):
 n = 1
 while A * n < H:
      n += 1
 return(n)

print(SvM(int(S[0]), int(S[1])))

Solution (Python):
h,a = map(int,input().split())
ct=h//a

a=h-ct*a

if a>0:
  ct+=1
print(ct)

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
h,a=map(int,input().split())
print((h+a-1)//a)

Solution (Python):
def main():
    h, a = map(int, input().split())
    kaisuu = h // a
    amari = h % a
    if amari > 0:
        print(kaisuu + 1)
    else:
        print(kaisuu)
    
if __name__ == "__main__":
    main()

Solution (Python):
h,a = map(int,input().split())
print(-1*(h//(-1*a)))

Solution (Python):
h, a = map(int, input().split())
ans = 1 + (h - 1) // a

print(ans)

Solution (Python):
h, a = map(int, input().split())

ans = 0

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

print(ans)

Solution (Python):
h, a = map(int, input().split())

ans = 0

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

print(ans)

Solution (Python):
h, a = map(int, input().split())
ans = 1 + (h - 1) // a

print(ans)

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

Solution (Python):
H,A=map(int,input().split())

a=0

while H>0:
  H=H-A
  a+=1
  
print(a)

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


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

    q, r = divmod(H, A)
    if r > 0:
        q = q + 1
    print(q)


if __name__ == '__main__':
    solve()

Solution (Python):
import math
h,a=map(int,input().split())

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

Solution (Python):

h, a = map(int, open(0).read().split())
print(h//a+(h%a!=0))

Solution (Python):
import math

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

print(math.ceil(hp / attack))

Solution (Python):
hp, attack = map(int, input().split())

x, y = divmod(hp, attack)

if y == 0:
	print(x)
else:
  	print(x + 1)

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

Solution (Python):
def main():
    H, A = map(int, input().split())
    count = 0

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

    print(count)


if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print((a-1) // b+1)

Solution (Python):
a,b = map(int,input().split())
print((a+b-1)//b)

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

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):

import sys


def solve(H: int, A: int):
    count = 0
    while True:
        H -= A
        count += 1
        if H <= 0:
            break
    print(count)
    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))  
    A = int(next(tokens))  
    solve(H, A)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline

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

k = h // a

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

Solution (Python):
H, A = map(int,input().split())
print(-(-H//A))

Solution (Python):
from math import ceil
h,a = map(int,input().split())

print(ceil(h/a))

Solution (Python):
import math
h, a= map(int, input().split())
print(math.ceil(h / a))

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

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

main()

Solution (Python):
h,a=map(int,input().split())
count=0
while True:
    h-=a
    count+=1
    if h<=0:
        print(count)
        exit()

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

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

Solution (Python):
H, A = map(int, input().split())

ans = (H // A) + ( 1 if (H % A) != 0 else 0)
print(ans)

Solution (Python):
from math import ceil
h, a = map(int, input().split())
print(ceil(h/a))

Solution (Python):
H, A = map(int,input().split())

c = 0
while H > 0:
    H -= A
    c += 1
print(c)

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if num[0]%num[1]==0:
    print(int(num[0]/num[1]))
  else:
    print(int(num[0]/num[1])+1)

main()

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

Solution (Python):
h, a = map(int, input().split())
print((h + a - 1) // a)

Solution (Python):
h,a=map(int,input().split())
print(-(-h//a))

Solution (Python):
h, a = map(int,input().split())

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

Solution (Python):
import math
h,a=map(int,input().split())

print(math.ceil(h/a))

Solution (Python):
H, A = (int(x) for x in input().split())

if A >= H:
    print(1)
elif H%A == 0:
    print(H//A)
else:
    print(H//A + 1)

Solution (Python):
H,A = map(int,input().split())

ans = -(-H//A) 

print(ans)

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

Solution (Python):
import math
h, a = map(int, input().split())
print(math.ceil(h/a))

Solution (Python):
def main():
    H,A = [int(x) for x in input().split()]
    ans = H//A
    if H%A > 0:
        print(ans+1)
    else:
        print(ans)

if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):
H, A = map(int, input().split())
total = H // A
if H % A != 0:
    print(total+1)
else:
    print(total)

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

Solution (Python):
H,A = list(map(int,input().split(" ")))

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

Solution (Python):
import math

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

Solution (Python):
h, a = map(int, input().split())
ans = (h + a - 1) // a
print(ans)

Solution (Python):
import math
h, a = map(int, input().split())

print(math.ceil(h / a))

Solution (Python):
H,A=map(int,input().split())

n=0
while H>0:
    H=H-A
    n+=1
print(n)

Solution (Python):
def resolve():
    h, a = list(map(int, input().split()))

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

Solution (Python):
h, a = map(int, input().split())
print(int((h + a - 1) / a))

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

Solution (Python):
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())





def main():
    h, a = geta(int)

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


if __name__ == "__main__":
    main()

Solution (Python):
H,A=map(int,input().split())
cnt=0

while True:
  if H<=0:
    break
  H-=A
  cnt+=1
  
print(cnt)

Solution (Python):
h, a = map(int, input().split())
cnt = 0
while h > 0:
    h -= a
    cnt += 1
print(cnt)

Solution (Python):
from math import ceil
H, A = map(int, input().split())
print("{}".format(ceil(H / A)))

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math
h,a=map(int,input().split())
print(int(math.ceil(h/a)))

Solution (Python):
import math
def main():
    H,A = map(int, input().split())
    print(math.ceil(H/A))

main()

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

Solution (Python):
import math
def main():
    H,A = map(int, input().split())
    print(math.ceil(H/A))

main()

Solution (Python):
h , a = map(int,input().split())
ans = 0
while 1 :
  h -= a
  ans += 1
  if h <= 0 :
    break
print(ans)

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

Solution (Python):
h, a = [int(x) for x in input().split()]
print((h + a - 1) // a)

Solution (Python):
H, A = map(int, input().split())

print(str((H + A - 1) // A))

Solution (Python):

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

for i in range(10 ** 4):
  h -= a
  if h <= 0:
    print(i + 1)
    break

Solution (Python):
import math

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

print(math.ceil(H/A))

Solution (Python):
h,a = map(int, input().split())
print((h-1)//a+1)

Solution (Python):
h,a=map(int,input().split())
print((h+a-1)//a)

Solution (Python):
h,a = map(int,input().split())
print(-(-h//a))

Solution (Python):
H, A = map(int, input().split())
n = (H-1)//A + 1
print(n)

Solution (Python):
H,A = map(int,input().split())
b = H // A
c = H % A
if c != 0:
    b += 1
print(b)

Solution (Python):
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

Solution (Python):
x = input().split()
h = int(x[0])
a = int(x[1])
count = 0
while h > 0:
  count += 1
  h = h - a
print(count)

Solution (Python):
H, A = map(int, input().split())

a_ = (H / A)
print(int(a_) if a_.is_integer() else int(a_)+1)

Solution (Python):
H,A = map(int,input().split())
print(-(-H//A))

Solution (Python):

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



if __name__ == '__main__':
    main()

Solution (Python):
h,a = map(int, input().split())

ans = 0


while True:
    h -= a
    ans+=1
    if h<=0:
        break
    

print(ans)

Solution (Python):
x, y = map(int, input().split())
if x <= y:
    print(1)
elif x % y == 0:
    print(x//y)
else:
    print(x//y+1)

Solution (Python):
h,a=list(map(int,input().split()))

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

print(ans)

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

Solution (Python):
H, A = map(int, input().split())
print(-(-H//A))

Solution (Python):
import math
H,A = map(int,input().split())
print(1 if H < A else math.ceil(H/A))

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

Solution (Python):
h, a = map(int, input().split(' '))
for i in range(10001):
    if h <= a*i:
        print(i)
        exit(0)

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

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

Solution (Python):
import math
def main():
    h, a = list(map(int, input().split()))
    print(math.ceil(h/a))
    
if __name__ == '__main__':
    main()

Solution (Python):
H, A = map(int,input().split())

if(H % A != 0):
    print(H // A + 1)
else:
    print(H // A)

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

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):

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

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

Solution (Python):
import math

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

print(math.ceil(H / A))

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

Solution (Python):
import math
h,a=map(int,input().split())

num = h/a
ans = math.ceil(num)
print(ans)

Solution (Python):
import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    H, A = map(int, readline().split())
    print(math.ceil(H/A))

if __name__ == '__main__':
    main()

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div

H, A = ri_()
print(-(-H // A))

Solution (Python):
h, a = map(int, input().split())

ans = (h + a - 1) // a
print(ans)

Solution (Python):
h, a = map(int, input().split())
cnt = 0
while h > 0:
    h -= a
    cnt += 1
print(cnt)

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

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):
import math
n,m=map(int,input().split())
print(math.ceil(n/m))

Solution (Python):
h,a=[int(_) for _ in input().split()]
import math
print(math.ceil(h/a))

Solution (Python):
import math
h, a = map(int, input().split())
print(int(math.ceil(h/a)))

Solution (Python):
from math import ceil
h,a = map(int,input().split())
print(int(ceil(h/a)))

Solution (Python):
H,A = map(int,input().split())
count = 0
a = 100
while a > 0 :
    a = H - A 
    count += 1
    if a <= 0 :
        break
    else :
        H = a
print(count)

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

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

Solution (Python):
import collections


n,h = map(int , raw_input().split(' '))

print (n + h-1)/h

Solution (Python):
H,A = map(int,input().split())

ans = (H+A-1) // A
print(ans)

Solution (Python):
H, A = map(int, input().split())
r = (H +A-1)//A
print(r)

Solution (Python):
h,a=(int(x) for x in input().split())
count=0

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

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

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

Solution (Python):
import sys

def ISI(): return map(int, sys.stdin.readline().rstrip().split())

h, a =ISI()
print((h+a-1)//a)

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

Solution (Python):
h, a = map(int, input().split())
print(-1 * (-1 * h // a))

Solution (Python):
b=input().split(' ')
b[0]=int(b[0])
b[1]=int(b[1])
k=1
m=0
while k==1:
    if b[0]<=0:
        k=k+1
    b[0]=b[0]-b[1]
    m=m+1
print(m-1)

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

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):
h, a = map(int, input().split())
ans = 0

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

print(ans)

Solution (Python):
H, A = map(int, input().split())

print((H+A-1)//A)

Solution (Python):
h, a =map(int, input().split())

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

Solution (Python):
H,A=map(int,input().split())
print(-(-H//A))

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

import math

h,a = nm()

print(math.ceil(h/a))

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n, k = list(map(int,sys.stdin.readline().split()))
    ans = n//k
    if n%k != 0:
        ans += 1
    print(ans)


    return 0
if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
H,A = map(int, input().split())
print(-(-H//A))

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

Solution (Python):
h,a = map(int,input().split())
ans = (h+a-1)//a
print(ans)

Solution (Python):
import math 
import sys 

t=1
for _ in range(t):
    n,m=map(int,input().split())
    print(math.ceil(n/m))

Solution (Python):
h,a=map(int,input().split())
n=0
while h>0:
    h-=a
    n+=1
    if h<=0:
        print(n)

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

Solution (Python):
h,a=map(int,input().split())
n=0
while True:
    h-=a
    n+=1
    if h<=0:
        break
print(n)

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

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):
h,a=map(int,input().split())
import math
print(math.ceil(h/a))

Solution (Python):
h, a = map(int, input().split())
c = int(h/a)
if h%a!=0:
    c+=1
print(c)

Solution (Python):
h,a = map(int,input().split())
print((h-1)//a+1)

Solution (Python):
H, A = list(map(int, input().split()))
print(H // A + (H % A != 0))

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

Solution (Python):
H, A = map(int, input().split())

cnt = 0
while True:
    cnt += 1
    H -= A
    if H <= 0:
        break
print(cnt)

Solution (Python):
from math import ceil
H, K = list(map(int, input().split()))
print(ceil(H/K))

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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

Solution (Python):
H,A=map(int,input().split());q=H//A;mod=H%A;print(q+min(mod, 1))

Solution (Python):
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

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

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

Solution (Python):


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

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

Solution (Python):
H, A = map(int, input().split())
for i in range(H+1):
    if H <= A*i:
        print(i)
        break

Solution (Python):
import math

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

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

Solution (Python):
h, a = map(int, input().split())
print( int( (h+a-1)/a ) )

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

Solution (Python):
h,a = map(int,input().split())

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

Solution (Python):
import math 
H,A=map(int,input().split())
S=math.ceil(H/A)
print(S)

Solution (Python):
h, a = list(map(int, input().split()))
print(h // a + min(h % a, 1))

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):
import math

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

print(math.ceil(H/A))

Solution (Python):

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

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

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

Solution (Python):
H, A = map(int, input().split())

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

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

Solution (Python):
h, a = [int(_) for _ in input().split()]
print((h - 1) // a + 1)

Solution (Python):
H, A = map(int, input().split())

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

Solution (Python):
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()

Solution (Python):
import math

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

print(math.ceil(H / A))

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

Solution (Python):
H, A = (int(x) for x in input().split())
print(1 if H <= A else round(H // A) + int(H % A != 0) )

Solution (Python):
H,A = map(int,input().split())
syou = H//A
amari = H%A
if amari!=0:
    syou += 1
print(syou)

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

Solution (Python):
H, A = map(int, input().split())

import math
print(math.ceil(H/A))

Solution (Python):
import sys

input = sys.stdin.readline


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

    q, r, = divmod(H, A)

    ans = q
    ans += 1 if r > 0 else 0

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
H,A = map(int, input().split())




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

Solution (Python):
h, a = map(int, input().split())
n = 0
while True:
  h -= a
  n += 1
  if h <= 0:
    break
print(n)

Solution (Python):
h,a=map(int,input().split())
import math
print(math.ceil(h/a))

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

Solution (Python):
h, a = map(int, input().split())
print(-(-h//a))

Solution (Python):
h, a = map(int, input().split())

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

Solution (Python):
import fileinput
import math

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

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

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

Solution (Python):
def ABC_153_A():
    H,A = map(int, input().split())

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

if __name__ == '__main__':

    ABC_153_A()

Solution (Python):
import math

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

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

Solution (Python):
H, A = map(int, input().split())

a = H // A
if H % A != 0:
    print(a + 1)
else:
    print(a)

Solution (Python):
h,a=map(int,input().split())

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

Solution (Python):
H,A=map(int,input().split())

ans=0
while H>0:
    H -= A
    ans += 1
print(ans)

Solution (Python):
import itertools
import math
import fractions
import functools
h, a = map(int,input().split())
print(math.ceil(h / a))

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

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

Solution (Python):
H , A = (int(x) for x in input().split())
count = 0

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


print(count)

Solution (Python):
h,a=map(int,input().split())

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

print(cnt)

Solution (Python):
A,B = list(map(int,input().split()))
if A//B == A/B:
    print(A//B)
else:
    print(A//B + 1)

Solution (Python):
H,A = map(int, input().split())
h = H

for i in range(H + 1):
    h = h - A
    if h <= 0:
        print(i + 1)
        break

Solution (Python):
h, a = list(map(int, input().split()))
ans = 1
while(True):
    if h <= a * ans:
        print(ans)
        break
    ans += 1

Solution (Python):
h,a = map(int,input().split())

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

Solution (Python):

"""
Created on Fri May  8 15:14:34 2020

@author: shinba
"""
h,a = map(int,input().split())

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

Solution (Python):
h, a = map(int, input().split())
print(-(-h // a))

Solution (Python):

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

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

print(cnt)

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    h, a = map(int, stdin.readline().split())
    ans = 0
    while h > 0:
        h -= a
        ans += 1
    print(ans)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

Solution (Python):
def main():
    h,a=map(int,input().split())
    ans=0
    while h>0:
        h-=a
        ans+=1
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
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()

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

Solution (Python):
h,a = map(int, input().split())
num = 0
while h > 0:
    h -= a
    num += 1
print(num)

Solution (Python):
a,b=map(int,input().split())
print(-(-a//b))

Solution (Python):
h, a = map(int, input().split())

cnt = 0
while True:
    cnt += 1
    h -= a
    if h <= 0:
        break
print(cnt)

Solution (Python):
import math

val = input().split()

H = int(val[0])
A = int(val[1])

if H % A == 0:
    print((H // A))
else:    
    print((math.floor(H / A) + 1))

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

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

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

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

Solution (Python):
H, A = map(int, input().split())
print(H//A+(H%A != 0))

Solution (Python):
a, b = list(map(int,input().split()))
if a%b:
	print(a//b+1)
else:
  print(a//b)

Solution (Python):
a, b = list(map(int,input().strip().split()))
print(a//b+1 if a%b else a//b)

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

Solution (Python):
import math
h, a = map(int, input().split())
print(math.ceil(h / a))