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 sys, bisect, math, itertools, string, queue, copy


from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input()) 
def inpm(): return map(int,input().split()) 
def inpl(): return list(map(int, input().split())) 
def inpls(): return list(input().split())  
def inplm(n): return list(int(input()) for _ in range(n)) 
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return sorted([list(map(int, input().split())) for _ in range(n)]) 
def graph():
    n=inp()
    g=[[] for _ in range(n)]
    for i in range(n):
        a = inp()
        a -= 1
        g[i].append(a)
        g[a].append(i)
    return n,g

def main():
    h,a = inpm()
    ans = h//a
    if h%a != 0:
        ans += 1
    print(ans)

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

Solution (Python):
import math
b,a=map(int,input().split())
if b%a==0:
    print(b//a)
else:
    print(b//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())
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):
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    h,a=MI()
    c=0
    while h>0:
        h-=a
        c+=1
    print(c)

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

Solution (Python):
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())
ans = (h - 1) // a + 1
print(ans)

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

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

Solution (Python):

import sys
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())
ans = 0
while True:
    ans += 1
    if A * ans >= H:
        print(ans)
        exit()

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

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

Solution (Python):
import sys
import math
import functools
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]


h, a = na()
print((h-1)//a+1)

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

if h % a:
  print(h // a + 1)
else:
  print(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):
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 = 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())
for i in range(10001):
    if a*i>=h:
        print(i)
        break

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

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

if __name__ == '__main__':
    main()

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

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

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):
h,a = [int(j) for j 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())
cnt = 0

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

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

Solution (Python):
h, a = [int(s) for s in input().strip().split()]
result = (h + a - 1) // a
print(result)

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

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

main()

Solution (Python):
import bisect
import numpy as np
import math
import itertools
def main():
    H, A = map(int, input().split())
    print(math.ceil(H/A))
    return 0

if __name__ == '__main__':
    main()

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

c=0
while(1):
    if h<=0:
        break
    else:
        h-=a
        c+=1

print(c)

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

Solution (Python):
import math
def A():
    temp = [int(i) for i in input().split()]
    print(int(math.ceil(temp[0]/temp[1])))

A()

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

print(math.ceil(H/A))

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


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

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

print(ans)

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

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

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

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

if __name__ == '__main__':
    main()

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

q, r = divmod(H, A)

if r == 0:
    print(q)
