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

ans = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

#n=int(input())
h,a=list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    h,w=INTM()
    print(int((h-0.1)//w+1))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

Submission status: Accepted

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

import math
from collections import defaultdict

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

ans = 0

while h != 0:
    if h <= 0:
        break

    h -= a
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
C=A/B
if(C>int(A/B)):
  D=int(A/B)+1
else:
  D=int(A/B)
print(D)

Submission status: Accepted

Solution code:
import math

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
print(-eval(("-"+input()).replace(" ","//")))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = ceil(h/a)

print(ans)

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:
import sys
import math
h, a = [int(i) for i in sys.stdin.readline().split()]
print(math.ceil(h / a))

Submission status: Accepted

Solution code:
# Initializing variables
monsterHP, attackDamage = map(int, input().split())
attack = 1

# Calculating the number of attacks serval needs to make to win.
while monsterHP > attackDamage :
    monsterHP -= attackDamage
    attack += 1
print(attack)

# Check out my Youtube channel! https://www.youtube.com/channel/UCMOKVyAbTZOpKikTrX5dy_A

Submission status: Accepted

Solution code:
# Initializing variables
monsterHP, attackDamage = map(int, input().split())
attack = 1

# Calculating the number of attacks serval needs to make to win.
while monsterHP > attackDamage :
    monsterHP -= attackDamage
    attack += 1
print(attack)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
  ans = h//a
else:
  ans = h//a + 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
H,A = map(int, input().split())
print(math.ceil(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:
H,A=map(int,input().split())
count = 0
while H > 0:
  count+=1
  H -= A
print(count)

Submission status: Accepted

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

print(-(-(kazu[0]) // kazu[1]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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


if a % b == 0:
    ans = math.floor(a / b)
else:
    ans = math.floor(a / b) + 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read#全部読み込むやつ
readline = sys.stdin.buffer.readline#1行読み込むやつ
readlines = sys.stdin.buffer.readlines#リストで読み込むらしい

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

Submission status: Accepted

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

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

Submission status: Accepted

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

act = 0
remain = H

while remain > 0:
    act += 1
    remain = H - A*act

print(act)

Submission status: Accepted

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

if h == 1 or a == 1:
  print(h)
else:
  print((h+a-1) //a)

Submission status: Accepted

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

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

print(int(ans))

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
import math

line = input().split(' ')
life = int(line[0])
attack = int(line[1])

print(math.ceil(life / attack))

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
flag = False
if h % a != 0:
    flag = True

ans = h // a
if flag:
    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:
#!/usr/bin/env python3
import math
import sys


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


# 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:
H,A = list(map(int,input().split()))
for i in range(H+1):
    if H > 0:
        H = H-A
    else:
        t = i
        break
print(t)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.readline
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getlist():
    return list(map(int, input().split()))
import math
import heapq
from collections import defaultdict, Counter, deque
MOD = 10**9 + 7
INF = 10**15


def main():
    n, k = getlist()
    print(math.ceil(n / k))


if __name__ == '__main__':
    main()

"""
9999
3

2916
"""

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
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=0
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:
  res = H // A
else:
  res = H // A + 1

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
h, a = line.split(" ")
h, a = int(h),int(a)
ans = int((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 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 + (h%a>0))

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

print(res)

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 = [int(x) for x in input().strip().split()]
print(H // A + (H % A != 0))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
# 2つの整数
N, M = input().strip().split()
N, M = [int(N), int(M)]

if N % M:
	ans = N // M + 1
else:
	ans = N // M
print(ans)

Submission status: Accepted

Solution code:
line = input()
h, a = line.split(" ")
#商とあまりを取得
q, mod = divmod(int(h), int(a))
if mod != 0:
    q = q + 1
    print(q)
else:
    print(q)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputa = input()

h,k = inputa.split()
H=int(h)
K=int(k)
cnt=0
while(H>0):
  H=H-K
  cnt=cnt+1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline


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


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret


class UnionFind:
    def __init__(self, n):
        self.sz = [-1 for i in range(n)]

    # 検索
    def find(self, x):
        if self.sz[x] < 0:
            return x
        else:
            self.sz[x] = self.find(self.sz[x])
            return self.sz[x]

    # 併合
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.sz[x] > self.sz[y]:
            x, y = y, x
        self.sz[x] += self.sz[y]
        self.sz[y] = x

    # 同じ集合に属するか判定
    def same(self, x, y):
        return self.find(x) == self.find(y)

    # xが含まれている集合のサイズを求める
    def size(self, x):
        return -self.sz[self.find(x)]


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

Submission status: Accepted

Solution code:
x = [int(i) for i in input().split(" ")]
floor = x[0] // x[1]
if x[0] % x[1] == 0:
  print(floor)
else:
  print(floor + 1)

Submission status: Accepted

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

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:
inp =input().split(" ")
ans = (int(inp[0])+int(inp[1])-1)//int(inp[1])

print("{}".format(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,A = (input()).split()
H = (int)(H)
A = (int)(A)

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

Submission status: Accepted

Solution code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()
H = int(get(text,2)[0])
A = int(get(text,2)[1])

if H%A !=0:
    print(H//A+1)
else:
    print(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())
b=0
while True:
  if h-a>0:
    b+=1
    h=h-a
  else:
    break
print(b+1)

Submission status: Accepted

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
h, a = i2()
print(h//a if h%a == 0 else h//a+1)

Submission status: Accepted

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

import math
print( math.ceil(h/a) )

Submission status: Accepted

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

val=n//m
if m*val<n:
  val+=1
print(int(val))

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 = [int(i) for i in 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())
times, mod = divmod(H, A)
if mod != 0:
    times += 1
print(times)

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:
def attack(h, a):
  cnt = h / a
  if h % a != 0:
    cnt += 1
  return int(cnt)

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

Submission status: Accepted

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

R1 = H // A
R2 = 1 if H % A > 0 else 0
print(R1 + R2)

Submission status: Accepted

Solution code:
import sys
import math

def main():
    h, a = [int(x) for x in sys.stdin.readline().split()]
    print(int(math.ceil(h / a)))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
ans = H//A
print(ans if H%A == 0 else ans+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:
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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc153/tasks/abc153_a

import math
h, a = [int(x) for x in input().split()]
print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
inputs = input().split(" ")
health, attacks = int(inputs[0]), int(inputs[1])
print(math.ceil(health/attacks))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hp_atk = input()
      
hp,atk = hp_atk.split(" ")

cnt = 0
while (int(hp) > 0):
  hp = int(hp) - int(atk)
  cnt += 1
  
print(cnt)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

H,A = map(int,input().split())
f, i = math.modf(H/A)

if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False

if f == 0:
  print(int(i))
if f != 0:
  print(int(i+1))

Submission status: Accepted

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

c=h//a+(h%a>0)

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = (int(x) for x in input().split())
y = -(-H // A)
print(y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
h, a = list(map(int,input().split(' ')))
#print(h,a)
n = 0
ap = 0
while h>ap:
  ap = n*a
  n +=1
#  print(ap,n)

  
print(n-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

for line in sys.stdin:
    l= line.split()
    H=int(l[0])
    A=int(l[1])
    i = 0
    while(H>0):
        H-=A
        i+=1
    print(i)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

listA=[]

try:
    listA = list(input().split())
    #listA<-[1,2,2,3,1]
    #print(listA)
    #ここに逐次処理を書けばいいと思う。
except:
    quit();
    #または、quit(),os.exit()をして止める。

H=int(listA[0])
A=int(listA[1])

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

Submission status: Accepted

Solution code:
args = input().split(' ')

Health = int(args[0])
AttackPoint = int(args[1])

AttackCount = (Health // AttackPoint) + (1 if (0 != Health % AttackPoint) else 0)

print(AttackCount)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
aa = a.split()
a0 = int(aa[0])
a1 = int(aa[1])

t = 1

while a0 > a1:
    a0 = a0 - a1
    t += 1
    
print(t)

Submission status: Accepted

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

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

Submission status: Accepted

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

if H<=A:
    print(1)
elif 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())
answer = math.ceil(h / a)
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import itertools
import sys
import math
import numpy as np
from collections import deque
from itertools import combinations
from functools import lru_cache
sys.setrecursionlimit(10**9)


def main():
    H,A = map(int,input().split())

    m,r = divmod(H,A)

    print(m if r == 0 else m + 1)

if __name__ == "__main__":
  main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np
import queue

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/bin/env python
  
class Monster():
  def __init__(self, hp):
    self.hitpoint = hp

  def damage(self, damage):
    return -(-self.hitpoint // damage)

def main():
  input_string = raw_input()
  monster = Monster(int(input_string.split(' ')[0]))
  print(monster.damage(int(input_string.split(' ')[1])))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h, n = (int(z) for z in input().split())
print((h + n - 1) // n)

Submission status: Accepted

Solution code:
N,M = (int(x) for x in input().split())
 
K = int(N/M)
if N < M:
  print(1)
elif N%M == 0:
  print(K)
else:
  print(K+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:
# -*- coding:utf-8 -*-
h,a = map(int, input().split())
count = 0

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

Submission status: Accepted

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