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

print(h//a + 1) if h%a 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
H,A = list(map(int,input().split()))
print(math.ceil(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())
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 sys,math,collections
from collections import defaultdict


    
def file():
    sys.stdin = open('input.py', 'r')
    sys.stdout = open('output.py', 'w') 
def get_array():
    l=list(map(int, input().split()))
    return l
def get_ints():   
    return map(int, input().split())
    
def get_3_ints():   
    a,b,c=map(int, input().split())
    return a,b,c    
def sod(n):
    n,c=str(n),0
    for i in n: 
        c+=int(i)
    return c    
def isPrime(n):
    if (n <= 1):
        return False
    if (n <= 3):
        return True
    if (n % 2 == 0 or n % 3 == 0):
        return False
    i = 5
    while(i * i <= n):
        if (n % i == 0 or n % (i + 2) == 0):
            return False
        i = i + 6
  
    return True
def getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    floor = -1
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == x:
            return A[mid]
        elif x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            left = mid + 1
            
    return floor
def chk(aa,bb):
	f=0
	for i in aa:
		for j in bb:
			if(j[0]>=i[0] and j[1]<=i[1]):
				f+=1
			elif(j[0]<=i[0] and j[1]>=i[1]):	
				f+=1
			elif(i[0]==j[1] or i[1]==j[0]):
				f+=1
			else:
				continue
	return f	
def maxSumRangeQuery(nums, req):
    l=[0]*(len(nums)+1)
    nums.sort(reverse=True)
    for i in req:
        l[i[0]]+=1
        l[i[1]+1]-=1
    for i in range(1,len(l)):
        l[i]+=l[i-1]
    l=l[:-1]    
    
    d=collections.defaultdict(list)
    for i in range(len(l)):
        d[l[i]].append(i)
    di=collections.OrderedDict(sorted(d.items()))   
        
    k=0
    ans=[0]*len(nums)
    for i in di:
        for j in di[i]:
            ans[j]=nums[len(nums)-k-1]
            k+=1
        
    c=0
    for i in req:
        st=ans[i[0]:i[1]+1]
        c+=sum(st)
    return c%(10**9+7)
			


def main():
	c=0
	a,b=get_ints()
	while(a>0):
		a-=b
		c+=1
	print(c)	
		







				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








if __name__ == '__main__':
    main()

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

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

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

print(c)

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

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

print(c)

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

Solution (Python):
from math import ceil

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

n = ceil(h/a)
print(n)

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

from  collections import defaultdict
from collections import Counter
import bisect
from functools import reduce

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


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

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

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

print(ans)

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

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

print(cnt)

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

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

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

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())
ans = 0
for _ in range(h):
  h -= a
  ans += 1
  if h <= 0:
    break
print(ans)

Solution (Python):

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

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

Solution (Python):
str = input()
nums  = str.split()
if nums[0] == "0" or nums[1] == "0":
     print("error")
else:
    turn = float(nums[0]) / float(nums[1]) + 0.9
    if turn < 1:
       turn = 1
    print(int(turn))

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

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

if H % N == 0:
    print(H//N)
elif H % N != 0:
    print(H // N + 1)

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

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

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

print(str(s))

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

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


if H % A == 0:
    count_e = H//A 
    print(count_e)

elif H < A:
    count_u =  1
    print(count_u)
    
elif  H % A != 0:
    count_o = H // A + 1
    print(count_o)

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

Solution (Python):
h, a = [int(i) for i in input().split()]
ans = h // a if h % a == 0 else h // 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 = [int(x) for x in input().split()]
print((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 math

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

print(math.ceil(H/A))

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

Solution (Python):

rStr = input()

H = int(rStr.split(' ')[0])
A = int(rStr.split(' ')[1])

count = 0

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

print(count)

Solution (Python):



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


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
H, A = rii()
H, r = divmod(H, A)
r = 1 if r else r
print(H + r)

Solution (Python):
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())

H, A = rii()

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

Solution (Python):
import math

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

print(ans)

Solution (Python):
z=list(map(int,input().split()))
a=z[0]//z[1]
if z[0]%z[1]!=0:
       a+=1
print(a)

Solution (Python):
H, A = map(int, input().split())
Ans = 0
while True:
    H -= A
    Ans += 1
    if H <= 0:
        break
print(Ans)

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

Solution (Python):
h,a=map(int,input().split())
for i in range(10**100):
    if h <= a*i:
        print(i)
        break

Solution (Python):




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

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

else:
    print(int(h/a))

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

Solution (Python):
from math import *
n,m=map(int,input().split())
print(ceil(n/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())
print((h+a-1)//a)

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

print(math.ceil(h/a))

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

Solution (Python):
a,b = map(int,input().split())
if a%b==0:print(a//b)
else:print(a//b+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-1)//a)

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

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

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

h = H//A
c = H%A

if c == 0:
  print(h)
else:
  print(h+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):

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

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

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

print(ans)

Solution (Python):
import math

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

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

Solution (Python):
import os, sys, re, math

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

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

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

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

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

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

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

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

Solution (Python):
a,b=(int(x) for x in input().split())
sum=0
while a>0:
    a-=b
    sum+=1
print(sum)

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

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


def main():
    solve()


if __name__ == '__main__':
    main()

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

print(math.ceil(H/A))

Solution (Python):
H, A = [int(v) for v in input().rstrip().split()]
r = int(H / A)
if H != (r * A):
    r += 1

print(r)

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

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

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

ans = ceil(round(H / A, 6))

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

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

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
n,k=map(int,input().split())
print(math.ceil(n/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())
c = int(H / A)
if H % A != 0:
    c += 1
print(c)

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 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 True:
    if h > 0:
        h = h - a
        ans += 1
    else:
        print(ans)
        exit()

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())
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())
print(0--h//a)

Solution (Python):
score = list(map(int,input().split()))
kaisu = 1
hp = score[0]
while hp > score[1]:
    kaisu += 1
    hp -= score[1]
print(kaisu)

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

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

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

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

while 1:
    h-=a
    n+=1
    if h<=0:
        print(n)
        exit(0)

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

if h % a != 0:
  ans = math.floor(h/a+1)
else:
  ans = math.floor(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 sys

H, A = map(int, next(sys.stdin.buffer).split())
print(-(-H // A))

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

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

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

h,a = inpm()

for i in range(1,10001):
    h -= a
    if  h <= 0:
        print(i)
        break

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

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

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

print(count)

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

Solution (Python):

M,N =map(int,input().split())
a,b = divmod(M,N)
if b == 0:
    print(a)
else:
    print(a+1)

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

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

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

Solution (Python):
h,a=map(int,input().split())
if h>a:
  if h%a==0:print(h//a)
  if h%a>0:print(h//a+1)
if h<=a:
  print(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())
if h % a > 0:
  number_of_times = h // a + 1
  print(number_of_times)
else:
  print(h // a)

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

Solution (Python):
h,a=map(int,input().split())
for i in range(1,10001):
    if a*i >= h:
        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):
a,b = map(int, input().split())
print(0--a//b)

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

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

if '__main__' == __name__:
    resolve()

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(H: int, A: int):
    return H//A+(H % A > 0)


def main():

    sys.setrecursionlimit(10 ** 6)

    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))  
    print(f'{solve(H, A)}')


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

X = H//A

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

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

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

Solution (Python):
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    h, a = map(int, input().split())
    print(ceil(h / a))


if __name__ == "__main__":
    main()

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

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

Solution (Python):
h, a= map(int, input().split(" "))
r = h // a
remainder = h % a
while remainder > 0:
    remainder -= a
    r += 1

print(r)

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

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

Solution (Python):
def solve():
    H,A = [int(i) for i in input().split()]
    print((H+A-1)//A)
    
if __name__ == "__main__":
    solve()

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

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
H,A = input().split()
H = int(H)
A = int(A)
if H <= A :
    print('1')
elif not H % A == 0 :
    print(str(H//A + 1))
else :
    print(str(H//A))

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

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

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

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

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

Solution (Python):
h, a = list(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())
print((h+a-1)//a)

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

Solution (Python):


import math

def main():

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

    ans = math.ceil(H / A)

    print(ans)


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())
ans, r = divmod(h, a)
if r:
	ans += 1
print(ans)

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

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

print(tmp)

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

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

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

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

result = serval_vs_monster()
print(result)

Solution (Python):
H,A = 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())

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