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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

line=input().split()
ANS=int(line[0])/int(line[1])
print(math.ceil(ANS))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

Solution code:
"""
NTC here
"""
import sys
inp= sys.stdin.readline
input = lambda : inp().strip()
flush= sys.stdout.flush
# import threading
# sys.setrecursionlimit(10**6)
# threading.stack_size(2**25)

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

# range = xrange
# input = raw_input


def main():
    h, a = lin()
    print((h+a-1)//a)



            
        

        
main()
# threading.Thread(target=main).start()

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(a/b))

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:
d = input().split(" ")
h = int(d[0])
a = int(d[1])
b = - ((-1*h) // a) 
print(b)

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())
HP=H
count=0
while HP>0:
    count+=1
    HP-=A
print(count)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

q   = h // a
mod = h % a

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

print(ans)

Submission status: Accepted

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

ans = 1
while True:
    if H <= A * ans:
        break
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

if(A >= H):
    print(1)

else:
    tmp = H / A
    print(math.ceil(tmp))

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

H, A = lr()
print(-(-H // A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = [int(s) for s in input().split()]
count = 0
while A > 0:
  A -= B
  count += 1
print(count)

Submission status: Accepted

Solution code:
import math

def main():
    H,A = list(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
energy = H

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

Submission status: Accepted

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

for i in range(10001):
    if A-B*i<=0:
        print(i)
        break

Submission status: Accepted

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

n = H // A
m = H % A

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy

# 最大公約数
def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z

# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す
def bfs(SS, x, y, H, W):#入力(座標系(迷路), x, y, xの端, yの端)
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" #探索した場所は探索できないようにする
    for i in range(4): #このforで上下左右を調べてる
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      #print(tempx, tempy, xytuple[2])
      #print(S)
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" #探索した場所は探索できないようにする
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      #print(q)
  return mlength

def brick(a,n,m,N):#ABC 148
  #n番目以降にmがあるか調べる
  if not m in a[n:]:
    print(N-(m-1))
  else:
    #b = copy.deepcopy(a)
    brick(a,a[n:].index(m),m+1,N)

#X = str(input()).split()
#a = [int(x) for x in input().split()]
HA = str(input()).split()
H = int(HA[0])
A = int(HA[1])
count = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

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:
#!python3.4.3
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:
HA = input().split()
H = int(HA[0])
A = int(HA[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = -(-H // A)

print(ans)

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())
q,mod = divmod(H,A)
ans = q
if(mod!=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
line = input().split(' ')
M = int(line[0])
N = int(line[1])
print(math.ceil(M/N))

Submission status: Accepted

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

import math

print(int(math.ceil(cnt)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n,k,*a=map(int,open(0).read().split())

# h = int(input())
h, k = [int(x) for x in input().split()]
# k = int(input())

# ヨコ
# m = [int(x) for x in input().split()]

# タテ
# m = [int(input()) for _ in range(N)]

if h < k:
  print(1)

elif h/k == h//k:
  print(h//k)

else:
  print(h//k+1)

Submission status: Accepted

Solution code:
H, A = 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:
h,a = input().split()
i = 0

while True:
    h= int(h) - int(a)
    i = i + 1
    if(int(h)<=0):
        break
        
print(i)

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

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

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

Submission status: Accepted

Solution code:
import math


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

b = H // A
c = H % A
if not c == 0:
    b += 1

print(b)

Submission status: Accepted

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

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 = input().split(" ")
a =[int(i) for i in a]
H = a[0]
A = a[1]
sums = 0
while H >0:
    H = H - A
    sums +=1
print(sums)

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
import sys
import math
read = sys.stdin.buffer.read #全てまとめて文字列として格納
readline = sys.stdin.buffer.readline # 一行読む
readlines = sys.stdin.buffer.readlines # 全行リストに格納

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

print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

print(math.ceil(n / h))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,A = list(map(int, input().split()))
i = 0
while(True):
    i += 1
    if A * i >= H:
        break

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

[H, A] = map(int, raw_input().split())

print int(math.ceil(1.0*H/A))

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

cnt = 0
hp = h
for _ in range(h):
    hp -= a
    cnt += 1
    if hp <= 0:
        break

print(cnt)

Submission status: Accepted

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

cnt = 0
while True:
    h -= a
    cnt += 1
    if h <= 0:
        break

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    h, n = get_list()
    print((h+n-1)//n)



''' Pythonista fLite 1.1 '''
import sys
#from collections import defaultdict, Counter
#from bisect import bisect_left, bisect_right
#from functools import reduce
#import math
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()
#[main() for _ in range(int(input()))]
print(*out, sep='\n')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N,M = two_int()

temp = N/M

if temp.is_integer():
    print(int(temp))
else:
    print(int(temp)+1)

Submission status: Accepted

Solution code:
#coding:utf-8

import math

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

print(math.ceil(a / b))

Submission status: Accepted

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

print(-(-H//A))

Submission status: Accepted

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

Submission status: Accepted

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

if (x[0]/x[1]).is_integer():
    print(int(x[0]/x[1]))
else:
    print(int(x[0]/x[1])+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

i, m = divmod(H, A)

if m != 0:
    i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, m = LI()
    if n % m == 0:
        print(n // m)
    else:
        print(n // m + 1)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
data = input().split()
strengh = int(data[0])
attack = int(data[1])
count = 0

while strengh > 0:
    strengh -= attack
    count += 1

print(count)

Submission status: Accepted

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

ans = h//a

if h%a != 0:
    ans += 1

print(ans)

Submission status: Accepted

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

import pdb
import sys
F = sys.stdin

H,A = map(int,F.readline().split())

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

print(ans)

Submission status: Accepted

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

ans = h // a
ama = h % a

if ama != 0:
  ans += 1
print(ans)

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

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

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:

def main():
    h, a = map(int, input().split())
    result = 0
    while True:
        h = h - a
        result += 1
        if h <= 0:
            break
    print(result)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

def main():
    H,A = map(int, input().split())
    if(float.is_integer(H/A)):
        res = int(H/A)
    else:
        res = int(H/A)+1
    print(res)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

ans = N // A

if N%A>0:
	ans += 1

print(ans)

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


health, attack = map(int, input().split())
m = health % attack
d = int(health / attack)

if m != 0:
    d += 1
print(d)

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (h, a) = [int(e) for e in lines[0].split(" ")]

    return (h, a)


def solve(h, a):

    result = h//a
    if h % a != 0:
        result = result + 1


    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections
import itertools as it
import math
import numpy as np

# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()
H, A = map(int, input().split())

c = 0
for i in range(1000000000):
    if H <= 0:
        break
    else:
        c += 1
        H -= A

print(c)

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

Solution code:
import math

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

num = a/b
print(math.ceil(num))

Submission status: Accepted

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

Submission status: Accepted

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

m = h % a

n = h // a 
if m:
    n += 1
print(n)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
#S = str(input())
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()))
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 ))

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

Submission status: Accepted

Solution code:
[H,A] = [int(s) for s in input().rstrip().split(' ')]
if H % A == 0:
    print(H // A)
else:
    print(H // A + 1)

Submission status: Accepted

Solution code:
import math

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

time=math.ceil(H/A)

print(time)

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

c=0
while a>0:
    a-=b
    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:
x, y = list(map(int, input().split()))

print((x+y-1)//y)

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    
    H, A = map(int, input().split())

    d = H // A
    r = H % A

    if r != 0:
        print(d + 1)
    else:
        print(d)


if __name__ == "__main__":
    resolve()

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

P = [int(p) for p in input().split()]
H = P[0]
A = P[1]

print(math.ceil(H/A))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():
    h, a = map(int, input().split(" "))
    atack = h // a
    if atack * a < h:
        atack += 1
    print(atack)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ceil(h / a))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import numpy as np

HA=np.array(input().split(" "),dtype=np.int32)
H=HA[0]
A=HA[1]

print(int(np.ceil(H/A)))

Submission status: Accepted

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

print(math.ceil(h / a))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 20:52:57 2020

@author: over-
"""

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

Submission status: Accepted

Solution code:
import numpy

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

if int(data[0] / data[1]) == (data[0] / data[1]):
  a = int(data[0] / data[1])
else:
  a = int(data[0] / data[1]) + 1


print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

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

    print(res)



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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

C = H //A

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

Submission status: Accepted

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

K = H // A
L = H % A

if L == 0:
    print(K)
else:
    print(K + 1)

Submission status: Accepted

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

print(-(-h // a))

Submission status: Accepted

Solution code:
# coding: utf-8
from fractions import gcd 
from functools import reduce
# my functions here!
def pin(type=int):
    return map(type,input().split())
#input
H,A =pin()
#solution
#output
print((H+A-1)//A )

Submission status: Accepted

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


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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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