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

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

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

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

print(ans)

Solution (Python):
import math
from sys import stdin
H, A = [int(_) for _ in stdin.readline().rstrip().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 = list(map(int,input().split()))

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

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

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

print(i)

Solution (Python):

from itertools import product, permutations, combinations
from bisect import bisect_right,bisect_left
INF = float('inf')

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 if h%a!=0 else 0))

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

q, mod = divmod(H, A)

if mod > 0:
    ans = q + 1
else:
    ans = q

print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
s = input().split(' ')
X = int(s[0])
A = int(s[1])
if X % A == 0:
  print(X // A)
else:
  print((X // 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 + bool(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(int(h/a))
else:
  print(int(h/a)+1)

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

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,A =MI()
    print(ceil(H/A))
if __name__ == '__main__':
    main()

Solution (Python):
i = list(map(int, input().split()))
count = 0
if i[0] <= i[1]:
    print("1")
else:
    while i[0] > 0:
        i[0] -= i[1]
        count += 1
    print(count)

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

Solution (Python):

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

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

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

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


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

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

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


hp, ap = input().split(' ')

print(math.ceil(int(hp) / int(ap)))

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

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

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

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

H = l1[0]
A = l1[1]

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

Solution (Python):
H,A=map(int,raw_input().split())
ans=0
for i in range(1,100000):
  H = H-A
  ans += 1
  if H<=0:
    break
print ans

Solution (Python):




"""
このプログラムはPythonを書く際のテンプレとなっています。これをコピペしてコーディングを行なってください。
なお字下げしないこと！！
"""

__author_ = 'Maruta Yuzuha'
__version_ = '1.0.0'
__date__ = '2019/12/25'

def main():
    """
    ここでプログラムの解説を行う
     >>main()
    Hello world.
    0
    """
    s = input().split()
    a = 0
    b = int(s[0])
    c = int(s[1])
    while b > 0:
        b = b - c
        a += 1
    print(a)
    return 0

if __name__ == '__main__':
    
    

    
    
    import doctest
    doctest.testmod()

    
    import sys
    sys.exit(main())

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

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

Solution (Python):
S,K=map(int,input().split())

if S%K!=0:
  print((S//K)+1)
else:
  print(S//K)

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

Solution (Python):
HA=input()
HA=HA.split()
n=int(HA[0])/int(HA[1])
if int(HA[0])%int(HA[1])==0:
  print(int(n))
else:
  print(int(n+1))

Solution (Python):


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

if ans==0:
    print(1)

elif mod==0 and ans >=0:
    print(ans)

else:
    print(ans+1)

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

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

Solution (Python):
input_num=input()
n=input_num.split()
num=[int(n[0]),int(n[1])]

N=num[0]
m=0
while 1:
  N=N-num[1]
  m=m+1
  if N<=0:
    break

print(m)

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

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

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

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

ans = 0
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()))

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

Solution (Python):
import math

hp, atk = input().split()

hp = int(hp)

atk = int(atk)

print(math.ceil(hp / atk))

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

h,a = inpl()
print(math.ceil(h/a))

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

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

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

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

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

print(ans)

Solution (Python):

h,a=map(int,raw_input().split())
cnt=1
while h>a:
 cnt+=1
 h-=a
print cnt

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

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

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

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

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

Solution (Python):
h,a=map(int,raw_input().split())
print(h+a-1)/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())
print((h + a - 1) // a)

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

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

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

Solution (Python):






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

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

Solution (Python):
def solve(h, a):
    return (h + a - 1) // a

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

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

Solution (Python):

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

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

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

Solution (Python):

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


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

print(answer)

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

count = 0

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

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

Solution (Python):


"""
name: 153A.py
プログラムの説明
"""

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

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



    print(times)

if __name__ == '__main__':
    main()

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

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

print(math.ceil(H/A))

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):

def main():
    H, A = map(int, input().split())
    print((H + A - 1) // 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())
n = 0
while H > 0:
    n += 1
    H -= A
print(n)

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


print(count)

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

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

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

Solution (Python):
l = list(map(int, input().split()))
count=1
ll=l[0]
while ll-l[1]>0:
    count+=1
    ll=ll-l[1]
print(count)

Solution (Python):
def c(i):
    return i

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

Solution (Python):
from sys import stdin

H, A = (int(v) for v in stdin.readline().split())
n = H // A
print(n + 1 if H % A > 0 else n)

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

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

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

Solution (Python):

import sys
import math

def solve(H: int, A: int):
    print(math.ceil(H / A))
    return 0



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 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 -= a
    cnt+=1
print(cnt)

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

Solution (Python):


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

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

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

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

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

Solution (Python):
import sys

def propare():
    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)

def solve(H: int, A: int):
    count = 0
    while 0 < H:
        count = count + 1
        H = H - A

    print(count)

    return


 
if __name__ == "__main__":
    propare()

Solution (Python):
import math
def resolve():
    import sys
    input = sys.stdin.readline
    
    H, A = map(int, input().split())

    print(math.ceil(H / A))
    

if __name__ == "__main__":
    resolve()

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

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

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

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

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

print  ( math.ceil(a/b)  )

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

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

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):
from math import ceil

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

print(ceil(a/b))

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

Solution (Python):
import math


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

attacks = H // A

if H % A > 0:
    attacks+=1
    
print (attacks)

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

Solution (Python):
import math
H,A = [int(number) for number in input().split()]
print(math.ceil(H/A))

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

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

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

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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

h,a = LI()
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 + min(1, H % A))

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

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	H,A = inputMap()
 
	ans = -(-H // A)
 
	print(ans)



if __name__ == "__main__":
	main()

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

Solution (Python):
N, M = map(int, input().split())
print(-(-N//M))

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

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

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

print(answer)

Solution (Python):

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

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

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

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

while True:
  c=c+1
  a=a-b
  if a<=0 :
    break
print(c)

Solution (Python):
print(-eval(input().replace(' ','//-')))

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

count = 0;

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

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

Solution (Python):
import sys

use_clipboard=True
bbn=1000000007
	


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

isTest=False

def pa(v):
	if isTest:
		print(v)
		
class input_clipboard:
	def __init__(self,s):
		self.input_l=s.splitlines()
		self.ii=0
		
	def input(self):
		ret = self.input_l[self.ii]
		self.ii+=1
		return ret

if __name__ == "__main__":
	if sys.platform =='ios':
		if use_clipboard:
			import clipboard
			input_text=clipboard.get()
			ic=input_clipboard(input_text)
			input = lambda : ic.input()
		else:
			sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

H = A[0]
A = A[1]

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

print(count)

Solution (Python):
class Main:
    s = list(map(int, input().split()))
    h = s[0]
    a = s[1]
    cnt = 0
    if h >= a:
        while h > 0:
            h -= a
            cnt += 1

    else:
        cnt = 1
    print(cnt)

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

Solution (Python):
print(-eval(input().replace(' ','//-')))

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

Solution (Python):
a,b = list(map(int, input().split()))
print('{}'.format(-(-a//b)))

Solution (Python):
Input1 = list(map(int,input().split()))
H = Input1[0]
A = Input1[1]

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

print(Ans)

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

n = (int(H)/int(A)) +(int(H)%int(A)>0)

print(int(n))

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

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

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

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

Solution (Python):

s = [int(x) for x in input().split()]

hp = s[0]
attack = s[1]



acount = hp // attack


if hp % attack == 0:
    print(acount)
else:
    print(acount + 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())

q,mod= divmod(H,A)

if mod > 0:
  q += 1
  
print(int(q))

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 + (h % a != 0))

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

cut = 0

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

print(cut)

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

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

Solution (Python):
import math
ip = raw_input().split()
res = float(ip[0])/float(ip[1])
print(int(math.ceil(res)))

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

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

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

ans = 0
dmg = 0
while dmg < H:
    ans += 1
    dmg += A

print(ans)

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

print(math.ceil(h/a))

Solution (Python):
import math

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

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

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

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

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

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

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

i = 0

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

print(i)

Solution (Python):
import math

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

Solution (Python):
H, A = 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())
cnt = 0
while h>0:
    h -= a
    cnt += 1
print(cnt)

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

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

while(a>b) :
    a -= b
    cnt +=1


print(cnt)

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

Solution (Python):
import math

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

Solution (Python):
from math import ceil

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

if __name__ == "__main__":
  H, A = map(int, input().split())
  get_num_attacks(H, A)

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

Solution (Python):
import math
data=input().split()
hp = int(data[0])
atk= int(data[1])

kai = math.ceil(hp/atk)
print(kai)

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):
list = input().split(' ')
num = 0
a = int(list[0])
b = int(list[1])
while a > 0:
  a -= b
  num += 1
  
print(num)

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

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

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

print(result)

Solution (Python):
a = input()
a = a.split(" ")
i = 0
while 1:
  if int(a[0]) <= 0:
    break
  else:
    i = i+1
    a[0]=int(a[0])-int(a[1])
    
print(i)

Solution (Python):
n, m = [int(x) for x in input().split()]
k = 0
if m>n:
    print(1)
else:
    while n > 0:
        n = n - m
        k += 1
    print(k)

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

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

print(cnt)

Solution (Python):
from math import ceil

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

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 = [int(x) for x in input().split()]
print(math.ceil(H/A))

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

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


s = [input() for i in range(1)]
S = (list(s[0].split()))


x = math.ceil(int(S[0])/int(S[1]))


print(x)

Solution (Python):
in_len = input().split(" ")
in_h = int(in_len[0])
in_a = int(in_len[1])

out_c = 0

while True:
  out_c += 1
  if(in_h - in_a <= 0):
    print(out_c)
    break
  else:
    in_h -= in_a

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

Solution (Python):
s = input().split()  
de = int(s[0])
count = 0

while de > 0:
    de = int(de) - int(s[1])
    
    count += 1

print(count)

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

Solution (Python):
import math

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

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

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

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