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:
#!/usr/bin/env python3

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

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

if N % K == 0:
  print(int(N / K))
else:
  print(int(N / K) + 1)

Submission status: Accepted

Solution code:
import sys

def propare():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))
    A = int(next(tokens))

    solve(H, A)

def solve(H: int, A: int):
    count = 0
    while 0 < H:
        count = count + 1
        H = H - A

    print(count)

    return


 
if __name__ == "__main__":
    propare()

Submission status: Accepted

Solution code:
import math
def resolve():
    import sys
    input = sys.stdin.readline
    
    H, A = map(int, input().split())

    print(math.ceil(H / A))
    

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print  ( math.ceil(a/b)  )

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

Submission status: Accepted

Solution code:
import math
h, a  = [ int(v) for v in 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:
from math import ceil

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

print(ceil(a/b))

Submission status: Accepted

Solution code:
ha = [int(s) for s in input().split()]
h, a = ha[0], ha[1]
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())

attacks = H // A

if H % A > 0:
    attacks+=1
    
print (attacks)

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

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

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

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:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

h,a = LI()
print(math.ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
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 = tuple(map(int,input().rstrip().split()))
print((h+a-1)//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-1)//A + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

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

Submission status: Accepted

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

i = 0

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
print(-(-N//M))

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c=0

while True:
  c=c+1
  a=a-b
  if a<=0 :
    break
print(c)

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

count = 0;

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

use_clipboard=True
bbn=1000000007
	
#+++++

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

def pa(v):
	if isTest:
		print(v)
		
class input_clipboard:
	def __init__(self,s):
		self.input_l=s.splitlines()
		self.ii=0
		
	def input(self):
		ret = self.input_l[self.ii]
		self.ii+=1
		return ret

if __name__ == "__main__":
	if sys.platform =='ios':
		if use_clipboard:
			import clipboard
			input_text=clipboard.get()
			ic=input_clipboard(input_text)
			input = lambda : ic.input()
		else:
			sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

H = A[0]
A = A[1]

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

print(count)

Submission status: Accepted

Solution code:
class Main:
    s = list(map(int, input().split()))
    h = s[0]
    a = s[1]
    cnt = 0
    if h >= a:
        while h > 0:
            h -= a
            cnt += 1

    else:
        cnt = 1
    print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = list(map(int, input().split()))
print('{}'.format(-(-a//b)))

Submission status: Accepted

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

import math
Ans = math.ceil(H / A)

print(Ans)

Submission status: Accepted

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

n = (int(H)/int(A)) +(int(H)%int(A)>0)

print(int(n))

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(a / b))

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#標準入力
s = [int(x) for x in input().split()]

hp = s[0]
attack = s[1]


#割り算で攻撃回数を取得
acount = hp // attack

#余りが出た場合は攻撃回数+1回
if hp % attack == 0:
    print(acount)
else:
    print(acount + 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())

q,mod= divmod(H,A)

if mod > 0:
  q += 1
  
print(int(q))

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

Submission status: Accepted

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

cut = 0

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

print(cut)

Submission status: Accepted

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

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

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 = 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())
ans=divmod(h,a)
if ans[1]==0:
  print(ans[0])
else:
  print(ans[0]+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
ip = raw_input().split()
res = float(ip[0])/float(ip[1])
print(int(math.ceil(res)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A =map(int, input().split())  #「A B」みたいなスペース空いた入力のとき

ans = 0
dmg = 0
while dmg < H:
    ans += 1
    dmg += A

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 0

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

print(i)

Submission status: Accepted

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

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

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:
A,B = map(int,input().split())
C = 0
while A > 0:
  A = A-B
  C += 1
print(C)

Submission status: Accepted

Solution code:
i = input()
a,b = map(int, i.split())
cnt = 1

while(a>b) :
    a -= b
    cnt +=1


print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

def get_num_attacks(H, A):
  print(ceil(H/A))

if __name__ == "__main__":
  H, A = map(int, input().split())
  get_num_attacks(H, A)

Submission status: Accepted

Solution code:
import math
data=input().split()
hp = int(data[0])
atk= int(data[1])

kai = math.ceil(hp/atk)
print(kai)

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:
list = input().split(' ')
num = 0
a = int(list[0])
b = int(list[1])
while a > 0:
  a -= b
  num += 1
  
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
a = input()
a = a.split(" ")
i = 0
while 1:
  if int(a[0]) <= 0:
    break
  else:
    i = i+1
    a[0]=int(a[0])-int(a[1])
    
print(i)

Submission status: Accepted

Solution code:
n, m = [int(x) for x in input().split()]
k = 0
if m>n:
    print(1)
else:
    while n > 0:
        n = n - m
        k += 1
    print(k)

Submission status: Accepted

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

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

print(cnt)

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

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

# Input
s = [input() for i in range(1)]
S = (list(s[0].split()))

# Proccess
x = math.ceil(int(S[0])/int(S[1]))

# Output							
print(x)

Submission status: Accepted

Solution code:
in_len = input().split(" ")
in_h = int(in_len[0])
in_a = int(in_len[1])

out_c = 0

while True:
  out_c += 1
  if(in_h - in_a <= 0):
    print(out_c)
    break
  else:
    in_h -= in_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-1)//a)

Submission status: Accepted

Solution code:
s = input().split()  # s[0] は相手の体力, s[1]は攻撃力
de = int(s[0])
count = 0

while de > 0:
    de = int(de) - int(s[1])
    # print(de)
    count += 1

print(count)

Submission status: Accepted

Solution code:
n,a=map(int,input().split())
x=n//a
if x*a==n:
  print(x)
else:
  print(x+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
HA=input().split()
H = int(HA[0])
A = int(HA[1])

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

print(result)

Submission status: Accepted

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

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

print(N)

Submission status: Accepted

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

tenpH = H
for n in range(10000):
    tenpH = tenpH - A

    if(tenpH <= 0):
        print(int(n+1))
        break

Submission status: Accepted

Solution code:
import math
input = input().split(" ")
h =  input[0]
a = input[1]
answer = math.ceil(int(h) / int(a))
print(answer)

Submission status: Accepted

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

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

div, mod = divmod(H, A)

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

Submission status: Accepted

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

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

if H == 0:
  print(N)
else: 
  print(N + 1)

Submission status: Accepted

Solution code:
_input = input().split()

h = int(_input[0])
a = int(_input[1])

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

Submission status: Accepted

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

n = math.ceil(h/a)
print(str(n))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

# 整数の入力
#a = int(input())
# スペース区切りの整数の入力
b, c = map(int, input().split())
# 文字列の入力
#s = input()
# 出力
num = b / c

print(math.ceil(num))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
i=0
k=0
while k<a:
  i+=1
  k+=b
print(i)

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

Submission status: Accepted

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

Submission status: Accepted

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

t = 0

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

print(t)

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
H, A = [int(x) for x in 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 = h - a
    count += 1

print(count)

Submission status: Accepted

Solution code:
firstinput = input("")
firstinputsplit = firstinput.split(" ")
H = int(firstinputsplit[0])
N = int(firstinputsplit[1])
kill = 0
if H <= 10000 and N <= 10000:
    while H > 0:
        H = H - N
        kill = kill + 1
    print(kill)
else:
    print(H)

Submission status: Accepted

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

Submission status: Accepted

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

count=0

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

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

ans = (H/A)//1

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

print(int(ans))

Submission status: Accepted

Solution code:
# ABC 153 A

import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

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:
#!/usr/bin/env python3

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

Submission status: Accepted

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

result=0

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

print(result)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
HP_damage = list(map(int,input().split()))
count = 0
while HP_damage[0] > 0:
    HP_damage[0] -= HP_damage[1]
    count += 1
print(count)

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

Solution code:
hs= input().split()
h = int(hs[0])
s = int(hs[1])
if(h % s == 0):
  print(int(h/s))
else:
  result = int(h/s + 1)
  print(result)

Submission status: Accepted

Solution code:
h, a = tuple(map(int, input().split(' ')))
d = h//a
if d*a == h:
    print(d)
else:
    print(d+1)

Submission status: Accepted

Solution code:
input_list = list(map(int, input().split()))
hp = input_list[0]
atk = input_list[1]
if hp % atk == 0:
  times = int(hp / atk)
else:
  times = int(hp / atk) + 1
print(times)

Submission status: Accepted

Solution code:
prm = input().split()
hp = int(prm[0])
atk = int(prm[1])
numatk = 0

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

print(numatk)

Submission status: Accepted

Solution code:
import os
import sys

def main():
    H , A = map(int , input().split())
    B = H % A
    if B == 0 :
        print (str(H//A))
    else :
        print (str(H//A + 1))
    #print (str(X))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))
if i[0] % i[1] != 0:
    r = i[0] // i[1] + 1
    print(r)
else:
    r = i[0] / i[1]
    print(int(r))

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:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

SUB = int(math.ceil(H / A))

print(SUB)

Submission status: Accepted

Solution code:
# Enter your code here. Read input from STDIN. Print output to STDOUT

import numpy as np
from sys import stdin


def get_result(data):
    remainder = data[0] % data[1]
    quotient = data[0] // data[1]
    return quotient if remainder == 0 else quotient + 1

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)

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())
count=0
while True:
  h = h-a
  count+=1
  if h<=0:
    break
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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 = input().split()
H = int(H)
A = int(A)
kill = H/A
if kill.is_integer():
    kill = int(kill)
    print(kill)
else:
    kill1 = kill + 0.5
    x = round(kill1)
    print(x)

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 = 0, 0
while (H < 1 or H > 10000) and (A < 1 or A > 10000):
  H, A = input().split()
  H, A = int(H), int(A)

ans = math.ceil(H / A)
print(ans)

Submission status: Accepted

Solution code:
import math
H, A = input().split()
H = int(H)
A = int(A)
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 - 1) // A)

Submission status: Accepted

Solution code:
a = []
a = input().split()
H = int(a[0])
A = int(a[1])

hit = H // A
#print('hit=', hit)

nokori = H % A
#print('nokori=', nokori)

if nokori > 0:
  print(hit + 1)
if nokori == 0:
  print(hit)

#print('H=', H, 'A=', A)

Submission status: Accepted

Solution code:

def main():
    H, A = map(int, input().split())
    count = 0
    while True:
        H -= A
        count += 1
        if H <= 0:
            break

    print(count)





if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
b = input()
l = b.split()
h = int(l[0])
a = int(l[1])
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):
    print((H//A)+1)
else:
    print(H//A)

Submission status: Accepted

Solution code:
def run():
  H, A = map(int, input().split())
  ans = -(-H//A)
  print(ans)
  
if __name__ == '__main__':
  run()

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:
x, y = list(map(int, input().strip().split(' ')))
if(x%y>0):
  print(x//y+1)
else:
  print(x//y)

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())
n=h/a
n1=math.ceil(n)
ans=int(n1)
print(ans)

Submission status: Accepted

Solution code:
s = input().split()
h, a = int(s[0]), int(s[1])

ans = float(h)/float(a)

print(int(ans+0.999999999))

Submission status: Accepted

Solution code:
import sys
import math
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

Submission status: Accepted

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

x = h/a

if x%1 == 0:
	print(int(x))
else:
	print(int(x)+1)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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