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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

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


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

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

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

i = 0

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

print(i)

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

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

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

if H % A == 0:
  result = H // A
else:
  result = H // A +1

print(result)

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

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

print(N)

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

tenpH = H
for n in range(10000):
    tenpH = tenpH - A

    if(tenpH <= 0):
        print(int(n+1))
        break

Solution (Python):
import math
input = input().split(" ")
h =  input[0]
a = input[1]
answer = math.ceil(int(h) / int(a))
print(answer)

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

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

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

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

div, mod = divmod(H, A)

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

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

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

if H == 0:
  print(N)
else: 
  print(N + 1)

Solution (Python):
_input = input().split()

h = int(_input[0])
a = int(_input[1])

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

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

n = math.ceil(h/a)
print(str(n))

Solution (Python):

import math




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



num = b / c

print(math.ceil(num))

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

Solution (Python):
h, a = [int(v) for v in input().split()]

count = h // a
if h % a != 0:
    count += 1

print(count)

Solution (Python):
a,b=map(int,input().split())
i=0
k=0
while k<a:
  i+=1
  k+=b
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())
count = 0
while H > 0:
    H -= A
    count +=1

print(count)

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

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

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

t = 0

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

print(t)

Solution (Python):

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


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

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

Solution (Python):
inp = input().split()
h, a = int(inp[0]), int(inp[1])
ans = h//a
if(h%a != 0):
  ans += 1
print(ans)

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

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

print(count)

Solution (Python):
firstinput = input("")
firstinputsplit = firstinput.split(" ")
H = int(firstinputsplit[0])
N = int(firstinputsplit[1])
kill = 0
if H <= 10000 and N <= 10000:
    while H > 0:
        H = H - N
        kill = kill + 1
    print(kill)
else:
    print(H)

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

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

count=0

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

ans = (H/A)//1

if H%A != 0:
    ans = ans + 1

print(int(ans))

Solution (Python):


import math

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

print(math.ceil(H/A))

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

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

Solution (Python):


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

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

result=0

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

print(result)

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

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

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

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

Solution (Python):

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

Solution (Python):


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

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

Solution (Python):
hs= input().split()
h = int(hs[0])
s = int(hs[1])
if(h % s == 0):
  print(int(h/s))
else:
  result = int(h/s + 1)
  print(result)

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

Solution (Python):
input_list = list(map(int, input().split()))
hp = input_list[0]
atk = input_list[1]
if hp % atk == 0:
  times = int(hp / atk)
else:
  times = int(hp / atk) + 1
print(times)

Solution (Python):
prm = input().split()
hp = int(prm[0])
atk = int(prm[1])
numatk = 0

while hp > 0:
    hp -= atk
    numatk += 1

print(numatk)

Solution (Python):
import os
import sys

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):

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

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

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

Solution (Python):
H, A = map(int, input().split())
syo = H // A
amari = H % A
if amari == 0:
  print(syo)
else:
  print(syo + 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):
import math

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

SUB = int(math.ceil(H / A))

print(SUB)

Solution (Python):


import numpy as np
from sys import stdin


def get_result(data):
    remainder = data[0] % data[1]
    quotient = data[0] // data[1]
    return quotient if remainder == 0 else quotient + 1

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)

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

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

Solution (Python):
a,b=(int(x) for x in input().split())

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

Solution (Python):

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

Solution (Python):
H, A = input().split()
H = int(H)
A = int(A)
kill = H/A
if kill.is_integer():
    kill = int(kill)
    print(kill)
else:
    kill1 = kill + 0.5
    x = round(kill1)
    print(x)

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 = 0, 0
while (H < 1 or H > 10000) and (A < 1 or A > 10000):
  H, A = input().split()
  H, A = int(H), int(A)

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

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

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

hit = H // A


nokori = H % A


if nokori > 0:
  print(hit + 1)
if nokori == 0:
  print(hit)

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

Solution (Python):

def main():
    H, A = map(int, input().split())
    count = 0
    while True:
        H -= A
        count += 1
        if H <= 0:
            break

    print(count)





