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())
for i in range(1000000):
    if A*i>=H:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,a=list(map(int,input().split()))
import math
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:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

I = list(map(int, input().split()))
H = I[0]
A = I[1]
count = 0

if not 1 <= H or not H <= 10**4 or not 1 <= A or not A <= 10**4:
    print("error:1≤H≤10000,1≤A≤10000である必要があります")
    sys.exit()
# print("H =",H, "A =",A)

while True:
    H -= A
    count += 1
    # print("H =",H, "A =",A)
    if H <= 0:
        break
print(count)

Submission status: Accepted

Solution code:
def attack(h, a):
    i = 0
    while True:
        i += 1
        h -= a
        if h <= 0:
            break
    return i

if __name__ == "__main__":
    h, a = map(int, input().split())
    print(attack(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:
x, y = list(map(int,input().split()))

answer = x//y

if not x%y == 0:
    answer = answer + 1

print(answer)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
 
a = input().split(" ")
H = int(a[0])
A = int(a[1])
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):
  print("1")
elif(h%a != 0):
    print(h//a+1)
else:
    print(h//a)

Submission status: Accepted

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

Submission status: Accepted

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

a = input().split(" ")
H = int(a[0])
A = int(a[1])
ans = 0
while H > 0:
    H -= A
    ans += 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
Input = input().split(" ")
H = int(Input[0])
A = int(Input[1])
Ans = H//A
if (H%A==0):
  print(Ans)
else:
  print(Ans+1)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, A = MAP()

print(-(-H//A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
line = line.split(" ")
H = int(line[0])
A = int(line[1])
count = 0
while H>0:
  count+=1
  H=H-A
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
str = input()
str_list=str.split()
H=int(str_list[0])
A=int(str_list[1])
Q=math.ceil(H/A)
print(Q)

Submission status: Accepted

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

# スペース区切りの整数の入力
h, a = map(int, input().split())

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

# 出力
print("{}".format(count))

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

Submission status: Accepted

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

h=x[0]
a=x[1]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from sys import stdin, stdout
 
def main():
	arr = [int(x) for x in stdin.readline().split()]
	H, A = arr
	count = 0
	while H > 0:
		H -= A
		count += 1
	stdout.write(str(count))
    
if __name__ == "__main__":
	main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 0

li = input().split()
li = [int(i) for i in li]

while 0 < li[0]:
    a += 1
    li[0] -= li[1]

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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()))
import math
print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    H, A = map(int, input().split())
    Ans = H // A
    _Ans = H % A

    if _Ans >= 1 :
        print(Ans + 1)

    else :
        print(Ans)
        
resolve()

Submission status: Accepted

Solution code:
def resolve():
    n, a = map(int, input().split())

    print(-((-1 * n) // a))
    
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#AtCorder Serval vs Monseter
import math
def main():
	H,A=map(int, input().split())
	print(math.ceil(H/A))
main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
def main():
    H,A = map(int, input().split())
    ans = int(H/A)
    if H%A > 0 : ans+=1
    print(ans)
    return

if __name__=="__main__":
    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:
import sys
inputs = sys.stdin.readline()
inputs = inputs.split()
# inputs = inputs.split('')

H, A = int(inputs[0]), int(inputs[1])

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

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

Solution code:
import math
 
line = input()
numList = [int(num) for num in line.split(' ')]
monsterHP,servalA = numList[0],numList[1]
print(math.ceil(monsterHP/servalA))

Submission status: Accepted

Solution code:
from sys import stdin
A,B=map(int,stdin.readline().rstrip().split())
print((A//B)+1 if A%B!=0 else A//B)

Submission status: Accepted

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

print(-(-H//A))

Submission status: Accepted

Solution code:
hp, at = map(int, input().split(' '))
ans = 0
while hp > ans * at:
  ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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


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

print(ans)
#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())
x=(-(-h//a))
print(x)

Submission status: Accepted

Solution code:
# get H, A
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:
h, a = map(int, input().split())
cnt = 0
while h > 0:
    cnt += 1
    h = h - a
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
# coding: utf-8
# Your code here!
import math

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

ANS=math.ceil(H/A)

print(ANS)

Submission status: Accepted

Solution code:
data=input().split()
HP=int(data[0])
ATK=int(data[1])
count=0
while HP>0:
  HP=HP-ATK
  count=count+1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

hp , attack = map(int,input().split())

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.ceil(hp / attack))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import itertools
# import math

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H, A = map(int, readline().split())
print((H-1)//A+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import ceil
from sys import stdin
n,m = map(int,stdin.readline().split())
print(ceil(n/m))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=list(map(int, input().split()))
Y=(X[0]+X[1]-1)/X[1]

print(int(Y))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
h, a = map(int,input().split())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c,d=(int(x) for x in input().split())
a=-(-c//d)
print(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:
import math


def solve(h, a):
    return math.ceil(h / a)


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

    ans = solve(h, a)
    print(ans)


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

for j in range(10000):
    H = H - A
    if H <= 0:
        i = i
    else:
        i = i + 1
if H <= 0:
    print(i)

Submission status: Accepted

Solution code:
from sys import stdin
import math

def main():
    n,m = map(int,stdin.readline().split())
    print(math.ceil(n/m))
main()

Submission status: Accepted

Solution code:
from sys import stdin
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

def calc_atack(H, A, counter =0):
    H -= A
    counter += 1
    if H <= 0:
        return counter
    else:
        return calc_atack( H, A, counter = counter)


print(calc_atack(H, A))

Submission status: Accepted

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

s=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

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

#出力
s = 1
counter = 1
while counter>0:
    if H - A >0:
        H = H - A
        s = s + 1
        counter = counter
    else:
        H = H - A
        s = s
        counter = counter - 1
        print(s)

Submission status: Accepted

Solution code:
h,d = list(map(int, input().split()))
c,m = divmod(h,d)
if 0 != m:
  m = 1
print(c+m)

Submission status: Accepted

Solution code:
def main(Hitpoint,Attack):
  count_num = 0
  while True:
    Hitpoint -= Attack
    count_num += 1
    if Hitpoint <= 0:
      break
  return count_num
 
if __name__ == "__main__":
    inp=input().split()
    hitpoint = int(inp[0])
    attack = int(inp[1])
    print(main(hitpoint,attack))

Submission status: Accepted

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

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
from math import ceil
num = [int(_) for _ in input().split()]
print(ceil(num[0] / num[1]))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = list(map(int, input().split(" ")))
if H <= A:
  print(1)
elif 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:
import math

if __name__ == '__main__':
    # a = int(input())
    # a, b = map(int, input().split())

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

Submission status: Accepted

Solution code:
H, Q = map(int, input().split())
print((H-1)//Q + 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()) 
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:
import math

input = list(map(int,input().split()));
print(math.ceil(input[0]/input[1]));

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
# A - Serval vs Monster
# https://atcoder.jp/contests/abc153/tasks/abc153_a?lang=en
# s[0],[1]
# a = input().split()strs
def main():
  s = list(map(int,input().split()))
  hp = s[0]
  ad = s[1]
  ans = int(hp / ad)
  if(ans * ad < hp):ans = ans + 1
  print(ans)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re

Input = input()

pat = r'[0-9]+'

num_list = re.findall(pat, Input)



cou = int(num_list[0])//int(num_list[1])

if int(num_list[0]) % int(num_list[1]):
    cou += 1

print(cou)

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 re

Input = input()

pat = r'[0-9]+'

num_list = re.findall(pat, Input)

#print("HP =",num_list[0])
#print("ATK =",num_list[1])

HP = int(num_list[0])
ATK = int(num_list[1])

cou = HP//ATK

if HP % ATK:
    cou += 1

print(cou)

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

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

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

print(attack)

Submission status: Accepted

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

if H <= 0:
    print(S)

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(i) for i in input().split(' ')]
print(H // A + min(H % A, 1))

Submission status: Accepted

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

Submission status: Accepted

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

if i[0] == i[1]:
    print("1")
elif i[0] % i[1] > 0:
    print((i[0] // i[1]) + 1)
else :
    print(i[0] // i[1])

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

if i[0] == i[1]:
    print("1")
elif i[0] % i[1] > 0:
    print((i[0] // i[1]) + 1)
else :
    print(i[0] // i[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
values = input()
H, A = map(int, values.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:
#A問題
h,a=map(int,input().split())
import math
print(math.ceil(h/a))
import time
time.sleep(1.98)

Submission status: Accepted

Solution code:
S = input().split(" ") #標準入力

H = int(S[0]) #モンスターのHP
A = int(S[1]) #サーバルの攻撃力

atCount = 0 #攻撃回数

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

print(atCount)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().rstrip().split(' ')
life = int(s[0])
attack = int(s[1])
cnt=0

while life>0:
    life -= attack
    cnt += 1 
else:
    pass

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import logging
logging.basicConfig(level=logging.DEBUG)

H, A = map(int, input().split())
print(-(-H//A))
logging.info(H,A)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    h, a = LI()
    print(math.ceil(h/a))
    return


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
 
for line in sys.stdin:
    h, a = list(map(lambda x: int(x), line.split()))
    hits = h // a
    if h % a == 0 and a > 0:
        print(hits)
    else:
    	print(hits + 1)

Submission status: Accepted

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

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:
import math
def main():
	H,A = map(int,input().split())
	print(math.ceil(H/A))
if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, A = [int(_) for _ in input().split()]
count = 0
while True:
    if N > 0:
        N -= A
        count += 1
    else:
        break

print(count)

Submission status: Accepted

Solution code:
N,K = [int(x) for x in input().split()]
print(-1*((-1*N)//K))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nums=[int(i) for i in input().split()]

if nums[0]%nums[1]==0:
    print(int(nums[0]/nums[1]))
    
else:
    print(int(nums[0]/nums[1])+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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