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-----
10 4

-----Sample Output-----
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.

Difficulty: introductory

Starter code:

Solutions:
import math

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

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


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

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

import math
H, A = map(int, input().split())
 
# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print((H+A-1) // A)

H, A = list(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)
    


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

H, A = list(map(int, input().split()))
count = 0

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

print(count)


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

print(math.ceil(H/A))

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



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

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

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

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

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

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

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

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

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

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

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

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

print(c)

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

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)

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

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

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

b = 0
for i in range(10000000):
    if h > 0:
        h = h - a
        b = b + 1

    else:
        print(b)
        break




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)



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

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

print(str(s))

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

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

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

#153-A

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

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

else:
    print(( H//A +1))


h,a = map(int,input().split())
print([h//a+1,h//a][h%a==0])

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

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

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

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

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

import sys,math,collections
from collections import defaultdict

#from itertools import permutations,combinations
    
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())
    #return a,b
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()))   
        #print(di)
    k=0
    ans=[0]*len(nums)
    for i in di:
        for j in di[i]:
            ans[j]=nums[len(nums)-k-1]
            k+=1
        #return ans        
    c=0
    for i in req:
        st=ans[i[0]:i[1]+1]
        c+=sum(st)
    return c%(10**9+7)
			

#file()
def main():
	c=0
	a,b=get_ints()
	while(a>0):
		a-=b
		c+=1
	print(c)	
		
#[1, 1, 1, 0]
#[1, 2, 2, 1]
#[1, 3, 2, 1]




				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








def __starting_point():
    main()
__starting_point()

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

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

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

import math

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

print(math.ceil(H/A))

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

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

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


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

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

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

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

print(ans)

import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    h, a = inl()

    return (h + a - 1) // a


print(solve())


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

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

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

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

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


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

def __starting_point():
    main()
__starting_point()

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

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


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


h,a = map(int,input().split())
ans = 0
for _ in range(h):
  h -= a
  ans += 1
  if h <= 0:
    break
print(ans)

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

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

# coding: utf-8
# Your code here!

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

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

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

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

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


[H, A] = [int(i) for i in input().split()]
t = 0
if H/A != int(H/A):
    t = 1
print(int(H/A) + t)

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

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

#!/usr/bin/env python3


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


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


def __starting_point():
    main()

__starting_point()

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

from math import ceil

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

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

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

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

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

# H/A の切り上げ
# ceil or (H+A−1)/A の切り捨て
print(math.ceil(H/A))

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

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

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

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

count = 0

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

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


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

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

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

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

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

print(cnt)



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

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

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

print(ans)

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

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

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


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

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


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

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

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

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

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

print((H // A + bool(H % A)))


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

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

print(c)


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


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

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

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

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

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

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

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

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

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

print(ans)

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

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

print(cnt)

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

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

count = 0
while h > 0:
    h -= a
    count += 1
    if h <= 0:
        break

print(count)


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

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

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