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



Sample input:
10 4


Sample output:
3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
if h%a == 0:
  print(h//a)

else:
  print(h//a + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
h,a=map(int,input().split())
count=0
while h>0:
    h=h-a
    count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print((lambda x: (x[0]-1)//x[1]+1)(list(map(int,input().split()))))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(math.ceil(h/a))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(attack)

Submission status: Accepted

Solution code:

a,b=map(int,input().split())
p=a//b
if a==0:
    print(1)
else:
    if p*b==a:
        print(p)
    else:
        print(p+1)

Submission status: Accepted

Solution code:
h,a = [int(x) for x in input().split()]
i = 0
while h > 0:
    h -= a
    i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().split()
def SvM(H, A):
 n = 1
 while A * n < H:
      n += 1
 return(n)

print(SvM(int(S[0]), int(S[1])))

Submission status: Accepted

Solution code:
h,a = map(int,input().split())
ct=h//a

a=h-ct*a

if a>0:
  ct+=1
print(ct)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    h, a = map(int, input().split())
    kaisuu = h // a
    amari = h % a
    if amari > 0:
        print(kaisuu + 1)
    else:
        print(kaisuu)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

a=0

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

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import math
h,a=map(int,input().split())
# 余ったらもう1回攻撃しないといけないから多めに出すmath.cell
print(int(math.ceil(h/a)))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
h, a = map(int, open(0).read().split())
print(h//a+(h%a!=0))

Submission status: Accepted

Solution code:
import math

hp, attack = map(int, input().split())

print(math.ceil(hp / attack))

# x, y = divmod(hp, attack)
#
# if y == 0:
#     print(x)
# else:
#     print(x + 1)

# count = 0
# 
# while True:
#     hp -= attack
#     count += 1
# 
#     if hp <= 0:
#         print(count)
#         break
#

Submission status: Accepted

Solution code:
hp, attack = map(int, input().split())

x, y = divmod(hp, attack)

if y == 0:
	print(x)
else:
  	print(x + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    H, A = map(int, input().split())
    count = 0

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

    print(count)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(H: int, A: int):
    count = 0
    while True:
        H -= A
        count += 1
        if H <= 0:
            break
    print(count)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

k = h // a

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

Submission status: Accepted

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

print(ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  if num[0]%num[1]==0:
    print(int(num[0]/num[1]))
  else:
    print(int(num[0]/num[1])+1)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(math.ceil(h/a))

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = -(-H//A) 

print(ans)

Submission status: Accepted

Solution code:
def main():
    H,A = [int(x) for x in input().split()]
    ans = H//A
    if H%A > 0:
        print(ans+1)
    else:
        print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

print(math.ceil(h / a))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def resolve():
    h, a = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


# sys.setrecursionlimit(10**5)


def main():
    h, a = geta(int)

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
H,A=map(int,input().split())
cnt=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil
H, A = map(int, input().split())
print("{}".format(ceil(H / A)))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = [int(x) for x in input().split()]
print((h + a - 1) // a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#153a
h, a = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input().split()
h = int(x[0])
a = int(x[1])
count = 0
while h > 0:
  count += 1
  h = h - a
print(count)

Submission status: Accepted

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

a_ = (H / A)
print(int(a_) if a_.is_integer() else int(a_)+1)

Submission status: Accepted

Solution code:

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
# U = input()
ans = 0

# print((a-1,b) if (s[0]==u) else a,b-1)
while True:
    h -= a
    ans+=1
    if h<=0:
        break
    

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
H,A = map(int,input().split())
print(1 if H < A else math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = map(int, input().split(' '))
for i in range(10001):
    if h <= a*i:
        print(i)
        exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
h, a = map(int, input().split())
if h % a == 0:
    print(h // a)
else:
    print((h // a) + 1)

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H / A))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
INF = float('inf')
MOD = 10 ** 9 + 7
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rf(): return float(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
def rf_(): return [float(_) for _ in rs().split()]
def divisors(n, sortedresult=True):
    div = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            div.append(i)
            if i != n // i:
                div.append(n//i)
    if sortedresult:
        div.sort()
    return div
# endregion
H, A = ri_()
print(-(-H // A))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a=[int(_) for _ in input().split()]
import math
print(math.ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A = map(int,input().split())
count = 0
a = 100
while a > 0 :
    a = H - A 
    count += 1
    if a <= 0 :
        break
    else :
        H = a
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections


n,h = map(int , raw_input().split(' '))

print (n + h-1)/h

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a=(int(x) for x in input().split())
count=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def ISI(): return map(int, sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b=input().split(' ')
b[0]=int(b[0])
b[1]=int(b[1])
k=1
m=0
while k==1:
    if b[0]<=0:
        k=k+1
    b[0]=b[0]-b[1]
    m=m+1
print(m-1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

import math

h,a = nm()

print(math.ceil(h/a))

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n, k = list(map(int,sys.stdin.readline().split()))
    ans = n//k
    if n%k != 0:
        ans += 1
    print(ans)


    return 0
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math 
import sys 
#t=int(sys.stdin.readline())
t=1
for _ in range(t):
    n,m=map(int,input().split())
    print(math.ceil(n/m))

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
n=0
while h>0:
    h-=a
    n+=1
    if h<=0:
        print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
n=0
while True:
    h-=a
    n+=1
    if h<=0:
        break
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import ceil
H, K = list(map(int, input().split()))
print(ceil(H/K))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A=map(int,input().split());q=H//A;mod=H%A;print(q+min(mod, 1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC153A

def f(h, a):
    ans = h // a
    if ans * a < h:
        ans += 1
    print(ans)

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

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
for i in range(H+1):
    if H <= A*i:
        print(i)
        break

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = list(map(int, input().split()))
print(h // a + min(h % a, 1))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = [int(_) for _ in input().split()]
print((h - 1) // a + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H / A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = (int(x) for x in input().split())
print(1 if H <= A else round(H // A) + int(H % A != 0) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import math
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    q, r, = divmod(H, A)

    ans = q
    ans += 1 if r > 0 else 0

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
H,A = map(int, input().split())
# N = int(input())
# s = int(input())
# C = int(input())
# s= input()
i=0
while H > 0:
    H  = H - A
    i += 1
print(i)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
n = 0
while True:
  h -= a
  n += 1
  if h <= 0:
    break
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import fileinput
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ABC_153_A():
    H,A = map(int, input().split())

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

if __name__ == '__main__':

    ABC_153_A()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
h, a = map(int,input().split())
print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H , A = (int(x) for x in input().split())
count = 0

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


print(count)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
if A//B == A/B:
    print(A//B)
else:
    print(A//B + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
h, a = list(map(int, input().split()))
ans = 1
while(True):
    if h <= a * ans:
        print(ans)
        break
    ans += 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri May  8 15:14:34 2020

@author: shinba
"""
h,a = map(int,input().split())

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

Submission status: Accepted

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

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

print(cnt)