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())
ans = a // b;
if a % b != 0:
	ans += 1;
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())
i = 0

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

print(i)

Submission status: Accepted

Solution code:
import math

val = input().split(' ')
h = float(val[0])
a = float(val[1])

print(math.ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
h, a = input().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())
n = 0
while True:
    h = h - a
    n = n + 1
    if h <= 0:
        break
print(n)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def get_total_strike_times(health: int, damage: int) -> int:
    """
    Given a monster's health and damage in integer,
    calculate the number of attack required to deplete the monster's health.
    :param health: int
    :param damage: int
    :return: int
    """
    return int((health + damage - 1) / damage)


if __name__ == '__main__':
    print(get_total_strike_times(*map(int, input().split())))

Submission status: Accepted

Solution code:
import math


def get_total_strike_times(health: int, damage: int) -> int:
    """
    Given a monster's health and damage in integer,
    calculate the number of attack required to deplete the monster's health.
    :param health: int
    :param damage: int
    :return: int
    """
    return math.ceil(health / damage)


if __name__ == '__main__':
    print(get_total_strike_times(*map(int, input().split())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
y = input()
data = y.split()
data2 = [int(str) for str in data]


time = int(data2[0]/data2[1])
if data2[0]%data2[1] != 0 : time += 1

print(time)

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

num = H // A
amari = H % A

if amari > 0:
	print(num+1)
else:
	print(num)

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

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

print(n)

Submission status: Accepted

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

print((H-1)//A + 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:
H,A = list(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())
counter = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x, y = (int(x) for x in input().split())
print(math.ceil(x / y))

Submission status: Accepted

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

a = int(H/A)
b = int(H%A)

if b!=0:
  a+=1

print(a)

Submission status: Accepted

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

HP = int(H) / int(A)
print(math.ceil(HP))

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

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

Submission status: Accepted

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

num = 0
while True:
    H -= A
    num += 1
    if H <= 0:
        break

print(num)

Submission status: Accepted

Solution code:
h,a=[int(i) for i in 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((H//A)+1)

Submission status: Accepted

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

ans=0

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math
a, b = map(float, input().split())
x = a / b
if (x.is_integer() == False):
    print(math.ceil(x))
else:
    print(int(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hp_list = input().split(" ")
h = int(hp_list[0])
a = int(hp_list[1])
x = h / a
y = h // a
if (x == y):
  count = x
else:
  count = y + 1

count = int(count)
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if int(c/d)==c/d:
  print(str(int(c/d)))
else:
  print(str(int(c/d)+1))

Submission status: Accepted

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

import math

answer = H/A

if answer.is_integer():
    print(math.floor(answer))
else:
    print(math.floor(answer)+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(h//a)
else:
  print(h//a + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()



def main():
    H,A = isRaw()
    return (H+A-1)//A


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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,m = LI()

    return (n+m-1) // m


print(main())

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(H/A))

Submission status: Accepted

Solution code:
# ABC153
#A
import math

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

print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Serval vs Monster

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

Submission status: Accepted

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

print(sho)

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((-(-a//b)))

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
import math

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

if (H%A >0):
  print(int(math.ceil(H/A)))
else:
  print(int(H/A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(-(-h // a))

#sabaさんの写経//　ってなんだ。そういう演算子があるのか

Submission status: Accepted

Solution code:
#juppyさんの写経
h,a = map(int,input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
h,a = map(int,sys.stdin.readline().split())
print(int((h+a-1)/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#n = int(input())
#s = input()
n,m = map(int,input().split())
#da = list(map(int,input().split()))

print((n-1)//m+1)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 = (int(x) for x in input().split())
cnt = 0
while True:
    h -= a
    cnt += 1
    if h <= 0:
        break
print(cnt)

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:
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())
print((H + A - 1)//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:
import sys
input = sys.stdin.readline
H,A = [int(i) for i in input().split()]
d = H // A
m = H % A
if m == 0 :
    print(d)
else :
    print(d+1)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
import sys
h, a = map(int, sys.stdin.readline().split())
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()))
count=0
while H>0:
    H=H-A
    count +=1
print(count)

Submission status: Accepted

Solution code:
def wczytaj_liste():
    ciag = input()
    rozdzielona_lista = ciag.split()
    odp = []
    for wyraz in rozdzielona_lista:
        liczba = int(wyraz)
        odp.append(liczba)
    return odp

def Monstery():
    H, A = wczytaj_liste()
    odp = H//A
    if H - odp*A > 0:
        odp += 1
    print(odp)

Monstery()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

if a/b-int(a/b)==0:
  c=int(a/b)
if a/b-int(a/b)!=0:
  c=int(a/b)+1

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    H, A = LI()
    print(H // A + (H % A > 0))

main()

Submission status: Accepted

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

print(h//a + int(h%a!=0))

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

a, b = [int(i) for i in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = map(int, input().split())
if H%A == 0:
    ans = int(H/A)
    print(ans)
else:
    ans = int(H/A) + 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:
def main():
    num = [int(i) for i in input().split()]
    h = num[0]
    a = num[1]
    return attack(h, a)

def attack(h,a):
    if h % a == 0:
        return h // a
    elif h % a >= 1:
        return (h//a) + 1

print(main())

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

while True:
    if H[0] > H[1]:
        H[0] = H[0] - H[1]
        count+=1
    else:
        count = count + 1
        break
print(count)

Submission status: Accepted

Solution code:
import math
n,k=map(int,input().split())
# print(math.log(n,2))
# n=math.floor(math.log(n,2))
# n=2**n
print((math.ceil(n/k)))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
x,y= map(int,input().split())
s = -(-x//y)
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = input()

H, A = val.split(' ')

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

x = H // A
if H - x * A == 0:
  print(x)
else:
  print(x + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions
from functools import reduce


if __name__ == '__main__':
    h, a = list(map(int, input().split()))
    print(math.ceil(h/a))

Submission status: Accepted

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

result = (hp - 1) // ap + 1

print(result)

Submission status: Accepted

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

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

H, A = (int(i) for i in input().split())
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
N, M=map(int,input().split())
count=1
X=0
while N > X:
  X = M * count
  count += 1
print(count-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().strip().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def main():
    h,a = map(int,input().split())
    print(math.ceil(h/a))
    return 

if __name__=="__main__":
    main()

Submission status: Accepted

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

print(-(-H//A))

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

Submission status: Accepted

Solution code:
arr1 = str(input())
arr = arr1.split()
health = int(arr[0])
attack = int(arr[1])

if health % attack == 0:
    print(int(health // attack ))
else:
    th = health // attack + 1
    print(int(th))

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

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

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main_1():
    H, A = read_int_list()
    res = H // A
    if H % A != 0:
      res += 1
    print(res)


def main():
    H, A = read_int_list()
    res = 0
    while H > 0:
      H -= A
      res += 1
    print(res)

main_1()

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main_0():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


def main_1():
    H, A = read_int_list()
    res = H // A
    if H % A != 0:
      res += 1
    print(res)


def main():
    H, A = read_int_list()
    res = 0
    while H > 0:
      H -= A
      res += 1
    print(res)

main()

Submission status: Accepted

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

Submission status: Accepted

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


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


def read_str():
    return input()


def main():
    H, A = read_int_list()
    res = 0
    for i in range(10001):
      H = H - A
      res += 1
      if H <= 0:
        break
    print(res)


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H, A = input().split()
H = int(H)
A = int(A)
if H%A==0:
    print(H//A)
else:
    print(((H+A)//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:
#!/usr/bin/env python3
import sys


def solve(H: int, A: int):
    result = 0
    while H > 0:
        H = H - A
        result += 1
    print(result)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    solve(H, A)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

Health, Attach = map(int, input().split())
attackCount = math.ceil(Health / Attach)

print(attackCount)

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
print(h//a+(not not h%a))

Submission status: Accepted

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