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:
import collections
import math
import operator as op
from functools import reduce
import numpy as np
import math
import bisect
import heapq


MOD = 1000000007


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


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


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


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


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


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


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

    return


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc153/tasks/abc153_a
H, A = map(int, input().split())

print((H + A - 1) // 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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def solve(inp):
    import math
    (H, A) = map(int, inp.readline().strip().split(' '))

    r = math.ceil(H / A)
    return r


def main():
    import sys
    result = solve(sys.stdin)
    if result is not None and result != '':
        print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B = [int(n) for n in input().split()]
print(A//B + (1 if A%B != 0 else 0))

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 sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from fractions import gcd
e = enumerate

sys.setrecursionlimit(10**7)
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 if h%a!=0 else h//a)

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

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

Submission status: Accepted

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

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:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

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

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:
import sys
input=sys.stdin.readline
h,a=map(int,input().split())
ans=(h+a-1)//a
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:
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res

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

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())

def resolve():
    H, A = iim()

    a, b = divmod(H, A)
    if b: a += 1
    print(a)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys


# N, M = map(int, input().split())
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import deque
input = sys.stdin.readline
H , A = map(int,input().split())
for i in range(1, 10**9):
    H -= A
    if H <= 0:
        print(i)
        break

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:
#N = int(input())
H,A = list(map(int,input().split()))
#A = [int(input()) for i in range(M)]
print((H+A-1)//A)

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


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


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = {False: 'No', True: 'Yes'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    A, B = MI()
    print(int(math.ceil(A / B)))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import queue
import copy
import math
from collections import deque

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

d, m = divmod(h, a)

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

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	H, A = getlist()
	if H % A == 0:
		print(int(H // A))
	else:
		print(int(H // A) + 1)
	


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

Solution code:
#A問題
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-1)//A

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(cut)

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def ifn(): return float(input()) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def fmn(): return map(float, input().split()) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD

H,A = imn()

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# import sys ; sys.exit() # プログラム終了
# from copy import deepcopy ; b=deepcopy(a)
# chr(ord('a') + 1)
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#

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


def ceil(a, b):
    return -(-a // b)


print(ceil(a, b))

Submission status: Accepted

Solution code:
#list(map(int, input().split()))
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:

#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


def main():
    h,a = mi()
    print(ceil(h/a))

        



main()

Submission status: Accepted

Solution code:
import math
H, A = [int(i) for i in input().split()]
print(math.ceil(H/A))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

print(-(-H//A))

Submission status: Accepted

Solution code:
#coding:utf-8
h, a = map(int, input().split())

print(-(-h//a))

Submission status: Accepted

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

ans = math.ceil(H/A)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import ceil

def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())

h,a = get_ints()
print(int(ceil(h/a)))

Submission status: Accepted

Solution code:
h,a=[int(j) for j in input().split()]
import math
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:
def main():

    H, A = map(int, input().split())
    if H % A == 0:
        return H // A
    return H // A + 1

if __name__ == '__main__':
    print(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())

ans = -(-H // A)

print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)

import math

import logging

logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)


def resolve():
    # S = [x for x in sys.stdin.readline().split()][0]  # 文字列 一つ
    # N = [int(x) for x in sys.stdin.readline().split()][0]  # int 一つ
    H, A = [int(x) for x in sys.stdin.readline().split()]  # 複数int
    # grid = [list(sys.stdin.readline().split()[0]) for _ in range(N)]  # 文字列grid
    # grid = [[int(x) for x in sys.stdin.readline().split()]
    #         for _ in range(N)]  # int grid

    logger.debug('{}'.format([]))

    print(math.ceil(H / A))


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """10 4"""
        output = """3"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1 10000"""
        output = """1"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """10000 1"""
        output = """10000"""
        self.assertIO(input, 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())
print(((h-1)//a)+1)

Submission status: Accepted

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

count = h // a + bool(h % a)
print(count)

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
ans = -(-h//a)
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:
def examA():
    H,A = LI()
    ans = (H-1)//A+1
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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 sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

print(math.ceil(H/A))

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

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

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

Submission status: Accepted

Solution code:
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# s = input()

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

Submission status: Accepted

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



print(ceil(H / A))

Submission status: Accepted

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

print(-(-H // A))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

H,A = list(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-1)//a)

Submission status: Accepted

Solution code:
from sys import stdin
import math
a,b = [int(x) for x in stdin.readline().rstrip().split()]
print(math.ceil(a/b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, a = [int(i) for i in 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 if h % a else h // a)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def div_ceil(x, y): return (x + y - 1) // y

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math
h,a=map(int,input().split())
print(math.ceil(h/a))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin

mod = 1000000007
inf = 1 << 60
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()

h, a = na()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    H, A = MAP()
    print(ceil(H/A))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    r = stdin.readline()[:-1]
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #n = int(r)
    #a = r.split()
    #a,b,c = r.split()
    #a = list(map(int, r.split()))
    a,b = map(int, r.split())
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]
    #res = 0
    
    print(-(-a//b))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

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 sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

print(-(-H//A))

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
from math import ceil

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
mod=10**9+7

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

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())
ans = (H + a - 1) // a
print(ans)

Submission status: Accepted

Solution code:
import os,sys
from io import BytesIO, IOBase

def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

mod=1000000007

import math  

for i in range(1):
    n,m=mi()
    print(math.ceil(n/m))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
h,a=map(int,input().split())

print(-(-h//a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(H: int, A: int):
    print(-(-H//A))
    return


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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

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

def ceil(a, b):
   return a // b + (a % b > 0)

print(ceil(h,a))

Submission status: Accepted

Solution code:
h, a = [int(i) for i in 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
ans = math.ceil(H/A)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    H, A = [int(x) for x in input().split()]
    print(-(-H // A))
    



if __name__ == '__main__':
    main()

Submission status: Accepted

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

print((b+c-1) // c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC153a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

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

    from math import ceil

    print(ceil(h/a))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

main()

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 python

from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = map(int, raw_input().split())
print A / B + (A % B != 0)