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

if H % A == 0:
  res = H // A
else:
  res = H // A + 1

print(res)

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

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

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

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

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

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

cnt = 0

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

print(cnt)

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

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

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

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

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

print(ans)

Solution (Python):

N, M = input().strip().split()
N, M = [int(N), int(M)]

if N % M:
	ans = N // M + 1
else:
	ans = N // M
print(ans)

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

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

q, mod = divmod(int(h), int(a))
if mod != 0:
    q = q + 1
    print(q)
else:
    print(q)

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

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

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

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

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


print(ans)

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

Solution (Python):
inputa = input()

h,k = inputa.split()
H=int(h)
K=int(k)
cnt=0
while(H>0):
  H=H-K
  cnt=cnt+1

print(cnt)

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

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


main()

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

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

print(count)

Solution (Python):
from fractions import gcd


import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7



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


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    
    return divisors


def factorize(n):
    fct = []  
    b, e = 2, 0  
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret


class UnionFind:
    def __init__(self, n):
        self.sz = [-1 for i in range(n)]

    
    def find(self, x):
        if self.sz[x] < 0:
            return x
        else:
            self.sz[x] = self.find(self.sz[x])
            return self.sz[x]

    
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.sz[x] > self.sz[y]:
            x, y = y, x
        self.sz[x] += self.sz[y]
        self.sz[y] = x

    
    def same(self, x, y):
        return self.find(x) == self.find(y)

    
    def size(self, x):
        return -self.sz[self.find(x)]


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

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



            


    




    


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
inp =input().split(" ")
ans = (int(inp[0])+int(inp[1])-1)//int(inp[1])

