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

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
x = 0
while h > 0:
  h -= a
  x += 1

else:
  print(x)

Submission status: Accepted

Solution code:
a,b=(int(x) for x in 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:
N,M = map(int,input().split())
ans = 0
while N > 0:
    N = N-M
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    h, a = LI()
    print((h - 1) // a + 1)
    return


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

Submission status: Accepted

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

H = int(H)
A = int(A)

if H / A < 1:
    print(1)
else:
    print(math.ceil(H / A))

Submission status: Accepted

Solution code:
N,K = [int(x) for x in input().split()]
print((N+K-1)//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:

H, A= map(int, input().split())
if H >= A:
    print(-(-int(H)//int(A)))
else:
    print(1)

Submission status: Accepted

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

n = int(h / a)

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

Submission status: Accepted

Solution code:
import math
H,A=(float(x) for x in input().split())
print(math.ceil(H/A))

Submission status: Accepted

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

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H > 0:
        H -= A
        cnt += 1
    return cnt

print(attack(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import fractions
input = sys.stdin.readline
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())
c=a%b
if c==0:
  print(a//b)
else:
  print(a//b+1)

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

Submission status: Accepted

Solution code:
import math

h, a = map(int, input().split(' '))
if a >= h:
  print(1)
else:
  print(math.ceil(h/a))

Submission status: Accepted

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

num = 0
while(1):
    num += 1
    h -= a
    if h <= 0:
        print(num)
        break

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

q, r = divmod(H, A)

if r == 0:
    print(q)
else :
    print(q + 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().rstrip().split())
print(int((H - 0.0001)//A + 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
t = 0

if H <= A:
    # print(str(t) + 'の攻撃で、〇〇は倒れた')
    print(1)
else:
    while H > 0:
        H -= A
        t += 1
        # print('◆◆の攻撃' + str(A) + 'のダメージ' + '、〇〇の残り体力' + str(H))
    else:
        # print(str(t) + '回の攻撃で、〇〇は倒れた')
        print(t)

Submission status: Accepted

Solution code:
import math
def resolve_A():
    H, A = map(int, input().split())
    if H % A != 0:
        print(math.ceil(H / A))
    else:
        print(int(H / A))
resolve_A()

Submission status: Accepted

Solution code:
h, a = map(int,input().split())
cn = 0
for _ in range(h):
    h -= a
    cn += 1
    if h <= 0:
        break
print(cn)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = raw_input().split()
H = int(inp[0])
A = int(inp[1])

def attack_count():
	count = H // A
	if H % A != 0:
		count += 1
	return count

ans = attack_count()
print(ans)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
div, mod = divmod(h, a)
print(div + bool(mod))

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from copy import deepcopy
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = float('INF')
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


h, a = LI()
print(h // a + bool(h % a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c=0
while 1:
  a-=b
  c+=1
  if a<=0:
    break
  else:
    pass
print(c)

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())
cnt=0
while(h>0):
  h=h-a
  cnt+=1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 1

while i*A<H:
	i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

v, q = divmod(a, b)
if v == 0:
    print(1)
else:
    if q == 0:
        print(v)
    else:
        print(v+1)

Submission status: Accepted

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

a = t.pop()
h = t.pop()

tm = h % a
tt = h // a

if tm > 0:
    tt = tt + 1

print(tt)

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

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

Submission status: Accepted

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

### TESTCASE
test = ""
#test = \
"""
10 4
ans 3
"""

"""
10000 1
"""
############
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
####### MAIN


def roundup(n, d):
    if n % d:
        return n // d + 1
    else:
        return n // d


h, a = map(int, input2().split())
    
print(roundup(h, a))

Submission status: Accepted

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

attack = H - A
count = 1

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

Submission status: Accepted

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

print(i)

Submission status: Accepted

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

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:
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np
#from functools import reduce
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

H,A=acinput()

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

Submission status: Accepted

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

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:
h,a = map(int,input().split())
for i in range(10010):
    if h <= a*i:
        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:
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())
ans = H // A + 1
if H % A == 0: ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A = map(int,input().split())
sum = 0
number = 0
while sum < H:
  sum = sum + A
  number = number + 1
print(number)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputnum = input().split(" ")

hnum = int(inputnum[0])
anum = int(inputnum[1])
result = hnum // anum
if hnum % anum != 0:
    result= result+1

print(result)

Submission status: Accepted

Solution code:
def LI():
  return [int(s) for s in input().split()]

H,A = LI()

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

Submission status: Accepted

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,a=input().split()
ss=int(s)
aa=int(a)
c=0 
while ss>0:
    c=c+1
    ss=ss-aa
print(c)

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:
import math

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

Submission status: Accepted

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

num = h//a

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

Submission status: Accepted

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

a = H // A

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

Submission status: Accepted

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

times = int(H) / int(A)
times = int(round(times))

if(times * A) < H:
  times = times + 1
  print(times)
else:
  print(times)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(attack_cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
buf = input().split(" ")
H=int(buf[0])
A=int(buf[1])
count=0
state=H
while(1):
  if state <= 0:
    break
  state=state-A
  count=count+1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num_list = [int(i) for i in (input().split())]
if num_list[0] <= num_list[1]:
    print(1)
elif num_list[0] % num_list[1] == 0:
    print(int(num_list[0] / num_list[1]))
else:
    print(int(num_list[0]/num_list[1]) +1)

Submission status: Accepted

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

while(attack):
    H = H - A
    count = count + 1
    if H <= 0:
        attack = False

print(count)

Submission status: Accepted

Solution code:
from bisect import bisect_right, bisect_left
from itertools import groupby, permutations, combinations
from fractions import gcd
import numpy as np
from sys import stdin, stderr


def lcm(x, y):
    return (x * y) // gcd(x, y)


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


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

Submission status: Accepted

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

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

print (i)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
(H, A) = list(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(int(H/A)+1)
else:
  print(int(H/A))

Submission status: Accepted

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

print(-(-H // A))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(q))

Submission status: Accepted

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
from sys import stdin
import math


def main(inp):
    h, a = [int(i) for i in inp.split(sep=' ')]
    ret = math.ceil(h / a)
    return ret


if __name__ == '__main__':
    input_line = stdin.readline().rstrip()
    ret = main(input_line)
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
import math

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read

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

Submission status: Accepted

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

Submission status: Accepted

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


rep = int(h/a)

if rep*a < h:
  rep = rep +1

print(rep)

Submission status: Accepted

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

n = H//A
r = H%A

if r == 0:
    print(n)
else:
    print(n + 1)

Submission status: Accepted

Solution code:
def resolve():
    H, A = map(int, input().split())
    tmp = H
    count = 0
    while True:
        tmp -=A
        count +=1
        if tmp <=0:
            print(count)
            exit()



if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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


def solve(H: int, A: int):
    print(-(-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:
import math

H,A = (float(x) for x in input().split())
print(math.ceil(H/A))

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 = [int(x) for x in input().split()]
hits = 0
while H > 0:
    H -= A
    hits += 1
print(hits)

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def main():
    tmp = input().split()
    h = int(tmp[0].replace('\n',''))
    a = int(tmp[1].replace('\n',''))
    n= h/a
    if (h%a >0):
        n+=1
    print(int(n))

if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
b=0
for i in range(10001):
    if b>=H:
        print(i)
        break
    else:
        b=b+A

Submission status: Accepted

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

for i in range(1, 10001):
    h -= a
    if h <= 0:
        n = i
        break

print(i)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
q = a // b
rem = a % b

if rem == 0:
    print(q)
else:
    print(q + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import math
h,a = map(int, input().split())
x = math.ceil(h / a)
print("{}".format(x))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
H = input()
arr = [int(i) for i in H.split(' ')]
count = 1
if(arr[0]<arr[1]):
	print(count)
else:
	while arr[0]>arr[1]:
		arr[0] = arr[0] - arr[1]
		count = count + 1
	print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

#print(H)
#print(A)

Count = int(H/A)

#print(Count)

amari = H%A

if amari == 0:
    print(Count)
else:
    print(Count+1)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

Solution code:
import math

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

N = math.ceil(H/A)

print(N)

Submission status: Accepted

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

q, mod = divmod(list[0], list[1])
if mod == 0 :
  print(q)
else :
  print(int(q+1))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inp = input().rstrip().split(" ")
HP = int(inp[0])
ATK = int(inp[1])
if HP % ATK == 0:
  print(int(HP / ATK))
else:
  print(int(HP / ATK) + 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())

ans = int(0)

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
lines = stdin.readlines()
 
H, A = map(int, lines[0].split())

cnt = 1
while cnt <= 10000:
  if cnt * A >= H:
    print(cnt)
    break
  cnt += 1

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
    h, a = map(int, input().split())

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

    print(ans)

Submission status: Accepted

Solution code:
x, y = map(int,input().split())

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

Submission status: Accepted

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