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

Submission status: Accepted

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

count = x//y

if x%y != 0:
    count += 1

print(count)

Submission status: Accepted

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

for i in range(1,1000000):
    if H - i * A <= 0:
        print(i)
        break

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

counter = 0
H = num[0]

while H > 0:
    H -= num[1]
    counter += 1

print(counter)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = list(input().split(" "))
h = int(A[0])
a = int(A[1])
i = 0
b = 0
while(h>b):
    i += 1
    b = a*i
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:
import math
h,a=map(int,input().split())
t=math.ceil(h/a)
print(t)

Submission status: Accepted

Solution code:
HP, AT = map(int, input().split())
count = 0

while(HP > 0):
  HP = HP - AT
  count = count + 1
  
print(count)

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

Submission status: Accepted

Solution code:
H, A = [int(i) for i in input().split()]
ans = 0
while H > 0:
    H -= A
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

k = 0
while True:
  k += 1
  h -= a
  if 0 >= h:
    break

print(k)

Submission status: Accepted

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

Submission status: Accepted

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

count = 1
sum_damage = 0

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

print(str(count))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
import string


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, A = inputIntList()
  ans = math.ceil(H / A)

  return ans


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

Submission status: Accepted

Solution code:
input1 = input().split()
HP = int(input1[0])
ATK = int(input1[1])