else:
    print(q + 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:ans += 1

print(ans)

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

if __name__ == '__main__':
    main()

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

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

print(cnt)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  


h, a = na()
st = 0
while h > 0:
    h -= a
    st += 1
print(st)

Solution (Python):



def solve(*args: str) -> str:
    h, a = map(int, args[0].split())
    return str(h // a + (1 if 0 < h % a else 0))


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

print(-(h//-w))

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

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



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

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

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

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

print((m-1)//n+1)

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

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] = [int(i) for i in input().split()]
times = 0

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

print(times)

Solution (Python):
import math

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

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

	ans = -(-H // A)

	print(ans)

if __name__ == "__main__":
	main()

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

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

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
from math import ceil


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

Solution (Python):

import re
import math
import fractions
import random
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline

mod=int(10**9+7)
inf=int(10**20)
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def comb(n,r):return math.factorial(n)//math.factorial(n-r)//math.factorial(r)
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
 

 

n,m=map(int,input().split())


print(math.ceil(n/m))

Solution (Python):
import math

H, A = [int(x) for x in input().split()]
count = math.ceil(H / A)
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())
print((H+A-1) // A)

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

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

print(ans)

Solution (Python):
from math import ceil

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

print(ceil(H/A))

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

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

Solution (Python):
import math

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

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

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

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

print(ans)

Solution (Python):
import math
a = [int(x) for x in input().split()]
print(math.ceil(a[0]/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 sys,collections,math,random,fractions,bisect;sys.setrecursionlimit(10**7)
sr = sys.stdin.readline; P = print; P2 = lambda x: print(*x, sep="\n")
def I(i=0): t = [int(x)-i for x in sr().split()];return t if len(t) > 1 else t[0]
def S(): t = sr().split(); return t if len(t) > 1 else t[0]
L1,L2,L3,L4, = [],[],[],[]

H,A = I()
print(math.ceil(H/A))

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

Solution (Python):
from math import ceil

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

if __name__ == "__main__":
    main()

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

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  h,a=LI()
  c=0
  for _ in range(100000):
    if h<=0:
      return c
    h-=a
    c+=1


print(main())

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

import math

print(math.ceil(H/A))

Solution (Python):

import sys
input = sys.stdin.readline

h, a = [int(item) for item in input().split()]
print((h + a - 1) // a)

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

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

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

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

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

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

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

if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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

print(cnt)

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

    ans = 0

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

    print(ans)

        
if __name__ == '__main__':
    main()

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

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

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

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

q, r = divmod(H, A)
if r == 0:
    print(q)
else:
    print(q + 1)

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

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


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


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def main():
    H, A = read_values()
    print((H - 1) // A + 1)


if __name__ == "__main__":
    main()

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

Solution (Python):

from itertools import permutations, combinations
from fractions import gcd
from collections import Counter
from math import sqrt
import sys
input = sys.stdin.readline
def lcm(x, y):
    return (x*y//gcd(x, y))
def small_letters():
    return [chr(i) for i in range(97, 97+26)]
def capital_letters():
    return [chr(i) for i in range(65, 65+26)]
def continual_letters(list_x):
    """example"""
    """[2,2,2,2,4,4,5,5,5,8,8,8,8,8] => [4,2,3,5]"""
    i,j = 0,0
    result = []
    k = len(list_x) - 1
    while(True):
        A = list_x[i]
        while(True):
            print(j)
            if list_x[j] != A:
                break
            if j >= k:
                break
            j += 1
        result.append(j-i)
        if i >= k:
            break
        i = j
    result[-1] += 1
    return result


def main():
    """ここに書いてね"""
    H,A = map(int,input().split())
    print(-(-H//A))

if __name__ == '__main__':
    main()

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(H, A):
    return math.ceil(H / A)


def main():
    H, A = read_int_n()
    print(slv(H, A))


if __name__ == '__main__':
    main()

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

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

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



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

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

Solution (Python):
import math
import fractions

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 ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans




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

ans=0

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

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


main()

Solution (Python):

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

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

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
import sys
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop


sys.setrecursionlimit(10 ** 7)

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

if (A % B) == 0:
    a = A // B
else:
    a = (A//B)+1

print(a)

Solution (Python):

class Solution:
    def solve(self, a, b):
        if a % b == 0:
            return a // b
        else:
            return a // b + 1


sol = Solution()

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

print(sol.solve(a, b))

Solution (Python):
import math

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

Solution (Python):
import math

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

ans = math.ceil(h / a)

print(ans)

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

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

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

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

Solution (Python):
import math

def intinput():
    return int(input())

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

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

H,A = splitintinput()
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(i) for i in input().split()]
if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)

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):
N, M = map(int, input().split())
if N % M == 0:
  print(N // M)
else:
  print(N // M + 1)

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

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

print(ans)

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

n = ceil(h / a)
print(int(n))

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

Solution (Python):
import math
H,A = list(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):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

h,a = get_nums_l()
print((h + a -1)//a)

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

H, A = MAP()

print(ceil(H, A))

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

Solution (Python):
import collections
import math
import operator as op
from functools import reduce
import numpy as np
import math
import bisect
import heapq


MOD = 1000000007


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def get_inputs(cast_func=None):
    if cast_func is None:
        return input().split()
    else:
        return list(map(cast_func, input().split()))


def get_input(cast_func=None):
    if cast_func is None:
        return input()
    else:
        return cast_func(input())


def is_prime(n):
    if n == 1:
        return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return False
    return True


def main():
    H, A = get_inputs(int)


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

    return


if __name__ == '__main__':
    main()

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

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

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

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

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