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

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

Solution (Python):
import sys
input = sys.stdin.readline
H,A = [int(i) for i in input().split()]
d = H // A
m = H % A
if m == 0 :
    print(d)
else :
    print(d+1)

Solution (Python):

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

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

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

Solution (Python):
def wczytaj_liste():
    ciag = input()
    rozdzielona_lista = ciag.split()
    odp = []
    for wyraz in rozdzielona_lista:
        liczba = int(wyraz)
        odp.append(liczba)
    return odp

def Monstery():
    H, A = wczytaj_liste()
    odp = H//A
    if H - odp*A > 0:
        odp += 1
    print(odp)

Monstery()

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

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

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

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

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

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

if a/b-int(a/b)==0:
  c=int(a/b)
if a/b-int(a/b)!=0:
  c=int(a/b)+1

print(c)

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    H, A = LI()
    print(H // A + (H % A > 0))

main()

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

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

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):
cnt = 0

a, b = [int(i) for i in input().split()]

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

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    num = [int(i) for i in input().split()]
    h = num[0]
    a = num[1]
    return attack(h, a)

def attack(h,a):
    if h % a == 0:
        return h // a
    elif h % a >= 1:
        return (h//a) + 1

print(main())

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

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

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

print(cnt)

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

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

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

count = 0

while True:
    if H[0] > H[1]:
        H[0] = H[0] - H[1]
        count+=1
    else:
        count = count + 1
        break
print(count)

Solution (Python):
import math
n,k=map(int,input().split())



print((math.ceil(n/k)))

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

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

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

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

Solution (Python):
import math


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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math
tmp = input().split(" ")
H = int(tmp[0])
A = int(tmp[1])
print(math.ceil(H/A))

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

Solution (Python):
val = input()

H, A = val.split(' ')

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

x = H // A
if H - x * A == 0:
  print(x)
else:
  print(x + 1)

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

Solution (Python):
import math
import fractions
from functools import reduce


if __name__ == '__main__':
    h, a = list(map(int, input().split()))
    print(math.ceil(h/a))

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

result = (hp - 1) // ap + 1

print(result)

Solution (Python):
num = input().split()
H = int(num[0])
A = int(num[1])
if H%A != 0:
    print(H//A + 1)
else:
    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 == 0:
    ans = H//A
else:
    ans = H//A+1
print(ans)

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

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

Solution (Python):
import math

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

Solution (Python):
N, M=map(int,input().split())
count=1
X=0
while N > X:
  X = M * count
  count += 1
print(count-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().strip().split())

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

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

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

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

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

Solution (Python):
import math

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

if __name__=="__main__":
    main()

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

print(-(-H//A))

Solution (Python):
import numpy as np

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

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

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

Solution (Python):
arr1 = str(input())
arr = arr1.split()
health = int(arr[0])
attack = int(arr[1])

if health % attack == 0:
    print(int(health // attack ))
else:
    th = health // attack + 1
    print(int(th))

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

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

Solution (Python):
import math

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

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

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main_1():
    H, A = read_int_list()
    res = H // A
    if H % A != 0:
      res += 1
    print(res)


def main():
    H, A = read_int_list()
    res = 0
    while H > 0:
      H -= A
      res += 1
    print(res)

main_1()

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main_1():
    H, A = read_int_list()
    res = H // A
    if H % A != 0:
      res += 1
    print(res)


def main():
    H, A = read_int_list()
    res = 0
    while H > 0:
      H -= A
      res += 1
    print(res)

main()

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

Solution (Python):

import sys


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



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

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()

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

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

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

Solution (Python):

import sys


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    H = int(next(tokens))  
    A = int(next(tokens))  
    solve(H, A)


if __name__ == "__main__":
    main()

Solution (Python):
import math

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

Solution (Python):
import math

Health, Attach = map(int, input().split())
attackCount = math.ceil(Health / Attach)

print(attackCount)

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

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

ans = 0

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

print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

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

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

Solution (Python):
import math

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

print(math.ceil(H/A))

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

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

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

print(-(-H//A))

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

for i in range(10000):
    if i*A >= H:
        break
    else:
        i += 1
        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())

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

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

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

while h > a * ans:
    ans += 1

print(ans)

Solution (Python):
import sys
import math

h, a = [int(i) for i in sys.stdin.readline().rstrip().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 = list(map(int,input().split()))
print(-(-h//a))

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

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

Solution (Python):

import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

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

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

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines







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

if __name__ == "__main__":
	main()

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


if __name__ == "__main__":
    main()

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

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

print(count)

Solution (Python):

h, a = input().split()
h = int(h)
a = int(a)
x = a
attack = 1

while h > x :
    h -= x
    attack += 1

print(attack)

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

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

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

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

Solution (Python):



from math import ceil
def main():
  h, a = map(int, input().strip().split())
  print('%d' % (ceil(h/a)))

if __name__=='__main__':
  main()

Solution (Python):
nam = input().split()
ans = int(nam[0]) / int(nam[1])

if int(nam[0]) % int(nam[1]) != 0:
  ans += 1

print(str(int(ans)))

Solution (Python):
nam = input().split()
ans = int(nam[0]) / int(nam[1])

if int(nam[0]) % int(nam[1]) != 0:
  ans += 1

print(str(int(ans)))

Solution (Python):



import math


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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math

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

    print(math.ceil(h / a))

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys


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


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
h, a = input().split()
H = int(h)
A = int(a)
ans = 0
for i in range(H):
  if H > 0:
    ans = ans + 1
    H = H - A
  else:
    break
print(ans)

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

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

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

def main():
    N,K = map(int,input().split())
    print(-(-N//K))
    
if __name__ == "__main__":
    main()

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

Solution (Python):
import numpy as np

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




q, mod = divmod(H, A)

if not mod == 0:
    q += 1
print(q)

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 + min(H % A, 1))

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

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

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

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

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

Solution (Python):
import math

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

print (math.ceil(H / A))

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

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

print(n//m +((n%m)!=0))

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

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

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

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

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

ans, c = divmod(H, M)
if c > 0: ans += 1
print(ans)

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

Solution (Python):
from math import ceil

h, a = [int(i) for i in input().split()]
print(ceil(h / a))

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

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

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

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

Solution (Python):
import math
hp, ap = map(int, input().split())
cnt = math.ceil(hp / ap)
print(cnt)

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

if __name__ == '__main__':
    H, A = map(int, input().rstrip().split())
    print(H//A+int(H%A!=0))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, A = MAP()

print(ceil(H/A))

Solution (Python):
import math

def func():
    l = list(map(int, input().split()))
    try:
        for n in l:
            1<= n <= 10**4
            print( math.ceil(l[0] / l[1]) )
            break
    except:
            print("Error")

func()

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

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

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

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

Solution (Python):
hp,atk = [int(x) for x in input().split()]
ans = hp // atk if hp % atk == 0 else hp // atk + 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):
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())
count = 0

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

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

ans = N // A

if ans * A == N:
  print(ans)
else:
  print(ans+1)

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

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

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


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

Solution (Python):
a = [int(i) for i in input().split()]

print(-(-a[0] // a[1]))

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

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

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

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

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

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

print("{}".format(count))

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

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+int(h%a!=0))

Solution (Python):


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

s = 0

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

print(s)

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

if n[0] % n[1] != 0:
  t = 1

print(n[0] // n[1] + t)

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

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

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

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

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

Solution (Python):
import math

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

print(math.ceil(h/a))

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

res =data[0]//data[1]
if data[0]%data[1]!=0:
   res=res+1

print(res)

Solution (Python):

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

print(math.ceil(H/A))

Solution (Python):
a=input().rstrip().split(" ")
b=int(a[0])
n=0

while b>0:
  b-=int(a[1])
  n+=1

print(n)

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

Solution (Python):


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

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

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

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

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

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

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

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

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

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

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

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

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

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

print(math.ceil(h/a))

Solution (Python):
import math
IN = map(int,input().split())
ans = 0; mod = pow(10,9)+7
h,a=IN
print(math.ceil(h/a))

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

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