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):
import math
h, a = map(int, input().split())
print(math.ceil(h / a))

Solution (Python):
il =[int(k) for k in input().split()]
H = il[0]
A = il[1]

ans, mod = divmod(H, A)

if mod == 0 :
    print(ans)
else:
    print(ans + 1)

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

Solution (Python):


from math import ceil
H, A = map(int, input().split())
print(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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

h, a = Is()
print(ceil(h/a))

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

Solution (Python):
import math

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

print(math.ceil(i / j))

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())
print(H//A if H%A==0 else 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-1)//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
ans += 1 if H % A != 0 else 0
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):
h, a = map(int, input().split())
ans = 0
while h > 0:
    h -= a
    ans += 1
print(ans)

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

Solution (Python):
import math

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

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())
ans=math.ceil(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):
h,a = map(int,input().split())
n = 0
while h > 0:
    h -= a
    n +=1
print(n)

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())
if h%a!=0:
    print((h//a)+1)
else:
    print(h//a)

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

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

cnt = 0

while True : 
    if H <= 0 :
        break

    H = H - A
    cnt += 1

print(cnt)

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

if int(H) % int(A) == 0:
    print(int(H) // int(A))
else:
    print(int(H) // int(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())
print(H // A if H % A == 0 else H // A + 1)

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

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

print(H // A + int(H % A != 0))

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

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):
H, A = map(int, input().split())

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

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

print(solve())

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

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

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

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

Solution (Python):

"""
from sys import stdin
n = int(stdin.readline().rstrip())
data = [stdin.readline().rstrip().split() for _ in range(n)]
print(data)
print(*data, sep='\n')
"""


"""
s =input()
s=list(input())
a=int(input())
x,y = map(int,input().split())	
li = input().split()	
li = list(map(int,input().split()))	
li = input().split('T')	
"""

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

if H<=A:
    print("1")
elif H%A==0:
    print(ans)
else:
    print(ans+1)

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

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

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

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

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

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

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

Solution (Python):









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

'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''



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

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

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

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

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

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

Solution (Python):
import collections
import itertools as it
import math

 


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

print(-(-H//A))

Solution (Python):
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]

import math as M
h,a=INPUT()
print(int(M.ceil(h/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):
import math
H,A=map(int,input().split())
print(math.ceil(H/A))

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

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

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

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

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

Solution (Python):

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

Solution (Python):

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

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

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

Solution (Python):
H,A=[int(i)for i in input().split()]
print(H//A + (H%A!=0))

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

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

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

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

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

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

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

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

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

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

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

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

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

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:
    s=1
else:
    s=0
print(h//a+s)

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

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

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 math
h,a=map(int,input().split())
print(math.ceil(h/a))

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

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 = 0

if h%a == 0:
  ans += h//a
else:
  ans += h//a +1

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

q, mod = divmod(H, A)

print(q) if mod == 0 else print(q + 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())
 
for i in range(H+1):
    if H > 0:
        H = H - A
    else:
        print(i)
        break

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

Solution (Python):

def inputlist(): return [int(k) for k in input().split()]

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

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

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

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

Solution (Python):
h, a = list(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):
h, a = map(int,input().split())

if h%a==0:
    attack = h//a
else:
    attack = h//a + 1

print(attack)

Solution (Python):
H, A = [int(i) for i in input().split(' ')]
print(-(-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())
import math
print(math.ceil(H/A))

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

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

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

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

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

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())
count = 0
while h > 0:
    h = h-a
    count = count + 1
print(count)

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

Solution (Python):
import math

h,a = (int(x) for x in input().split())
print(math.ceil(h/a))

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

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

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

print(count)

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

Solution (Python):
h,a=[int(i)for i in input().split()]
if h%a==0:
  print(h//a)
else:
  print(h//a+1)

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

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

Solution (Python):
l = [int(x) for x in input().split()]
H, A = l[0], l[1]

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

Solution (Python):
x = input().split()
h = int(x[0])
a = int(x[1])
counter = 0

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

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(int(math.ceil(h/a)))

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

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

Solution (Python):


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

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

ans = 0

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

print(ans)

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

from sys import exit

while True:

    h=int(h-a)

    s+=1

    if h<=0:

        print(s)
        exit()

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

ans = 0

while h > 0:
    ans += 1
    h -= 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())

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

print(ans)

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

Solution (Python):
def main():
    hp, attack = list(map(int, input().split()))
    ans = 0
    while hp > 0:
        hp -= attack
        ans += 1
    print(ans)




if __name__ == '__main__':
    main()

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

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

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 = (int(x) for x in input().split())
a = H//A
if H%A == 0:
  print(a)
else:
  print(a+1)

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

count = 0

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

print(count)

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


times = math.ceil(h/a)


print(times)

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

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-1)//A+1)

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

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

print(i)

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)
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 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())
if (H % A) == 0:
    print(H // A)
else:
    print((H // A) + 1)

Solution (Python):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    H, A = input(int, int)
    print(ceil(H / A))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

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())
print(-(-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())
q, mod = divmod(h, a)
print(q if mod == 0 else q + 1)

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

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

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

Solution (Python):




def input_int():
    return int(input())



def int1(x):
    return int(x) - 1



def input_to_int_map():
    return map(int, input().split())



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    h, a = input_to_int_map()

    if h % a == 0:
        return h // a

    return (h // a) + 1


if __name__ == "__main__":
    print(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())

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

Solution (Python):
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

H, A = rl()

d, m = divmod(H, A)
print(d+int(m!=0))

Solution (Python):
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

H, A = rl()

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

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

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

Solution (Python):


def main():
    H, A = map(int, open(0).read().split())

    print(-(-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):
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 math
H,A = map(int,input().split())
ans = math.ceil(H/A)
print(ans)

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

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())
if h<=a:
    print(1)
else:
    res=h//a
    res_ = h%a
    if res_!=0:
        print(res+1)
    else:
        print(res)

Solution (Python):
import math

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

count = math.ceil(h/a)

print(count)

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

h,a = na()

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

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)+1)
else:
  print(H //A )

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

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

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

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

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

Solution (Python):
import math
a = list(map(int,input().split()))
print(math.ceil(a[0]/a[1]))

Solution (Python):
import math

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

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

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

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

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

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())
i=0
while 1:
    i+=1
    h-=a
    if h<=0:
        break
print(i)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

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

Solution (Python):


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

import math
print(math.ceil(H/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(str(H//A))
else:
  print(str(H//A +1))

Solution (Python):
H,A=(int (x) for (x) in 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 = H - A
    ans += 1
print(ans)

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 = [int(i) for i in input().split()]

x = H//A
if(A*x == H):
    print(x)
else:
    print(x+1)

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

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

Solution (Python):
import math

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

print(math.ceil(a/b))

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)
else:
    print(h//a+1)

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

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

k = 0 

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

print(k)

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 = h // a
if h % a != 0:
    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())
a=0
while H>0:
  H=H-A
  a+=1
print(a)

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

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

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

print(math.ceil(a/b))

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

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

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

print(i)

Solution (Python):

def ceilT(a,b): 
    return (a+b-1)//b
H,A=map(int,input().split())
print(ceilT(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(int(H / A))
else:
    print((H // A)+1)

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

print(ans)

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

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

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

Solution (Python):
h, a = map(int, 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):
b = list(map(int, input().split()))
count = 0

while b[0] > 0:
    b[0] -= b[1]
    count += 1

print(count)

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

Solution (Python):
h, n = (int(i) for i in input().split())
count = 0
while h > 0:
    count += 1
    h = h - n
print(count)

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())
ttk = h // a
if h%a != 0:
    ttk += 1
else:
    ttk = ttk
print(ttk)

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(int(H/A))
else:
  print(int(H/A) + 1)

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    h, a = list(map(int, readline().split()))
    print((h + a - 1) // a)


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
from math import ceil
H, A = map(int, input().split())
print(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())
times = H // A
if H % A:
  times += 1
print(times)

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
H, A = list(map(int,readline().split()))
if H % A == 0:
  print(int(H/A))
else:
  print(H // A + 1)

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

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

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

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

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

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

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

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

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

ans = 0

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

print(ans)

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

ans = 0

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

print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

H, A = lr()
answer = -(-H//A)
print(answer)

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