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

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


ans = 0
while h > ans*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=map(int,input().split())
x=(-(-h//a))
print(x)

Solution (Python):

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

q, mod = divmod(H, A)

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):


import math

HA=input().split()
H=int(HA[0])
A=int(HA[1])

ANS=math.ceil(H/A)

print(ANS)

Solution (Python):
data=input().split()
HP=int(data[0])
ATK=int(data[1])
count=0
while HP>0:
  HP=HP-ATK
  count=count+1
print(count)

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

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

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

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

Solution (Python):
import math

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

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.ceil(hp / attack))

print(int(ans))

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

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

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

Solution (Python):
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys






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

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

Solution (Python):
input_line = input()
temp = input_line.split()
H = int(temp[0])
A = int(temp[1])

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

Solution (Python):
from math import ceil
from sys import stdin
n,m = map(int,stdin.readline().split())
print(ceil(n/m))

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

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

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

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

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

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

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

print(int(Y))

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

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

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(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):
a,b = input().split()
a = int(a)
b = int(b)
n = a
count=0
while n>0: 
	n-=b

	count+=1
print(count)

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

Solution (Python):
c,d=(int(x) for x in input().split())
a=-(-c//d)
print(a)

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

Solution (Python):
import math


def solve(h, a):
    return math.ceil(h / a)


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

    ans = solve(h, a)
    print(ans)


main()

Solution (Python):
import math


def solve(h, a):
    return math.ceil(h / a)


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

    ans = solve(h, a)
    print(ans)


main()

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

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

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

Solution (Python):
import math

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

print(math.ceil(H/A))

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

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

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

for j in range(10000):
    H = H - A
    if H <= 0:
        i = i
    else:
        i = i + 1
if H <= 0:
    print(i)

Solution (Python):
from sys import stdin
import math

def main():
    n,m = map(int,stdin.readline().split())
    print(math.ceil(n/m))
main()

Solution (Python):
from sys import stdin
import math

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

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

Solution (Python):
import sys
sys.setrecursionlimit(100000) 
H, A = map(int, input().split())

def calc_atack(H, A, counter =0):
    H -= A
    counter += 1
    if H <= 0:
        return counter
    else:
        return calc_atack( H, A, counter = counter)


print(calc_atack(H, A))

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

s=0

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

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

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

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

Solution (Python):
from sys import stdin

x,y = [int(x) for x in stdin.readline().rstrip().split()]
 
z = int(x/y)
if(x%y==0):
  print(z)
else:
  print(z+1)

Solution (Python):
import math

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

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

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


s = 1
counter = 1
while counter>0:
    if H - A >0:
        H = H - A
        s = s + 1
        counter = counter
    else:
        H = H - A
        s = s
        counter = counter - 1
        print(s)

Solution (Python):
h,d = list(map(int, input().split()))
c,m = divmod(h,d)
if 0 != m:
  m = 1
print(c+m)

Solution (Python):
def main(Hitpoint,Attack):
  count_num = 0
  while True:
    Hitpoint -= Attack
    count_num += 1
    if Hitpoint <= 0:
      break
  return count_num
 
if __name__ == "__main__":
    inp=input().split()
    hitpoint = int(inp[0])
    attack = int(inp[1])
    print(main(hitpoint,attack))

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
from math import ceil
num = [int(_) for _ in input().split()]
print(ceil(num[0] / num[1]))

Solution (Python):
import math

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

print(ans)

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

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

Solution (Python):
import math

if __name__ == '__main__':
    
    

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

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

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

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

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

input = list(map(int,input().split()));
print(math.ceil(input[0]/input[1]));

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

print(ans)

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

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

print(count)

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

Solution (Python):




def main():
  s = list(map(int,input().split()))
  hp = s[0]
  ad = s[1]
  ans = int(hp / ad)
  if(ans * ad < hp):ans = ans + 1
  print(ans)
if __name__ == '__main__':
  main()

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

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

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

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

Solution (Python):
import re

Input = input()

pat = r'[0-9]+'

num_list = re.findall(pat, Input)



cou = int(num_list[0])//int(num_list[1])

if int(num_list[0]) % int(num_list[1]):
    cou += 1

print(cou)

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

Solution (Python):
import re

Input = input()

pat = r'[0-9]+'

num_list = re.findall(pat, Input)




HP = int(num_list[0])
ATK = int(num_list[1])

cou = HP//ATK

if HP % ATK:
    cou += 1

print(cou)

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

ans = -(-H // A)

print(ans)

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

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

Solution (Python):
import math

input = input().split()
h = int(input[0])
a = int(input[1])

answer = math.ceil(h / a)
print(answer)

Solution (Python):
import math

input = input().split()
h = int(input[0])
a = int(input[1])

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

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

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

print(attack)

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

if H <= 0:
    print(S)

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

Solution (Python):
a, b = map(int, input().split())
x, y = divmod(a,b)
print(x+1 if y!=0 else x)

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

if i[0] == i[1]:
    print("1")
elif i[0] % i[1] > 0:
    print((i[0] // i[1]) + 1)
else :
    print(i[0] // i[1])

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

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

if i[0] == i[1]:
    print("1")
elif i[0] % i[1] > 0:
    print((i[0] // i[1]) + 1)
else :
    print(i[0] // i[1])

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

print(math.ceil(H/A))

Solution (Python):
s = list(map(int,input().split()))
a = s[0] // s[1]
b = s[0] % s[1]
if b != 0:
  a +=1
print(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:
  times = H // A
else:
  times = (H // A) + 1
  
print(times)

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

Solution (Python):
values = input()
H, A = map(int, values.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())
import math
print(math.ceil(h/a))
import time
time.sleep(1.98)

Solution (Python):
S = input().split(" ") 

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

atCount = 0 

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

print(atCount)

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

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

print(-(-H//A))

Solution (Python):
s = input().rstrip().split(' ')
life = int(s[0])
attack = int(s[1])
cnt=0

while life>0:
    life -= attack
    cnt += 1 
else:
    pass

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())
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):
import logging
logging.basicConfig(level=logging.DEBUG)

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    h, a = LI()
    print(math.ceil(h/a))
    return



if __name__ == "__main__":
    solve()

Solution (Python):
import sys
 
for line in sys.stdin:
    h, a = list(map(lambda x: int(x), line.split()))
    hits = h // a
    if h % a == 0 and a > 0:
        print(hits)
    else:
    	print(hits + 1)

Solution (Python):

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

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

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

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

Solution (Python):
N, A = [int(_) for _ in input().split()]
count = 0
while True:
    if N > 0:
        N -= A
        count += 1
    else:
        break

print(count)

Solution (Python):
N,K = [int(x) for x in input().split()]
print(-1*((-1*N)//K))

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

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

Solution (Python):
nums=[int(i) for i in input().split()]

if nums[0]%nums[1]==0:
    print(int(nums[0]/nums[1]))
    
else:
    print(int(nums[0]/nums[1])+1)

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

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

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

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

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

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

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

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

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

print(i)

Solution (Python):
import math

val = input().split(' ')
h = float(val[0])
a = float(val[1])

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

Solution (Python):
from math import ceil

h, a = [float(x) for x in input().split()]
print(ceil(h / a))

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

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

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

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

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

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

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

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

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):
def get_total_strike_times(health: int, damage: int) -> int:
    """
    Given a monster's health and damage in integer,
    calculate the number of attack required to deplete the monster's health.
    :param health: int
    :param damage: int
    :return: int
    """
    return int((health + damage - 1) / damage)


if __name__ == '__main__':
    print(get_total_strike_times(*map(int, input().split())))

Solution (Python):
import math


def get_total_strike_times(health: int, damage: int) -> int:
    """
    Given a monster's health and damage in integer,
    calculate the number of attack required to deplete the monster's health.
    :param health: int
    :param damage: int
    :return: int
    """
    return math.ceil(health / damage)


if __name__ == '__main__':
    print(get_total_strike_times(*map(int, input().split())))

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

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

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

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

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

Solution (Python):
y = input()
data = y.split()
data2 = [int(str) for str in data]


time = int(data2[0]/data2[1])
if data2[0]%data2[1] != 0 : time += 1

print(time)

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

print(i)

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

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

num = H // A
amari = H % A

if amari > 0:
	print(num+1)
else:
	print(num)

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

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

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

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

print(n)

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

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

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

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

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

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

Solution (Python):
import math

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

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

a = int(H/A)
b = int(H%A)

if b!=0:
  a+=1

print(a)

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

HP = int(H) / int(A)
print(math.ceil(HP))

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

Solution (Python):
import math

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

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

num = 0
while True:
    H -= A
    num += 1
    if H <= 0:
        break

print(num)

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
import math

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

Solution (Python):
import math
a, b = map(float, input().split())
x = a / b
if (x.is_integer() == False):
    print(math.ceil(x))
else:
    print(int(x))

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

Solution (Python):
hp_list = input().split(" ")
h = int(hp_list[0])
a = int(hp_list[1])
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1

count = int(count)
print(count)

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

out = math.ceil( h / a)
print(out)

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)

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

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

if int(c/d)==c/d:
  print(str(int(c/d)))
else:
  print(str(int(c/d)+1))

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

import math

answer = H/A

if answer.is_integer():
    print(math.floor(answer))
else:
    print(math.floor(answer)+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:
  print(h//a)
else:
  print(h//a + 1)

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

Solution (Python):

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()



def main():
    H,A = isRaw()
    return (H+A-1)//A


if __name__ == "__main__":
    print(main())

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

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,m = LI()

    return (n+m-1) // m


print(main())

Solution (Python):
import math

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

print(math.ceil(H/A))

Solution (Python):
import math

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

print(math.ceil(H/A))

Solution (Python):


import math

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

print(math.ceil(H/A))

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

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

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

print(sho)

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((-(-a//b)))

Solution (Python):

import sys
import math

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

if (H%A >0):
  print(int(math.ceil(H/A)))
else:
  print(int(H/A))

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

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

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

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

Solution (Python):
import sys
h,a = map(int,sys.stdin.readline().split())
print(int((h+a-1)/a))

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

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

while A*N<H:
  N=N+1
print(N)

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

Solution (Python):


n,m = map(int,input().split())


print((n-1)//m+1)

Solution (Python):

H, A = map(int,input().split())
count=0
while H>0:
    count+=1
    H-=A
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 = (int(x) for x in input().split())
cnt = 0
while True:
    h -= a
    cnt += 1
    if h <= 0:
        break
print(cnt)

Solution (Python):

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

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

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