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

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

    if h <= a:
        print(1)

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):


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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(H: int, A: int):
    from math import ceil
    print(ceil(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())
ans = h // a
if h % a != 0:
  ans += 1
print(ans)

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

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

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

Solution (Python):






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


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

print(ans)

Solution (Python):
import math
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())
if h % a == 0:
    print(int(h/a))
else:
    print(math.ceil(h/a))

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

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

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

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

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

Solution (Python):


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

num  = H // A
remain = H % A

if A >= H:
  out = 1
else:
 if remain > 0:
    out = num + 1
 else:
    out = num 

print(out)

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

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

print(count)

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

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

print(t)

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

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

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

if a % b == 0:
  print(ans)
elif a % b != 0:
  print(ans + 1)

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

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

print(cnt)

Solution (Python):
from math import ceil

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

print(ceil(H / A))

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

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

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

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

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

print(count)

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

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

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

Solution (Python):
from math import ceil

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

Solution (Python):
from sys import stdin
import math

h, a = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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:
    print(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())) 
b=0

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

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

Solution (Python):
def solve():
    N, M = map(int, input().split())
    return N // M if N % M == 0 else N //M + 1

print(solve())

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

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

print(math.ceil(H/A))

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

Solution (Python):

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

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

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

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

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

print(cnt)

Solution (Python):

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

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

print(count)

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

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

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

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

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

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

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

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

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

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

ans = (h + a - 1) // a
print(ans)

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

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

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

Solution (Python):
H, B = map(int, input().split())
count = 0

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

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



def main():
    from math import ceil

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


if __name__ == '__main__':
    main()

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

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

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

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

ans = int(H / A)

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

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

print(math.ceil(h/a))

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

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

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

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

print(total)

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

Solution (Python):

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

ans = H // A

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

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

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 = (int(x) for x in input().split())
cnt = 0

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

print(cnt)

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

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

print(cnt)

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

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

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

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

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

Solution (Python):


H, A = map(int, input().split())
kaisu=0
q,mod = divmod(H,A)

if mod==0:
    kaisu=q
else:
    kaisu=q+1


print(kaisu)

Solution (Python):


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

kaisu = 0
for num in range(100000):
    H=H-A
    kaisu = kaisu + 1
    if H <= 0:
        break

print(kaisu)

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

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

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

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

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

Solution (Python):
def main():
    H,A = list(map(int,input().split()))
    
    
    count = 0
    for _ in range(pow(10,4)):
        H -= A
        count += 1
        if (H <= 0):
            break
    print(count)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin

def main():
    input = stdin.readline

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):
readline = input()
parmlist = readline.split()

monsterH = int(parmlist[0])
servalA = int(parmlist[1])
attack_times = monsterH/servalA
int_attack_times = int(attack_times)

if attack_times-int_attack_times > 0:
    real_attack_times = int_attack_times + 1
else:
    real_attack_times = int_attack_times

print(real_attack_times)

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

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

Solution (Python):
たいりょく, こうげき = map(int, input().split())
こたえ = (たいりょく - 1) // こうげき + 1
print(こたえ)

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

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

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

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

print(math.ceil(h/a))

Solution (Python):

import math

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

def main(health, attack):
    total = health / attack
    print(math.ceil(total))


if __name__ == '__main__':
    main(h, a)

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

if __name__ == "__main__":
    solve()

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

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

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

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

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

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

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

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

print(ceil(H/A))

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

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

sign = num[0]%num[1]

if sign == 0:
  ans = num[0]//num[1]
else:
  ans = num[0]//num[1] + 1

print(ans)

Solution (Python):
import math
from fractions import gcd

import numpy as np
import scipy as scp


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

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

print(ans)

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

shou=H//A

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

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

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

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

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

Solution (Python):
import sys
from fractions import gcd
from itertools import permutations, combinations, accumulate
from collections import deque
from heapq import heappush, heappop, heapify
import math

input = sys.stdin.readline
sys.setrecursionlimit(10**6)

MOD = 10**9 + 7

def main():
    h,a = list(map(int,input().split()))
    ans = math.ceil(h/a)
    print(ans)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import math


class Param:
  H, A = ( int(x) for x in input().split(' '))
  def culc(self):
    print(math.ceil(self.H/self.A))


tmp = Param()
tmp.culc()

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

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

cnt = 0
while hp > 0:
    hp -= attack
    cnt += 1
    
print(cnt)

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

Solution (Python):

import sys
import math
H, A = map(int, sys.stdin.readline().split())

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

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

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

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

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

print(h//a+min(1,h%a))

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

Solution (Python):
from math import ceil

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

print(ceil(a/b))

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

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

print(-(-h//a))

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

ans = 0

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

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

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

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

Solution (Python):
import math


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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    h, a = list(map(int, readline().split()))
    print((h + a - 1) // a)


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    h,w=INTM()
    print(int((h-0.1)//w+1))
if __name__ == '__main__':
    do()

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

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

Solution (Python):


import math
from collections import defaultdict

(h, a) = [int(s) for s in input().split()]

ans = 0

while h != 0:
    if h <= 0:
        break

    h -= a
    ans += 1

print(ans)

Solution (Python):
A,B = map(int,input().split())
C=A/B
if(C>int(A/B)):
  D=int(A/B)+1
else:
  D=int(A/B)
print(D)

Solution (Python):
import math

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

if __name__ == '__main__':
  main()

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

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

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

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

Solution (Python):
h,a=map(int,input().split())
hp = h//a 
hp2 =h%a

if hp2 == 0:
    print(str(hp))
else:
    times = hp + 1
    print(str(times))

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

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

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

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






ans = ceil(h/a)

print(ans)

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 sys
import math
h, a = [int(i) for i in sys.stdin.readline().split()]
print(math.ceil(h / a))

Solution (Python):

monsterHP, attackDamage = map(int, input().split())
attack = 1


while monsterHP > attackDamage :
    monsterHP -= attackDamage
    attack += 1
print(attack)

Solution (Python):

monsterHP, attackDamage = map(int, input().split())
attack = 1


while monsterHP > attackDamage :
    monsterHP -= attackDamage
    attack += 1
print(attack)

Solution (Python):
import math

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

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

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

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

print(count)

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

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

print(-(-(kazu[0]) // kazu[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())


if a % b == 0:
    ans = math.floor(a / b)
else:
    ans = math.floor(a / b) + 1

print(ans)

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

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

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

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

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

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

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

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

act = 0
remain = H

while remain > 0:
    act += 1
    remain = H - A*act

print(act)

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

if h == 1 or a == 1:
  print(h)
else:
  print((h+a-1) //a)

Solution (Python):

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

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

print(int(ans))

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

Solution (Python):
import math

line = input().split(' ')
life = int(line[0])
attack = int(line[1])

print(math.ceil(life / attack))

Solution (Python):
h, a = map(int, input().split())
flag = False
if h % a != 0:
    flag = True

ans = h // a
if flag:
    ans += 1
print(ans)

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

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

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

Solution (Python):

import math
import sys


def solve(H: int, A: int):
    ans = math.ceil(H / A)
    print(ans)



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 = list(map(int,input().split()))
for i in range(H+1):
    if H > 0:
        H = H-A
    else:
        t = i
        break
print(t)

Solution (Python):
import sys
input = sys.stdin.buffer.readline
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getlist():
    return list(map(int, input().split()))
import math
import heapq
from collections import defaultdict, Counter, deque
MOD = 10**9 + 7
INF = 10**15


def main():
    n, k = getlist()
    print(math.ceil(n / k))


if __name__ == '__main__':
    main()

"""
9999
3

2916
"""

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