if HP%ATK != 0:
    print(HP//ATK + 1)
else:
    print(HP//ATK)

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] = [int(x) for x in input().split()]
ans=int(h/a)
if(h%a==0):
	print(int(ans))
else:
	print(int(ans+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:
# -*- coding: utf-8 -*-

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

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

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:
#!/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:
# -*- coding: utf-8 -*-
from math import ceil
h,a = map(int, input().split())
print(ceil(h/a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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


def main():
    return math.ceil(H / A)


ans = main()

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

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

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()]
import math
print(math.ceil(h/a))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
r = h % a
t = h // a

if r == 0:
    print(t)
else:
    print(t + 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np
H, A = map(int, input().split())
num = int(np.ceil(H/A))
print(num)

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:
num = input().split(" ")
hpoint = int(num[0])
dmg = int(num[1])
atk = int(hpoint / dmg)
result = hpoint % dmg

if result != 0:
  atk += 1
print(atk)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt
from fractions import gcd
from itertools import permutations, combinations

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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



# N = intinput()
# S = input()
H, A = mulinputs()
# datas = list(mulinputs())
# datas = lineinputs(input)

# 出力
ans = H//A
if H - (ans * A) > 0:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

H, A = [int(x) for x in 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)
if H%A!=0:
	print(H//A+1)

Submission status: Accepted

Solution code:
# H, A = map(int, open(0).read().split())
H, A = map(int, input().split())

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

Submission status: Accepted

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

if __name__=='__main__':
  T= int(H//A) if H % A==0 else int(H//A)+1
  print(T)

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

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

print(math.ceil(H / A))

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

while True:
    if h > 0:
        ans += 1
        h -= a
    else:
        break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_int_n():
    return list(map(int, input().split()))
A=read_int_n()
h=A[0]
a=A[1]

print(-(-h // a))

Submission status: Accepted

Solution code:
#A
#入力
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 = h // a
if h % a != 0:
    ans += 1 
print(ans)

Submission status: Accepted

Solution code:
import math

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

n = math.ceil(H / A)

print(n)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    H,A = (int(x) for x in input().split())
    a = 1
    while H - A*a >0:
        a += 1
    print(a)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    H, A = [int(_) for _ in input().split()]
    if H < A:
        print(1)
    elif H % A == 0:
        print(H // A)
    else:
        print(H // A + 1)
main()

Submission status: Accepted

Solution code:
h, at = input().split(' ')
h = int(h)
at = int(at)
i=0

while h>at:
  h = h - at
  i = i + 1
  
print(i+1)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

print (d)

Submission status: Accepted

Solution code:
import sys
a = input().split()  
h=int(a[0])
b=int(a[1])
for i in range(10000000000):
 res = h-b*i
 if res <=0:
  print(i)
  sys.exit()

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split()  ) #split()で分解したものを別々の変数に入れる

result=0

if a % b !=0:
    result += 1 

result += a // b 
print(result)

#####################

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
    H, A = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import math
import numpy as np


DEBUG = True
dprint = print if DEBUG else lambda *x : x

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

print(math.ceil(H / A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,A = map(int,input().split(" "))
result = 1
while h > A*result:
    result+=1
print(result)

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

for i in range(10**4+1):
  if a[1]*i >= a[0]:
    break
    
print(i)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

# H A モンスターのヒットポイントとダメージ
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:
s,t=map(int,input().split())
x=0
while s>0:
    s=s-t
    x+=1
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

ans = h/a

print(math.ceil(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

import itertools as iter
import math
import fractions
from functools import reduce

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

H,A = nums()
print(math.ceil(H/A))

Submission status: Accepted

Solution code:
# your code goes here
n,k=map(int,input().split())
if(n%k==0):
	print((n//k))
else:
	print((n//k)+1)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
h, a = map(int, input().split())
ans = 1
while True:
    if a*ans >= h:
        break
    else: 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:
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:
  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 numpy as np
N, a = list(map(int, input().split()))
 
print(int(np.ceil(N/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 H>0 :
    H-=A
    ans+=1

print(ans)

Submission status: Accepted

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

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:
h, a = [int(i) for i in input().split()]
print(h//a + (0 if h%a == 0 else 1))

Submission status: Accepted

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

print(n // k + 1  if n % k else n //k)

Submission status: Accepted

Solution code:
H, F = [int(i) for i in input().split()]
counter = 0
while H > 0:
    H -= F
    counter += 1
print(counter)

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

ans = 0

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

print(ans)

Submission status: Accepted

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

n = H // A
m = H % A

if m == 0:
    print(n)
else:
    print(n+1)

Submission status: Accepted

Solution code:
import math
n=list(map(int,input().split()))
print((math.ceil(n[0]/n[1])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(int(-(-h//a)))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math


def main():
    h_and_a_s = sys.stdin.readline().strip().split(' ')
    h, a = [int(s) for s in h_and_a_s]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(-(-H//A))

Submission status: Accepted

Solution code:
def  win(H,A):
    cnt = 0
    while(H>0):
        cnt +=1
        H = H-A
    return cnt



inp = input().split()
# print(inp)
H = int(inp[0])
A = int(inp[1] )
print(win(H,A))

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

Submission status: Accepted

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

    c += 1

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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())

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

Submission status: Accepted

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



	

if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

print(m.ceil(h/a))

Submission status: Accepted

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

import math
print(math.ceil(H/A))

Submission status: Accepted

Solution code:

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


if abs(H/A-H//A)<0.000001:
    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:
#abc153 a
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 = H//A
if H - A * cnt > 0:
    cnt += 1

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(math.ceil(a/b))

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:
a,b=map(int,input().split())
count=1
A=True
while A==True:
    a=a-b
    if a>0:
        count=count+1
    else:
        A=False

print(count)

Submission status: Accepted

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

ans = 0

while hp > 0:
    hp = hp - a
    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().lower().split())
count = 0
while(True):
    H = H - A
    if H <= 0:
        count = count + 1
        break
    else:
        count = count + 1

print(count)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

def main():
    H,A=mis()
    print(math.ceil(H/A))


main()

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

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

Submission status: Accepted

Solution code:
import math
i = list(map(int, input().split()))
ans = i[0]/i[1]
print(math.ceil(ans))

Submission status: Accepted

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

n = 1

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = H // A

if H % A != 0:
    count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


H, A = inpl()

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

Submission status: Accepted

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

syo = H/A
f = H % A

if f==0:
  print(int(syo))
else:
  print(int(syo+1))

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

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

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:
#python3
from numpy import ceil
h, a = map(int, input().split())
n = ceil(h/a)
print(int(n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import math

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

if __name__ == "__main__":
  main()

Submission status: Accepted

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

x, y = divmod(h, a)
if y == 0:
    print(x)
else:
    print(x+1)

Submission status: Accepted

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

Submission status: Accepted

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

n = 0
while h - n * a > 0:
    n += 1

print(n)