Problem:
 Score : 100 points    Problem Statement Serval is fighting with a monster.  The health of the monster is H .  In one attack, Serval can decrease the monster's health by A .
There is no other way to decrease the monster's health.  Serval wins when the monster's health becomes 0 or below.  Find the number of attacks Serval needs to make before winning.      Constraints  1 \leq H \leq 10^4  1 \leq A \leq 10^4  All values in input are integers.         Input Input is given from Standard Input in the following format:  H  A       Output Print the number of attacks Serval needs to make before winning.        Sample Input 1 10 4      Sample Output 1 3   After one attack, the monster's health will be 6 .  After two attacks, the monster's health will be 2 .  After three attacks, the monster's health will be -2 .   Thus, Serval needs to make three attacks to win.       Sample Input 2 1 10000      Sample Output 2 1       Sample Input 3 10000 1      Sample Output 3 10000

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

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

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



	

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

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

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

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

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

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

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

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):
x,y = map(int,input().split())

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

Solution (Python):
import math

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

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

print(ans)

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

print(m.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())


if abs(H/A-H//A)<0.000001:
    print(H//A)
    
else:
    print(H//A+1)

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

Solution (Python):

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

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

cnt = H//A
if H - A * cnt > 0:
    cnt += 1

print(cnt)

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

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

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

print(math.ceil(a/b))

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

Solution (Python):
a,b=map(int,input().split())
count=1
A=True
while A==True:
    a=a-b
    if a>0:
        count=count+1
    else:
        A=False

print(count)

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

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

ans = 0

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

print(ans)

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

print(-(-H // A))

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

print(count)

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok


def main():
    H,A=mis()
    print(math.ceil(H/A))


main()

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

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

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

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

n = 1

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

print(n)

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

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

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

count = H // A

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

print(count)

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

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

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

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

print(ans)

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

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


H, A = inpl()

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

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

syo = H/A
f = H % A

if f==0:
  print(int(syo))
else:
  print(int(syo+1))

Solution (Python):


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

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

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

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

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

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

Solution (Python):

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

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

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

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

print(count)

Solution (Python):
import math

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

if __name__ == "__main__":
  main()

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

x, y = divmod(h, a)
if y == 0:
    print(x)
else:
    print(x+1)

Solution (Python):
import math

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

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

n = 0
while h - n * a > 0:
    n += 1

print(n)

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

Solution (Python):
import math

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

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

Solution (Python):
import math

line=input().split()
ANS=int(line[0])/int(line[1])
print(math.ceil(ANS))

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

Solution (Python):
from math import ceil

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

Solution (Python):
"""
NTC here
"""
import sys
inp= sys.stdin.readline
input = lambda : inp().strip()
flush= sys.stdout.flush




def iin(): return int(input())
def lin(): return list(map(int, input().split()))





def main():
    h, a = lin()
    print((h+a-1)//a)



            
        

        
main()

Solution (Python):
import math

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

print(math.ceil(a/b))

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

count = 0

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

print(count)

Solution (Python):
d = input().split(" ")
h = int(d[0])
a = int(d[1])
b = - ((-1*h) // a) 
print(b)

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

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

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

Solution (Python):
import math

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

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

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

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

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

q   = h // a
mod = h % a

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

print(ans)

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

ans = 1
while True:
    if H <= A * ans:
        break
    ans += 1

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

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

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

Solution (Python):
import math

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

if(A >= H):
    print(1)

else:
    tmp = H / A
    print(math.ceil(tmp))

Solution (Python):
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

H, A = lr()
print(-(-H // A))

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

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

Solution (Python):
A, B = [int(s) for s in input().split()]
count = 0
while A > 0:
  A -= B
  count += 1
print(count)

Solution (Python):
import math

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

if __name__ == "__main__":
    main()

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

i = 0
energy = H

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

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

for i in range(10001):
    if A-B*i<=0:
        print(i)
        break

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

n = H // A
m = H % A

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

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

Solution (Python):


import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy


def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z


def bfs(SS, x, y, H, W):
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" 
    for i in range(4): 
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      
      
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" 
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      
  return mlength

def brick(a,n,m,N):
  
  if not m in a[n:]:
    print(N-(m-1))
  else:
    
    brick(a,a[n:].index(m),m+1,N)



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

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

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

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

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

print(c)

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

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

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

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)

print(ans)

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

Solution (Python):
H,A = map(int,input().split())
q,mod = divmod(H,A)
ans = q
if(mod!=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
line = input().split(' ')
M = int(line[0])
N = int(line[1])
print(math.ceil(M/N))

Solution (Python):
import math

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

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

import math

print(int(math.ceil(cnt)))

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

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

Solution (Python):



h, k = [int(x) for x in input().split()]








if h < k:
  print(1)

elif h/k == h//k:
  print(h//k)

else:
  print(h//k+1)

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

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

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

while True:
    h= int(h) - int(a)
    i = i + 1
    if(int(h)<=0):
        break
        
print(i)

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

if (H / A).is_integer():
    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())
cnt = 0

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

Solution (Python):
import math

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

print(math.ceil(H/A))

Solution (Python):
import math


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


if __name__ == '__main__':
    main()

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

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

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

b = H // A
c = H % A
if not c == 0:
    b += 1

print(b)

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

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

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

Solution (Python):
import math

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

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

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

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

print(math.ceil(H/A))

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

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

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

Solution (Python):
import math

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

print(math.ceil(n / h))

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

Solution (Python):
H,A = list(map(int, input().split()))
i = 0
while(True):
    i += 1
    if A * i >= H:
        break

print(i)

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

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

Solution (Python):
import math

[H, A] = map(int, raw_input().split())

print int(math.ceil(1.0*H/A))

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


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

Solution (Python):
from math import ceil
h,a = [int(x) for x in input().split()]
print(ceil(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 = [int(x) for x in input().split()]

cnt = 0
hp = h
for _ in range(h):
    hp -= a
    cnt += 1
    if hp <= 0:
        break

print(cnt)

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

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

print(cnt)

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

Solution (Python):
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    h, n = get_list()
    print((h+n-1)//n)



''' Pythonista fLite 1.1 '''
import sys




input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

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

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

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

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

N,M = two_int()

temp = N/M

if temp.is_integer():
    print(int(temp))
else:
    print(int(temp)+1)

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

print(-(-H//A))

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

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

if (x[0]/x[1]).is_integer():
    print(int(x[0]/x[1]))
else:
    print(int(x[0]/x[1])+1)

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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

i, m = divmod(H, A)

if m != 0:
    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())
cnt=0
while H > 0:
    H -= A
    cnt += 1
print(cnt)

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, m = LI()
    if n % m == 0:
        print(n // m)
    else:
        print(n // m + 1)

if __name__ == '__main__':
    main()

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

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

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

print(cnt)

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

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

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

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

Solution (Python):
data = input().split()
strengh = int(data[0])
attack = int(data[1])
count = 0

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

Solution (Python):



import pdb
import sys
F = sys.stdin

H,A = map(int,F.readline().split())

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

print(ans)

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

ans = h // a
ama = h % a

if ama != 0:
  ans += 1
print(ans)

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

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

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

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

Solution (Python):
import math

def main():
    H,A = map(int, input().split())
    if(float.is_integer(H/A)):
        res = int(H/A)
    else:
        res = int(H/A)+1
    print(res)

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import numpy as np

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

ans = N // A

if N%A>0:
	ans += 1

print(ans)

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

Solution (Python):



health, attack = map(int, input().split())
m = health % attack
d = int(health / attack)

if m != 0:
    d += 1
print(d)

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

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (h, a) = [int(e) for e in lines[0].split(" ")]

    return (h, a)


def solve(h, a):

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


    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

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

Solution (Python):
import collections
import itertools as it
import math
import numpy as np








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

c = 0
for i in range(1000000000):
    if H <= 0:
        break
    else:
        c += 1
        H -= A

print(c)

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

n=(h-1)//a+1

print(n)

Solution (Python):
import math

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

num = a/b
print(math.ceil(num))

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

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

m = h % a

n = h // a 
if m:
    n += 1
print(n)

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

print(ans)

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 






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

h,a = list(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:
    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())
print(-((-h)//a ))

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

print(math.ceil(H/A))

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

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

Solution (Python):
[H,A] = [int(s) for s in input().rstrip().split(' ')]
if H % A == 0:
    print(H // A)
else:
    print(H // A + 1)

Solution (Python):
import math

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

time=math.ceil(H/A)

print(time)

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

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

print(math.ceil(h/a))

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import math

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

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

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

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

print((x+y-1)//y)

Solution (Python):
def resolve():
    import sys
    input = sys.stdin.readline
    
    H, A = map(int, input().split())

    d = H // A
    r = H % A

    if r != 0:
        print(d + 1)
    else:
        print(d)


if __name__ == "__main__":
    resolve()

Solution (Python):
import math

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

Solution (Python):
import math

P = [int(p) for p in input().split()]
H = P[0]
A = P[1]

print(math.ceil(H/A))

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

Solution (Python):


def main():
    h, a = map(int, input().split(" "))
    atack = h // a
    if atack * a < h:
        atack += 1
    print(atack)


if __name__ == '__main__':
    main()

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

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

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

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

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