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):
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def main():
    H, A = [int(x) for x in input().split()]
    return H // A if H % A == 0 else H // A + 1


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

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

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

print (i)

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

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

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

Solution (Python):
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
(H, A) = list(map(int,input().split()))

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

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

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

print(-(-H // A))

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

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

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

print(ans)

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

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

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

print(-(-h//a))

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

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

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


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

Solution (Python):
s=input().split()
h=int(s[0])
a=int(s[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())
q= h/a

print(math.ceil(q))

Solution (Python):

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

print(math.ceil(H/A))

Solution (Python):
from sys import stdin
import math


def main(inp):
    h, a = [int(i) for i in inp.split(sep=' ')]
    ret = math.ceil(h / a)
    return ret


if __name__ == '__main__':
    input_line = stdin.readline().rstrip()
    ret = main(input_line)
    print(ret)

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

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

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

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

print(count)

Solution (Python):
import sys
read = sys.stdin.read

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

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

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):
h,a = (int(x) for x in input().split())


rep = int(h/a)

if rep*a < h:
  rep = rep +1

print(rep)

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

n = H//A
r = H%A

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

Solution (Python):
def resolve():
    H, A = map(int, input().split())
    tmp = H
    count = 0
    while True:
        tmp -=A
        count +=1
        if tmp <=0:
            print(count)
            exit()



if __name__ == "__main__":
    resolve()

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

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

print(ans)

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

Solution (Python):

import sys


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



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

Solution (Python):
import math

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

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

print(math.ceil(H / A))

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

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

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

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

print(count)

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

Solution (Python):
import sys


def main():
    tmp = input().split()
    h = int(tmp[0].replace('\n',''))
    a = int(tmp[1].replace('\n',''))
    n= h/a
    if (h%a >0):
        n+=1
    print(int(n))

if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Solution (Python):
H, A = map(int, input().split())
b=0
for i in range(10001):
    if b>=H:
        print(i)
        break
    else:
        b=b+A

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

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

print(i)

Solution (Python):
a, b = map(int, input().split())
q = a // b
rem = a % b

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

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

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

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

Solution (Python):
h, a = list(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())
x = math.ceil(h / a)
print("{}".format(x))

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

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

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

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

Solution (Python):
H = input()
arr = [int(i) for i in H.split(' ')]
count = 1
if(arr[0]<arr[1]):
	print(count)
else:
	while arr[0]>arr[1]:
		arr[0] = arr[0] - arr[1]
		count = count + 1
	print(count)

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

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

Solution (Python):

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




Count = int(H/A)



amari = H%A

if amari == 0:
    print(Count)
else:
    print(Count+1)

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

N = math.ceil(H/A)

print(N)

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

q, mod = divmod(list[0], list[1])
if mod == 0 :
  print(q)
else :
  print(int(q+1))

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

if H % A == 0:
    print(ans - 1)
else:
    print(ans)

Solution (Python):
inp = input().rstrip().split(" ")
HP = int(inp[0])
ATK = int(inp[1])
if HP % ATK == 0:
  print(int(HP / ATK))
else:
  print(int(HP / ATK) + 1)

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

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

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

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

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

print(ans)

Solution (Python):
from sys import stdin
lines = stdin.readlines()
 
H, A = map(int, lines[0].split())

cnt = 1
while cnt <= 10000:
  if cnt * A >= H:
    print(cnt)
    break
  cnt += 1

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

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

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

Solution (Python):
if __name__=="__main__":
    h, a = map(int, input().split())

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

    print(ans)

Solution (Python):
x, y = map(int,input().split())

if x % y == 0:
  ans = x // y
else:
  ans = x // y + 1
 
print(ans)

Solution (Python):
A = list(map(int, input().split()))
print(-(-(A[0])//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())
count = 0
while H>0:
  count+=1
  H-=A
print(count)

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

Solution (Python):
x,y = map(int,input().split())

count = x//y

if x%y != 0:
    count += 1

print(count)

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

for i in range(1,1000000):
    if H - i * A <= 0:
        print(i)
        break

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

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

counter = 0
H = num[0]

while H > 0:
    H -= num[1]
    counter += 1

print(counter)

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

Solution (Python):
A = list(input().split(" "))
h = int(A[0])
a = int(A[1])
i = 0
b = 0
while(h>b):
    i += 1
    b = a*i
print(i)

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

Solution (Python):
HP, AT = map(int, input().split())
count = 0

while(HP > 0):
  HP = HP - AT
  count = count + 1
  
print(count)

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

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

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

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

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

k = 0
while True:
  k += 1
  h -= a
  if 0 >= h:
    break

print(k)

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

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

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

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

count = 1
sum_damage = 0

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

print(str(count))

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

Solution (Python):
import sys
import math

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

print (math.ceil(h/a))

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

Solution (Python):


import math
import string


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, A = inputIntList()
  ans = math.ceil(H / A)

  return ans


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

Solution (Python):
input1 = input().split()
HP = int(input1[0])
ATK = int(input1[1])

if HP%ATK != 0:
    print(HP//ATK + 1)
else:
    print(HP//ATK)

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

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

Solution (Python):


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

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

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

Solution (Python):

import sys


def solve(H: int, A: int):
    result = 0
    while H > 0:
        H = H - A
        result += 1
    print(result)

    return



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

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

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

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

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

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

Solution (Python):
import math

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


def main():
    return math.ceil(H / A)


ans = main()

print(ans)

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

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

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

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

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

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

if h < a:
    print("1")
elif (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):
H, A = map(int, input().split())
q, mod = divmod(H, A)

if mod == 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):
from sys import stdin
H,A = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
while True:
    H -= A
    ans += 1
    if H <= 0:
        break
print(ans)

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

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

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

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

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

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())
r = h % a
t = h // a

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

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

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

Solution (Python):
import numpy as np
H, A = map(int, input().split())
num = int(np.ceil(H/A))
print(num)

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

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

Solution (Python):
num = input().split(" ")
hpoint = int(num[0])
dmg = int(num[1])
atk = int(hpoint / dmg)
result = hpoint % dmg

if result != 0:
  atk += 1
print(atk)

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

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

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

ans = 0

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

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

Solution (Python):


from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd
from itertools import permutations, combinations

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

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas





H, A = mulinputs()




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

Solution (Python):
H = input()
arr = [int(i) for i in H.split(' ')]
count = 1
if(arr[0]<arr[1]):
	print(count)
else:
	while arr[0]>arr[1]:
		arr[0] = arr[0] - arr[1]
		count = count + 1
	print(count)

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

Solution (Python):

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

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

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

if __name__=='__main__':
  T= int(H//A) if H % A==0 else int(H//A)+1
  print(T)

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

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

ans = 0

while True:
    if h > 0:
        ans += 1
        h -= a
    else:
        break

print(ans)

Solution (Python):

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

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

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

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

Solution (Python):
def read_int_n():
    return list(map(int, input().split()))
A=read_int_n()
h=A[0]
a=A[1]

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

Solution (Python):
import math

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

n = math.ceil(H / A)

print(n)

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

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

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

Solution (Python):
def main():
    H,A = (int(x) for x in input().split())
    a = 1
    while H - A*a >0:
        a += 1
    print(a)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
def main():
    H, A = [int(_) for _ in input().split()]
    if H < A:
        print(1)
    elif H % A == 0:
        print(H // A)
    else:
        print(H // A + 1)
main()

Solution (Python):
h, at = input().split(' ')
h = int(h)
at = int(at)
i=0

while h>at:
  h = h - at
  i = i + 1
  
print(i+1)

Solution (Python):
import math

h, a = map(int, input().split())
c = h / a
mc = h % a
if mc > 0:
  c += 1
print(math.floor(c))

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

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

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

print(ceil(h/a))

Solution (Python):
import math

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

print (d)

Solution (Python):
import sys
a = input().split()  
h=int(a[0])
b=int(a[1])
for i in range(10000000000):
 res = h-b*i
 if res <=0:
  print(i)
  sys.exit()

Solution (Python):
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

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

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

result=0

if a % b !=0:
    result += 1 

result += a // b 
print(result)

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

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

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


if __name__ == '__main__':
    solve()

Solution (Python):

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

    ans = -((-1 * H) // A)
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):

import math
import numpy as np


DEBUG = True
dprint = print if DEBUG else lambda *x : x

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

print(math.ceil(H / A))

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

Solution (Python):
h,A = map(int,input().split(" "))
result = 1
while h > A*result:
    result+=1
print(result)

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

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

for i in range(10**4+1):
  if a[1]*i >= a[0]:
    break
    
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().strip().split(' '))

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

Solution (Python):
import sys
import numpy as np


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

cnt = 0

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

print(cnt)

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

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

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

ans = h/a

print(math.ceil(ans))

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

Solution (Python):
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

import itertools as iter
import math
import fractions
from functools import reduce

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

H,A = nums()
print(math.ceil(H/A))

Solution (Python):

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

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

print(-(-a//b))

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

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

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

print(ans)

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

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

if h%a==0:
    print(h//a)

else:
    print(h//a+1)

Solution (Python):
import numpy as np
N, a = list(map(int, input().split()))
 
print(int(np.ceil(N/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=0
while H>0 :
    H-=A
    ans+=1

print(ans)

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

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

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

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

print(n // k + 1  if n % k else n //k)

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

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

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):
h, a = (int(x) for x in input().split())

ans = 0

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

print(ans)

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

n = H // A
m = H % A

if m == 0:
    print(n)
else:
    print(n+1)

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

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

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

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

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

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

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

print(int(-(-h//a)))

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

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

print(ans)

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

Solution (Python):
import sys
import math


def main():
    h_and_a_s = sys.stdin.readline().strip().split(' ')
    h, a = [int(s) for s in h_and_a_s]

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


if __name__ == '__main__':
    main()

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

print(-(-H//A))

Solution (Python):
def  win(H,A):
    cnt = 0
    while(H>0):
        cnt +=1
        H = H-A
    return cnt



inp = input().split()

H = int(inp[0])
A = int(inp[1] )
print(win(H,A))

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

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

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

    c += 1

print(c)

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

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

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