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):
import math
tmp = input().split(" ")
 
HP = int(tmp[0])
attack = int(tmp[1])
 
print(math.ceil(HP/attack))

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

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

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

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

Solution (Python):






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


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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

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

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    H, A = read_ints()
    return H//A + (1 if H%A != 0 else 0)


if __name__ == '__main__':
    print(solve())

Solution (Python):
num,a= input().split()

num= int (num)
a= int(a)
print((int)(num/a)+bool(num%a))

Solution (Python):
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

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

Solution (Python):



















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    H, A = list(map(int, lines[0].split()))
    
    
    
    
    
    
    
    

    result = -(H//(-A))

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['10 4']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['1 10000']
        lines_export = [1]
    if pattern == 3:
        lines_input = ['10000 1']
        lines_export = [10000]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



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

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

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

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

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

print(count)

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

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

print(H//A + (H%A != 0))

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

Solution (Python):

import collections as cl
import sys


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


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


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    h, a = MI()

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


main()

Solution (Python):


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

if h-(r*a)!=0:
  r=r+1
print(r)

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

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

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

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

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

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

if not ( 1 <= H <= 10**4 and 1 <= A <= 10**4 ): sys.exit()
if not ( isinstance(H,int) and isinstance(A,int)): sys.exit()

print(math.ceil(H/A))

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())


H,A=LI()

ans = math.ceil(H / A)

print(ans)

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

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

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

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

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

print(-(-H//A))

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

Solution (Python):
INPUT = list(input().split())
H = int(INPUT[0])
A = int(INPUT[1])
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())

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

Solution (Python):

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


hit = round(h//a)

if h%a != 0:
    hit = hit + 1

print(hit)

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

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

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

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

r1 = n1 // n2
if n1 % n2 != 0:
    r1 += 1

print(r1)

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

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

ans=0

for i in range(H//A+1):
    if H >0:
        H=H-A
        ans+=1
    else:
        break
print(ans)

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

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

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

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

div, mod = divmod(h, a)

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

Solution (Python):

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    H,A = LI()
    print(int(H/A) if H%A==0 else int(H/A+1))

main()

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

d, m = divmod(H, A)

d += [0, 1][m != 0]
print(d)

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

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

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

h,a=lmp()
print((h-1)//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 + (H % A > 0))

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

Solution (Python):

import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	
	sys.stdin = open(name)

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

c = int(a/b)

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

print(c)

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

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

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


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    ans = str(math.ceil(hp / attack))
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    print(str(math.ceil(hp / attack)))


if __name__ == '__main__':
    main()

Solution (Python):
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    print(str(math.ceil(hp / attack)))


if __name__ == '__main__':
    main()

Solution (Python):
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    print(str(math.ceil(hp / attack)))


if __name__ == '__main__':
    main()

Solution (Python):
import math

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

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

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

print(x)

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

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

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

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

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

b = h/a

if int(b) == b:
	print(int(b))
else:
	print(int(b)+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())
counter = 0
while h > 0:
    h -= a
    counter += 1
print(counter)

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

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(abs(-1*H//A))

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

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

print(H//A + (H%A!=0))

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

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

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

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

count = 0
while 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(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())
res = H//A
if H%A != 0 :
    res=res+1
print("{}".format(res))

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

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

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

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

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

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

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

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

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

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

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

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

print(i)

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

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

print(c)

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

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

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

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

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

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

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

print(cnt)

Solution (Python):
H, A = [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())

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

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

t = 0

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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):
print(-eval(input().replace(' ','//-')))

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):
if __name__ == '__main__':

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

Solution (Python):
h,a= (int(a) for a in 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())

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math

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

Solution (Python):
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    H, A = MI()


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

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

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

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

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

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


print(ans)

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

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

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

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

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

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())
div,mod = divmod(H,A)
print(div if mod==0 else div+1)

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

Solution (Python):
import sys












stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    
    h,a = map(int, stdin.readline().rstrip().split())
    
    
    
    
    
    ans = h // a
    if h%a == 0:
        print(ans)
    else:
        print(ans + 1)

if __name__ == '__main__':
    solve()

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


print(i)

Solution (Python):









import os
import sys




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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

import math 


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

print(math.ceil(h / a))

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

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

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


h, a = map(int, input().split())
ans = h//a + (h%a!=0)
print(ans)

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

t = 0
for i in range(H):
    H -= A
    t += 1
    if H<=0:
        print(t)
        exit()

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

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

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

Solution (Python):
a, b = map(int, input().split())
q=a%b
if q==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())
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 = [int(i) for i in input("").split(" ")]
print((h+a-1)//a)

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

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

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

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

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

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

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

if hp % dmg == 0: print(int(hp//dmg))
else: print(int(hp//dmg) + 1)

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

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

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

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

import math

print(math.ceil(H/A))

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

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

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

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

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

Solution (Python):
import math

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

ans = math.ceil(H / A)

print(ans)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

    
    N, K = map(int, input().split())
    
    
    
    print(math.ceil(N/K))





if __name__ == "__main__":
    main()

Solution (Python):
import math

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

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

Solution (Python):


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

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

if h != 0:
    num += 1

print(num)

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

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

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

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

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 + 1 if H/A != H//A else 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())
dm = divmod(H,A)
if dm[1] == 0:
	print(dm[0])
else:
	print(dm[0]+1)

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

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

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

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    solve()

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

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

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

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

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

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

print(count)

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

print(math.ceil(a/b))

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

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

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

print(ans)

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

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

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

Solution (Python):
h,a = map(int, input().split())
an, bn = divmod(h,a)
if bn == 0:
    print(an)
else:
    print(an+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
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))