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:
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=map(int,input().split())
for k in range(0,(h//a)+2):
  if (h-a*k)<=0:
    print(k)
    break

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

n=((h-1)//a)+1

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
M = input().split()

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

quo = H % A

if quo == 0:
  ans = H // A
else:
  ans = (H // A) + 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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:
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
for i in range(10000):
    h -= a
    count += 1
    if h <= 0:
        break    
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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-1)//a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.buffer.readline().split()))
    print(A//B if A%B == 0 else A//B+1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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 = [int(x) for x in 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:
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    H,A = LMIIS()
    from math import ceil
    print(ceil(H/A))
    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

h, a = na()
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 math
H, A = map(int, input().split())
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
H,A=map(int,input().split())
i=1
while H>A*i:
  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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

q, mod = divmod(h, a)

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

Submission status: Accepted

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

co = 0
h1 = h

for n in range(10**4):
    h1 = h1-a
    co = co+1
    if h1<=0:
        break
print(co)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:

def main():
    
    h,a = map(int, input().split())

    if h <= a:
        print(1)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

ans = int(h/a) + min(1, h % a)
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

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

print(math.ceil(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())
x = h // a
y = h / a
if x == y:
    print(x)
else:
    print(x + 1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(H: int, A: int):
    from math import ceil
    print(ceil(H/A))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np

h,a = map(int, input().split())
# n = int(input())
# 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())
if h % a == 0:
    print(int(h/a))
else:
    print(math.ceil(h/a))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

##i18n##
a  = input().split()
H = int(a[0])
A = int(a[1])

num  = H // A
remain = H % A

if A >= H:
  out = 1
else:
 if remain > 0:
    out = num + 1
 else:
    out = num 

print(out)

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:
list = input().split(" ")
H = int(list[0])
A = int(list[1])

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

print(t)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a % b == 0:
  print(ans)
elif a % b != 0:
  print(ans + 1)

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

h, a = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    return N // M if N % M == 0 else N //M + 1

print(solve())

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())
cnt = 0
while h > 0:
    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:
# A - Serval vs Monster 
h,a=list(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())
if a % b ==0:
	print (a//b)
else:
	print (a//b+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:
H, A = input().split()
H=int(H)
A=int(A)
cnt=0

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

print(cnt)

Submission status: Accepted

Solution code:

h, a = list(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:
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 = -(-H//A)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

H,A = [int(x) for x in stdin.readline().rstrip().split()]
if H%A==0:
    print(int(H/A))
elif A>H :
    print(1)
else :
    print(1+int(H/A))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(int(-(-H//A)))

Submission status: Accepted

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

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

print(count)

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


def main():
    from math import ceil

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

Submission status: Accepted

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

ans = int(H / A)

if H % A:
    ans = 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())

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

Submission status: Accepted

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

print(math.ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(total)

Submission status: Accepted

Solution code:
#A
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 = H // A

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

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 = 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 = (int(x) for x in input().split())
cnt = 0

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

print(cnt)

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

print(cnt)

Submission status: Accepted

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

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())
if H % A >0:
  print(math.ceil(H/A))
else: 
  print(int(H/A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
H, A = map(int, input().split())
kaisu=0
q,mod = divmod(H,A)

if mod==0:
    kaisu=q
else:
    kaisu=q+1


print(kaisu)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
H, A = map(int, input().split())

kaisu = 0
for num in range(100000):
    H=H-A
    kaisu = kaisu + 1
    if H <= 0:
        break

print(kaisu)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    H,A = list(map(int,input().split()))
    # H: 体力
    # A: 攻撃
    count = 0
    for _ in range(pow(10,4)):
        H -= A
        count += 1
        if (H <= 0):
            break
    print(count)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    input = stdin.readline

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for i in range(100000):
  h -= a
  ans += 1
  if(h <= 0):
    break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

monsterH = int(parmlist[0])
servalA = int(parmlist[1])
attack_times = monsterH/servalA
int_attack_times = int(attack_times)

if attack_times-int_attack_times > 0:
    real_attack_times = int_attack_times + 1
else:
    real_attack_times = int_attack_times

print(real_attack_times)

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

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

Submission status: Accepted

Solution code:
たいりょく, こうげき = map(int, input().split())
こたえ = (たいりょく - 1) // こうげき + 1
print(こたえ)

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

n = input().split(" ")
h = int(n[0])
a = int(n[1])

def main(health, attack):
    total = health / attack
    print(math.ceil(total))


if __name__ == '__main__':
    main(h, a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

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

sign = num[0]%num[1]

if sign == 0:
  ans = num[0]//num[1]
else:
  ans = num[0]//num[1] + 1

print(ans)

Submission status: Accepted

Solution code:
import math
from fractions import gcd

import numpy as np
import scipy as scp

# 入力の受け取り
h,a = map(int,input().split())

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

print(ans)

Submission status: Accepted

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

shou=H//A

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
from itertools import permutations, combinations, accumulate
from collections import deque
from heapq import heappush, heappop, heapify
import math

input = sys.stdin.readline
sys.setrecursionlimit(10**6)

MOD = 10**9 + 7

def main():
    h,a = list(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(int(H/A))
else:
  print(H//A+1)

Submission status: Accepted

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

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

#引数クラス
class Param:
  H, A = ( int(x) for x in input().split(' '))
  def culc(self):
    print(math.ceil(self.H/self.A))

#処理の実態
tmp = Param()
tmp.culc()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC153A
import sys
import math
H, A = map(int, sys.stdin.readline().split())

print(math.ceil(H/A))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

print(ceil(a/b))

Submission status: Accepted

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

print(-(-h//a))