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:
# coding=utf-8
# Date: 2020-01-08
# Author: lee215

get = lambda: int(raw_input().strip())
getl = lambda: raw_input().strip()
gets = lambda: map(int, raw_input().strip().split())
getss = lambda n: [gets() for _ in xrange(n)]


# fi = open('sample1.in', 'r')
# raw_input = fi.readline

H, A = gets()
if A == 1:
    print H
else:
    print(H + A - 1) / 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:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy


def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
def main():
    h,a=map(int,input().split())
    print(-(-h//a))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve(h, a):
    if h % a == 0:
        return h // a
    else:
        return h // a + 1


def main():
    h, a = map(int, input().split())
    res = solve(h, a)
    print(res)
    # for r in res:
    #     print(r)


def test():
    assert solve(10, 4) == 3
    assert solve(1, 10000) == 1
    assert solve(10000, 1) == 10000


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(10, 4), 3)

    def test_2(self):
        self.assertEqual(think(1, 10000), 1)

    def test_3(self):
        self.assertEqual(think(10000, 1), 10000)


def solve():
    h, a = read()
    result = think(h, a)
    write(result)


def read():
    return read_int(2)


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(h, a):
    if h % a == 0:
        return h // a
    return h // a + 1


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
H, A = map(int,input().split()) # 複数の数字を変数に格納

HP = H
hit = 0

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

Submission status: Accepted

Solution code:
#!/bin/bash
''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/g.inp"
exit $?
'''
import sys
import math

def _ia(): return [ int(x) for x in sys.stdin.readline().strip().split() ]

h, a = _ia()
print(math.ceil(h/float(a)))

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

ans = a[0] // a[1]
wari = a[0] % a[1]

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

Submission status: Accepted

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

div = H//A

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
 
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 
 
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 H%A == 0:
    print(H//A)
else:
    print(H//A + 1)

Submission status: Accepted

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

print(-(-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 sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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 fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(math.ceil(h/a))

Submission status: Accepted

Solution code:
x = input().split()
h = int(x[0])
a = int(x[1])
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(" "))

out = int(math.ceil(h/a))

print(out)

Submission status: Accepted

Solution code:
from sys import stdin
#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
h,a = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに

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

Submission status: Accepted

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

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

ans = 0
while True:
    ans += 1
    h -= a
    if h <= 0:
        break

print(ans)

Submission status: Accepted

Solution code:
#A
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())

import numpy as np
print(int(np.ceil(h/a)))

Submission status: Accepted

Solution code:
(n, k),  = [list(map(int, s.split())) for s in open(0)]
if n % k != 0:
    print(n // k + 1)
else:
    print(n // k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
H, A = [int(x) for x in input().split()]
cnt = 0
while True:
    H -= A
    cnt += 1
    if H <= 0:
        print(cnt)
        sys.exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
H,A=map(int,input().split())
t=H//A
if H%A != 0:
    t+=1
print(t)

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

Submission status: Accepted

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

print(math.ceil(a/b))

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N = input().split()
N = [int(i) for i in N]
#print(N)
print(int(math.ceil(N[0]/N[1])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(h // a + min(h % a, 1))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

import math

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

Submission status: Accepted

Solution code:
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

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

Q = H//A
R = H%A

if R == 0:
    print(Q)
else:
    print(Q+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def InputToInt():
    A = input().split()
    for i in range(len(A)):
        A[i] = int(A[i])
    return A
    
if __name__ == '__main__':
    H, A = InputToInt()
    print((H-1)//A+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:

def resolve():
    H,A=(int(i) for i in input().split())
    if H%A==0:
        print(H//A)
    else:
        print(H//A+1)

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
ha = input().split()
print(math.ceil(int(ha[0])/int(ha[1])))

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    b, c = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
H, A = map(int, input().split(' '))
import math
print(int(math.ceil(H/A)))

Submission status: Accepted

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

while True:
  if a*i < h:
    i += 1
  else:
    break

print(i)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

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

if __name__ == "__main__":
    main()

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:
# Keyence 2020 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

h,a=nm()
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:
h, a = map(int, input().split())
cnt = 0
while h > 0:
    h -= a
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
def main():
    h,a=map(int,input().split())
    print(h//a+bool(h%a))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
ans=0
while True:
    ans+=1
    h-=a
    if h<=0:
        break
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 = map(int, input().split())
ans = math.ceil(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:
A,B=map(int,input().split())
P=A//B
if A%B==0:
  print(A//B)
else:
  print(A//B+1)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import decimal
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

class Library():
    @staticmethod
    def Swap(a,b):
        return [b,a]

    @staticmethod
    def myRound(a,dig=0): # 四捨五入
        p = 10 ** dig
        return (a * p * 2 + 1) // 2 / p

    @staticmethod
    def Roundup(a,dig=0): # 切り上げ
        if a < 0:
            return int(a)
        else:
            return int(a + 0.9)

    @staticmethod
    def Gcd(a,b): #最大公約数
        if (a<b):
            a,b = Library.Swap(a,b)
        if (b==0):
            return a
        else:
            return Library.Gcd(b,a%b)

    @staticmethod
    def Lcm(a,b): #最小公倍数
        return a//Library.Gcd(a,b)*b

    @staticmethod
    def Divisors(a): # 約数列挙
        divisors = []
        for i in range(1,int(a**0.5)+1):
            if a%i==0:
                divisors.append(i)
                if i!=a//i:
                    divisors.append(a//i)
        divisors.sort()
        return divisors

class Prime():
    # コンストラクタ
    # エラストテネスの篩
    def __init__(self,num):
        self.num = num
        self.sieve = [0] * (self.num + 1)
        self.sieve[0] = -1
        self.sieve[1] = -1
        for i in range(2,self.num + 1):
            if not self.sieve[i]:
                self.sieve[i] = i
                for j in range(i * i,self.num + 1,i):
                    if self.sieve[j]:
                        self.sieve[j] = i
    
    # 素数判定
    def isPrime(self,num = None):
        if num is None:
            num = self.num
        if self.sieve[num] == num:
            return True
        else:
            return False
    
    # 素数列挙
    def PrimeNum(self,num = None):
        if num is None:
            num = self.num
        prime = []
        for i in range(2,num):
            if self.sieve[i] == i:
                prime.append(i)
        return prime
    
    # 素因数分解
    def PrimeFact(self,num = None):
        if num is None:
            num = self.num
        fact = []
        while self.sieve[num] != num:
            fact.append(self.sieve[num])
            num //= self.sieve[num]
        fact.append(num)
        return fact

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

out = math.ceil(H / A)

print(out)

Submission status: Accepted

Solution code:
from sys import stdin
#from collections import deque
from math import ceil


def ii(): return int(stdin.readline())


def fi(): return float(stdin.readline())


def mi(): return map(int, stdin.readline().split())


def fmi(): return map(float, stdin.readline().split())


def li(): return list(mi())


def lsi():
    x=list(stdin.readline())
    x.pop()
    return x


def si(): return stdin.readline()


def sieve(x):
    a=[True]*(x+1)
    sq=floor(sqrt(x))
    for i in range(3, sq+1, 2):
        if a[i]:
            for j in range(i*i, x+1, i):
                a[j]=False
    if x>1:
        p=[2]
    else:
        p=[]
    for i in range(3, x+1, 2):
        if a[i]:
            p.append(i)
    return p
#vowel={'a', 'e', 'i', 'o', 'u', 'y', 'A', 'E', 'I', 'O', 'U', 'Y'}
#pow=[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944, 549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832, 70368744177664, 140737488355328, 281474976710656, 562949953421312, 1125899906842624, 2251799813685248, 4503599627370496, 9007199254740992, 18014398509481984, 36028797018963968, 72057594037927936, 144115188075855872, 288230376151711744, 576460752303423488, 1152921504606846976, 2305843009213693952, 4611686018427387904, 9223372036854775808]
############# CODE STARTS HERE #############
n, m=mi()
print(ceil(n/m))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

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

h, a = list(map(int, input().split()))
c = h // a if h % a == 0 else h // a + 1

ans = c
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
H, A = [int(n) for n in input().split(' ')]

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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#n = int(input())
#s = input()
a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
# import itertools
# import math


def solve(H, A):
    ans = H // A
    if H % A != 0:
        ans += 1
    return ans


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

# P = []
# S = []
# for i in range(N):
#     pp, ss  = map(int, input().split())
#     P.append(pp)
#     S.append(ss)

print(solve(H, A))

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

print(-(-H // A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import math

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    H, A = map(int, input().split())
    ans = (H + A - 1) // A
    print(ans)


main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

H, A = [int(x) for x in stdin.readline().rstrip().split()]

print(math.ceil(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(int(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(count)