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:
# ceil関数(2引数)
def ceilT(a,b): #ceil(a/b)
    return (a+b-1)//b
H,A=map(int,input().split())
print(ceilT(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())

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

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:
x = input()
hp = int(x.split()[0])
attack = int(x.split()[1])
count = 1

while (hp - attack) > 0:
    count = count + 1
    hp = hp - attack
   
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, n = (int(i) for i in input().split())
count = 0
while h > 0:
    count += 1
    h = h - n
print(count)

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

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 sys


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
H, A = list(map(int,readline().split()))
if H % A == 0:
  print(int(H/A))
else:
  print(H // A + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

H, A = lr()
answer = -(-H//A)
print(answer)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import os

def main():
	hitpoint, attack_point = map(int, input().split())

	if hitpoint %  attack_point == 0:
		print(hitpoint // attack_point)
	else:
		print((hitpoint // attack_point) + 1)

if __name__ == '__main__':
	main()

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())
num = 0
while H >0:
  num += 1
  H -= A
print(num)

Submission status: Accepted

Solution code:
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))


H,A=input2()
num=H//A
if H%A>0:
	num+=1
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

h, a = [int(s) for s in input().split()]

ans = ceil(h / a)
print(ans)

Submission status: Accepted

Solution code:
#--Serval vs Monster
hp, attack = map(int, input().split(" "))

num = 0
while hp > 0:
  num = num + 1
  hp = hp - attack

print(num)

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

Submission status: Accepted

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

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

import math
n = math.ceil(h/a)

print(n)

Submission status: Accepted

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

n = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A=map(int,input().split())
if H%A==0:
    print(H//A)
if H%A!=0:
    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:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(round(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import math
def print_ans(H, A):
    """Test Case
    >>> print_ans(10, 4)
    3
    >>> print_ans(1, 10000)
    1
    >>> print_ans(10000, 1)
    10000
    """
    print(math.ceil(H / A))


if __name__ == '__main__':
    H, A = map(int, input().rstrip().split())
    print_ans(H, A)

Submission status: Accepted

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

count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A=map(int, 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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

inputted = list(map(int, input().split()))

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

answer = math.ceil(H / A)

print(answer)

Submission status: Accepted

Solution code:
# 0405の分もやる

# ABC153-C
if False:
    N,K=map(int,input().split())
    H=[int(i) for i in input().split()]
    H.sort(reverse=True)
    print(sum(H[K:]))

# ABC153-D
if False:
    H=int(input())
    cnt=1
    ans=0
    while H>1:
        ans+=cnt
        H//=2
        cnt*=2
    print(ans+cnt)

# ABC153-A
if True:
    # ceil関数
    def ceil(a,b): #ceil(a/b)
        return (a+b-1)//b

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

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(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 = 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, raw_input().split())
x = 0
for i in range(H):
    if H - A > 0:
        x += 1
        H = H - A
print x + 1

Submission status: Accepted

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

Submission status: Accepted

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

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:
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
H,A = inputlist()
d = H //A
m = H % A
if m != 0:
    d +=1
print(d)

Submission status: Accepted

Solution code:
from math import ceil
n, a = map(int, input().split())
print(ceil(n/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:
#A
HA = input().split(' ')
H = int(HA[0])
A = int(HA[1])
for s in range(H + 1):
    if s * A >= H and (s - 1) * A < H:
        print(s)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

H, A = [int(x) for x in stdin.readline().rstrip().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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def q1():
    """A - Serval vs Monster"""
    H,A = (int(i) for i in input().split())
    d,m = divmod(H,A)
    ans = d
    if m > 0:
        ans += 1
    print(ans)

if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
h,a=map(int,raw_input().split())
if h> a and h%a==0:
  print h/a
elif h>a and h%a!=0:
  print (h/a) +1
elif h <= a:
  print "1"

Submission status: Accepted

Solution code:
# ABC 153: A – Serval vs Monster
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
(h, a) = n.split()
for i in range(10001):
    if int(h) <= int(a) * i:
        print(int(i))
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = list(map(int, 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())
answer = H // A + 1
if H % A == 0:
	answer -= 1
print(answer)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


def solve(H: int, A: int):
    print(math.ceil(H/A))
    return


# Generated by 1.1.6 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:
#Serval vs Monster
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())

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

print(-(-a//b))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
x=0
for i in range(a):
    if 0<a-b:
        a-=b
        x+=1
    else:
        x+=1
        print(x)
        break

Submission status: Accepted

Solution code:
import sys

h, a = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
B = 0
while H - A > 0:
    H = H - A
    B += 1
B += 1
print(B)

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(h//a+f)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
readline = input().split()
hp = int(readline[0])
attack = int(readline[1])
ans = 0

if (hp < attack):
    print (1)
elif (hp%attack == 0):
    print (hp//attack)
else:
    print (hp//attack + 1)

Submission status: Accepted

Solution code:
import sys

x = sys.stdin.readline()
x = x.split(' ')
(h,a)=[int(str) for str in x]


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

sys.stdout.flush()

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
tmp = list(input().split())
H=int(tmp[0])
N=int(tmp[1])
x=H // N
print (x+1 if (H % N) else x)

Submission status: Accepted

Solution code:
tmp = list(input().split())
H = int(tmp[0])
N = int(tmp[1])
q = H // N
print (q + 1 if (H % N) else q)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# 初期入力
H,A = (int(x) for x in input().split(" "))

# 
kaisu = 0
import math
if H <= A:
    kaisu = 1
else:
    kaisu = math.ceil( H/A )
print(kaisu)

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(int(math.ceil(H / A)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = [int(x) for x in input().split()]

import math

print(math.ceil(x[0]/x[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:
# coding: utf-8
# Your code here!

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(int(math.ceil(h / a)))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(-(-(h)//a))

Submission status: Accepted

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College
    Date:23/03/2020
'''


from math import ceil
def main():
    
    
    
    n,m=map(int,input().split())
    print(ceil(n/m))
        
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ =="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
if 1 <= h <= 10000 and 1 <= a <= 10000:
    d = h // a
    if d * a < h:
        d += 1
    print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
ha=input().rstrip().split(" ")
h=int(ha[0])
a=int(ha[1])
i=0
hp=h
while hp>0:
    hp=hp-a
    i=i+1
print(i)

Submission status: Accepted

Solution code:
health,attack = map(int,input().split())
if health % attack == 0 :
    print  ( health // attack ) 
else  :
    print  ( health // attack + 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())
 
i = 1
while (A*i < H):
    i = i+1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

lis = set({a,b})
count = 0
while a>0:
    a-=b
    count=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 = map(int, input().split())
B = H % A
if B == 0:
  print(H // A)
elif H < A:
  print(1)
else:
  print(H // A + 1)

Submission status: Accepted

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

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

div = h // a

if h % a != 0:
  div += 1

print(div)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

print(ans)

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = [int(elem) for elem in 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())
 
answer = 0
if H %A != 0:
  answer = H//A + 1
else:
  answer = H / A
  
print(int(answer))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(num)

Submission status: Accepted

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