print("{}".format(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())

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

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

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

Solution (Python):
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()
H = int(get(text,2)[0])
A = int(get(text,2)[1])

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

Solution (Python):
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
h, a = i2()
print(h//a if h%a == 0 else h//a+1)

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

import math
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(0--a//b)

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

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

val=n//m
if m*val<n:
  val+=1
print(int(val))

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

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

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

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

print(count)

Solution (Python):
def attack(h, a):
  cnt = h / a
  if h % a != 0:
    cnt += 1
  return int(cnt)

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

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

R1 = H // A
R2 = 1 if H % A > 0 else 0
print(R1 + R2)

Solution (Python):
import sys
import math

def main():
    h, a = [int(x) for x in sys.stdin.readline().split()]
    print(int(math.ceil(h / a)))

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):



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

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

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

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

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

count = 0
while i[0] > 0:
    i[0] -= i[1]
    count += 1

print(count)

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

Solution (Python):
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) 
A = [int(input()) for _ in range(N)] 
lst = [list(map(int,input().split())) for i in range(M)] 
"""

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

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

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

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

Solution (Python):
import math
inputs = input().split(" ")
health, attacks = int(inputs[0]), int(inputs[1])
print(math.ceil(health/attacks))

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

Solution (Python):
hp_atk = input()
      
hp,atk = hp_atk.split(" ")

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

Solution (Python):
h,a=map(int,input().split())
count = 0
result = h
for i in range(h):
    result = result - a
    count = count + 1
    if result <= 0:
        break

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

Solution (Python):
import math

H,A = map(int,input().split())
f, i = math.modf(H/A)

if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False

if f == 0:
  print(int(i))
if f != 0:
  print(int(i+1))

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

c=h//a+(h%a>0)

print(c)

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

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

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

Solution (Python):
from decimal import Decimal
h, a = list(map(int,input().split(' ')))

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


  
print(n-1)

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

Solution (Python):
import sys

for line in sys.stdin:
    l= line.split()
    H=int(l[0])
    A=int(l[1])
    i = 0
    while(H>0):
        H-=A
        i+=1
    print(i)

Solution (Python):
import math

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

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

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

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

Solution (Python):

listA=[]

try:
    listA = list(input().split())
    
    
    
except:
    quit();
    

H=int(listA[0])
A=int(listA[1])

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

Solution (Python):
args = input().split(' ')

Health = int(args[0])
AttackPoint = int(args[1])

AttackCount = (Health // AttackPoint) + (1 if (0 != Health % AttackPoint) else 0)

print(AttackCount)

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

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

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

Solution (Python):
import math
query=[int(x) for x in input().split()]
N = query[0]
K = query[1]
print(math.ceil(N/K))

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

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

Solution (Python):
a = input()
aa = a.split()
a0 = int(aa[0])
a1 = int(aa[1])

t = 1

while a0 > a1:
    a0 = a0 - a1
    t += 1
    
print(t)

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

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

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

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

print(math.ceil(H/A))

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

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

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

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

Solution (Python):
import math

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

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

Solution (Python):

import itertools
import sys
import math
import numpy as np
from collections import deque
from itertools import combinations
from functools import lru_cache
sys.setrecursionlimit(10**9)


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

    m,r = divmod(H,A)

    print(m if r == 0 else m + 1)

if __name__ == "__main__":
  main()

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

print(ans)

Solution (Python):






import math
import statistics
import numpy as np
import queue

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

Solution (Python):
from math import ceil

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

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

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

print(ans)

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

Solution (Python):

  
class Monster():
  def __init__(self, hp):
    self.hitpoint = hp

  def damage(self, damage):
    return -(-self.hitpoint // damage)

def main():
  input_string = raw_input()
  monster = Monster(int(input_string.split(' ')[0]))
  print(monster.damage(int(input_string.split(' ')[1])))

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
N,M = (int(x) for x in input().split())
 
K = int(N/M)
if N < M:
  print(1)
elif N%M == 0:
  print(K)
else:
  print(K+1)

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

Solution (Python):

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

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

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

Solution (Python):
h, a = list(map(int, input().split()))
print(int((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())
for i in range(1000000):
    if A*i>=H:
        print(i)
        break

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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


if __name__ == '__main__':
    main()

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

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

I = list(map(int, input().split()))
H = I[0]
A = I[1]
count = 0

if not 1 <= H or not H <= 10**4 or not 1 <= A or not A <= 10**4:
    print("error:1≤H≤10000,1≤A≤10000である必要があります")
    sys.exit()


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

Solution (Python):
def attack(h, a):
    i = 0
    while True:
        i += 1
        h -= a
        if h <= 0:
            break
    return i

if __name__ == "__main__":
    h, a = map(int, input().split())
    print(attack(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):
x, y = list(map(int,input().split()))

answer = x//y

if not x%y == 0:
    answer = answer + 1

print(answer)

Solution (Python):
import sys
sys.setrecursionlimit(int(1e6))

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

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

Solution (Python):


 
a = input().split(" ")
H = int(a[0])
A = int(a[1])
ans = 0
while H > 0:
    H -= A
    ans += 1
print(ans)

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

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

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

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

Solution (Python):



a = input().split(" ")
H = int(a[0])
A = int(a[1])
ans = 0
while H > 0:
    H -= A
    ans += 1
print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

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

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

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

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

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

Solution (Python):



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

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


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

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

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

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

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

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

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

h=x[0]
a=x[1]

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

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

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

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

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

Solution (Python):
import math
from sys import stdin, stdout
 
def main():
	arr = [int(x) for x in stdin.readline().split()]
	H, A = arr
	count = 0
	while H > 0:
		H -= A
		count += 1
	stdout.write(str(count))
    
if __name__ == "__main__":
	main()

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

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

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

Solution (Python):
a = 0

li = input().split()
li = [int(i) for i in li]

while 0 < li[0]:
    a += 1
    li[0] -= li[1]

print(a)

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

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

Solution (Python):
import numpy as np

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def resolve():
    H, A = map(int, input().split())
    Ans = H // A
    _Ans = H % A

    if _Ans >= 1 :
        print(Ans + 1)

    else :
        print(Ans)
        
resolve()

Solution (Python):
def resolve():
    n, a = map(int, input().split())

    print(-((-1 * n) // a))
    
resolve()

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

Solution (Python):

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

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

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

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

Solution (Python):
import numpy as np
def main():
    H,A = map(int, input().split())
    ans = int(H/A)
    if H%A > 0 : ans+=1
    print(ans)
    return

if __name__=="__main__":
    main()

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

Solution (Python):
import sys
inputs = sys.stdin.readline()
inputs = inputs.split()


H, A = int(inputs[0]), int(inputs[1])

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

print(cnt)

Solution (Python):
import math
 
line = input()
numList = [int(num) for num in line.split(' ')]
monsterHP,servalA = numList[0],numList[1]
print(math.ceil(monsterHP/servalA))

Solution (Python):
from sys import stdin
A,B=map(int,stdin.readline().rstrip().split())
print((A//B)+1 if A%B!=0 else A//B)

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

print(-(-H//A))

Solution (Python):
hp, at = map(int, input().split(' '))
ans = 0
while hp > ans * at:
  ans += 1

print(ans)

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

Solution (Python):



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

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

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

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

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