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 True:
    H -= A
    Ans += 1
    if H <= 0:
        break
print(Ans)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

print(cnt)

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())
from math import ceil
print(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())
print(h//a + min(h%a,1))

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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((H+A-1)//A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

h = H//A
c = H%A

if c == 0:
  print(h)
else:
  print(h+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:
# A - Serval vs Monster
H,A = map(int,input().split())
tmp = 0
while H>0:
    H -= A
    tmp += 1
print(tmp)

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 math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os, sys, re, math

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

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

Submission status: Accepted

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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


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


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


def solve():
    H, A = map(int, input().split())
    print(ceil(H, A))


def main():
    solve()


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:
H, A = [int(v) for v in input().rstrip().split()]
r = int(H / A)
if H != (r * A):
    r += 1

print(r)

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

Submission status: Accepted

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

ans = ceil(round(H / A, 6))

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

cnt=0
while True:
    h-=a
    cnt+=1
    if h<=0:
        print(cnt)
        exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
score = list(map(int,input().split()))
kaisu = 1
hp = score[0]
while hp > score[1]:
    kaisu += 1
    hp -= score[1]
print(kaisu)

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

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=0

while 1:
    h-=a
    n+=1
    if h<=0:
        print(n)
        exit(0)

Submission status: Accepted

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

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

if h % a != 0:
  ans = math.floor(h/a+1)
else:
  ans = math.floor(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:
import sys

H, A = map(int, next(sys.stdin.buffer).split())
print(-(-H // A))

Submission status: Accepted

Solution code:
import sys
from itertools import count

H, A = map(int, next(sys.stdin.buffer).split())
for i in count(1):
  H -= A
  if H <= 0:
    break
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
H, A = map(int, input().split())
if H >= A:
    print(math.ceil(H / A))
elif H < A:
    print(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, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

h,a = inpm()

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

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

Submission status: Accepted

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

count = H // A
if H % A != 0:
    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:
#https://atcoder.jp/contests/abc153/tasks/abc153_a
M,N =map(int,input().split())
a,b = divmod(M,N)
if b == 0:
    print(a)
else:
    print(a+1)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a=map(int,input().split())
for i in range(1,10001):
    if a*i >= h:
        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:
a,b = map(int, input().split())
print(0--a//b)

Submission status: Accepted

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

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(H: int, A: int):
    return H//A+(H % A > 0)


def main():

    sys.setrecursionlimit(10 ** 6)

    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
    print(f'{solve(H, A)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

X = H//A

print(X if H%A == 0 else X+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 numpy as np
h, a = map(int, input().split())
print(int(np.ceil(h / a)))

Submission status: Accepted

Solution code:
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    h, a = map(int, input().split())
    print(ceil(h / a))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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(" "))
r = h // a
remainder = h % a
while remainder > 0:
    remainder -= a
    r += 1

print(r)

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

Submission status: Accepted

Solution code:
def solve():
    H,A = [int(i) for i in input().split()]
    print((H+A-1)//A)
    
if __name__ == "__main__":
    solve()

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

Submission status: Accepted

Solution code:
import math

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

print(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:
H,A = map(int,input().split())
cnt = 0
while True:
    if H <= 0:
        print(cnt)
        break
    else:
        H -= A
        cnt += 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:
def main():
    H, A = map(int, input().split())
    ans = (H + (A - 1)) // A
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import math

def main():

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

    ans = math.ceil(H / A)

    print(ans)


if __name__ == "__main__":
    main()

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, r = divmod(h, a)
if r:
	ans += 1
print(ans)

Submission status: Accepted

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

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

print(tmp)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def serval_vs_monster():
    # 入力
    H, A = map(int, input().split())
    # 処理
    if H % A == 0:
        return H // A
    else:
        return H // A + 1

result = serval_vs_monster()
print(result)

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

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

Submission status: Accepted

Solution code:
import math
tmp = input().split(" ")
 
HP = int(tmp[0])
attack = int(tmp[1])
 
print(math.ceil(HP/attack))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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


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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# abc153_a.py
# https://atcoder.jp/contests/abc153/tasks/abc153_a

# A - Serval vs Monster /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# サーバルはモンスターと戦っています。
# モンスターの体力は Hです。
# サーバルが攻撃を 1回行うとモンスターの体力を A減らすことができます。 
# 攻撃以外の方法でモンスターの体力を減らすことはできません。
# モンスターの体力を 0以下にすればサーバルの勝ちです。
# サーバルがモンスターに勝つために必要な攻撃の回数を求めてください。

# 制約
#     1≤H≤104
#     1≤A≤104
#     入力中のすべての値は整数である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# H A

# 出力
# サーバルがモンスターに勝つために必要な攻撃の回数を出力せよ。

# 入力例 1
# 10 4

# 出力例 1
# 3
#     1回目の攻撃の後のモンスターの体力は 6です。
#     2回目の攻撃の後のモンスターの体力は 2です。
#     3回目の攻撃の後のモンスターの体力は −2です。

# よって 3回の攻撃でモンスターに勝つことができます。

# 入力例 2
# 1 10000

# 出力例 2
# 1

# 入力例 3
# 10000 1

# 出力例 3
# 10000


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    H, A = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = -(H//(-A))

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['10 4']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['1 10000']
        lines_export = [1]
    if pattern == 3:
        lines_input = ['10000 1']
        lines_export = [10000]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

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

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

elif h % a != 0:
    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((H//A)+1)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(H//A + (H%A != 0))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections as cl
import sys


def II():
    return int(sys.stdin.readline())


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


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


def main():
    h, a = MI()

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


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
h,a = map(int, input().split())
r=h//a

if h-(r*a)!=0:
  r=r+1
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if not ( 1 <= H <= 10**4 and 1 <= A <= 10**4 ): sys.exit()
if not ( isinstance(H,int) and isinstance(A,int)): sys.exit()

print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

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