if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
def run():
  H, A = map(int, input().split())
  ans = -(-H//A)
  print(ans)
  
if __name__ == '__main__':
  run()

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

Solution (Python):
x, y = list(map(int, input().strip().split(' ')))
if(x%y>0):
  print(x//y+1)
else:
  print(x//y)

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())
n=h/a
n1=math.ceil(n)
ans=int(n1)
print(ans)

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

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

ans = float(h)/float(a)

print(int(ans+0.999999999))

Solution (Python):
import sys
import math
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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

x = h/a

if x%1 == 0:
	print(int(x))
else:
	print(int(x)+1)

Solution (Python):
import math

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

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

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

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

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

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

Solution (Python):
H,A = input().split()
H = int(H)
A = int(A)
for i in range(1,H+1):
  if i * A >= H:
    print(i)
    break

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

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

else:
  print(x)

Solution (Python):
a,b=(int(x) for x in input().split())

print(-(-a//b))

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    h, a = LI()
    print((h - 1) // a + 1)
    return



if __name__ == '__main__':
    solve()

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

H = int(H)
A = int(A)

if H / A < 1:
    print(1)
else:
    print(math.ceil(H / A))

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

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

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

n = int(h / a)

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

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

Solution (Python):
import math
H,A=(float(x) for x in input().split())
print(math.ceil(H/A))

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

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H > 0:
        H -= A
        cnt += 1
    return cnt

print(attack(l))

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

Solution (Python):
import sys
import fractions
input = sys.stdin.readline
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(x) for x in input().split()]
print(math.ceil(H/A))

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

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

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

Solution (Python):
import math

h, a = map(int, input().split(' '))
if a >= h:
  print(1)
else:
  print(math.ceil(h/a))

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

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

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

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

print(i)

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

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

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

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

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

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

q, r = divmod(H, A)

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

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 = map(int, input().rstrip().split())
print(int((H - 0.0001)//A + 1))

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


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

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

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

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

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

if H <= A:
    
    print(1)
else:
    while H > 0:
        H -= A
        t += 1
        
    else:
        
        print(t)

Solution (Python):
import math

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

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

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

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

Solution (Python):
inp = raw_input().split()
H = int(inp[0])
A = int(inp[1])

def attack_count():
	count = H // A
	if H % A != 0:
		count += 1
	return count

ans = attack_count()
print(ans)

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

h,a = nm()
print((h-1)//a + 1)

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

Solution (Python):
h, a = map(int, input().split())
div, mod = divmod(h, a)
print(div + bool(mod))

Solution (Python):
import math

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from copy import deepcopy
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = float('INF')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


h, a = LI()
print(h // a + bool(h % a))

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

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

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

Solution (Python):
a,b=map(int,input().split())
c=0
while 1:
  a-=b
  c+=1
  if a<=0:
    break
  else:
    pass
print(c)

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

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

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

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

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

i = 1

while i*A<H:
	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())

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

print(ans)

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

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

v, q = divmod(a, b)
if v == 0:
    print(1)
else:
    if q == 0:
        print(v)
    else:
        print(v+1)

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

a = t.pop()
h = t.pop()

tm = h % a
tt = h // a

if tm > 0:
    tt = tt + 1

print(tt)

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

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

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

Solution (Python):



test = ""

"""
10 4
ans 3
"""

"""
10000 1
"""

test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()



def roundup(n, d):
    if n % d:
        return n // d + 1
    else:
        return n // d


h, a = map(int, input2().split())
    
print(roundup(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())

attack = H - A
count = 1

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

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

print(i)

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

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

Solution (Python):
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np

import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

H,A=acinput()

print(int(np.ceil(H/A)))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math
n,m=list(map(int,input().split()))
ans=math.ceil(n/m)
print(ans)

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

hnum = int(inputnum[0])
anum = int(inputnum[1])
result = hnum // anum
if hnum % anum != 0:
    result= result+1

print(result)

Solution (Python):
def LI():
  return [int(s) for s in input().split()]

H,A = LI()

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

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

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

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

print(result)

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

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

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

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

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

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

Solution (Python):
import math

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

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

num = h//a

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

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

a = H // A

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

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

times = int(H) / int(A)
times = int(round(times))

if(times * A) < H:
  times = times + 1
  print(times)
else:
  print(times)

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

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

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

print(attack_cnt)

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):
buf = input().split(" ")
H=int(buf[0])
A=int(buf[1])
count=0
state=H
while(1):
  if state <= 0:
    break
  state=state-A
  count=count+1

print(count)

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

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

Solution (Python):
num_list = [int(i) for i in (input().split())]
if num_list[0] <= num_list[1]:
    print(1)
elif num_list[0] % num_list[1] == 0:
    print(int(num_list[0] / num_list[1]))
else:
    print(int(num_list[0]/num_list[1]) +1)

Solution (Python):
H , A =  [int(x) for x in input().split()]
attack = True
count = 0

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

print(count)

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