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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())


H,A=LI()

ans = math.ceil(H / A)

print(ans)

Submission status: Accepted

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

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

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

#h = int(input())
#a = int(input())

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(-(-H//A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#Take input separated by space(?)
h,a = map(int, input().split())

#Divide, just round off and add 1 if decimal
hit = round(h//a)

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

print(hit)

Submission status: Accepted

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

Submission status: Accepted

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

r1 = n1 // n2
if n1 % n2 != 0:
    r1 += 1

print(r1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=0

for i in range(H//A+1):
    if H >0:
        H=H-A
        ans+=1
    else:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

div, mod = divmod(h, a)

if mod > 0:
    print(div + 1)
else:
    print(div)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

Submission status: Accepted

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

d, m = divmod(H, A)

d += [0, 1][m != 0]
print(d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

h,a=lmp()
print((h-1)//a+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-1)//A)

Submission status: Accepted

Solution code:
#Macで実行する時
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

c = int(a/b)

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    ans = str(math.ceil(hp / attack))
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math


def main():
    hp, attack = (int(i) for i in input().rstrip().split(' '))
    print(str(math.ceil(hp / attack)))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())
T = 0
while H > 0:
  H -= A
  T += 1
print(T)

Submission status: Accepted

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

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

Submission status: Accepted

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

b = h/a

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

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

print(abs(-1*H//A))

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0
while 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:
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())
res = H//A
if H%A != 0 :
    res=res+1
print("{}".format(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

t = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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:
print(-eval(input().replace(' ','//-')))

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:
if __name__ == '__main__':

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

Submission status: Accepted

Solution code:
h,a= (int(a) for a in 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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import sys

def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]


def main():
    H, A = MI()


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


if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
div,mod = divmod(H,A)
print(div if mod==0 else div+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    #n = int(stdin.readline().rstrip())
    h,a = map(int, stdin.readline().rstrip().split())
    #l = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    ans = h // a
    if h%a == 0:
        print(ans)
    else:
        print(ans + 1)

if __name__ == '__main__':
    solve()

Submission status: Accepted

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


print(i)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-06-27 15:30:40 +0900
# LastModified: 2020-06-27 15:33:43 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math # 切上のceilを使う


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

print(math.ceil(h / a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


h, a = map(int, input().split())
ans = h//a + (h%a!=0)
print(ans)

Submission status: Accepted

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

t = 0
for i in range(H):
    H -= A
    t += 1
    if H<=0:
        print(t)
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [int(i) for i in input("").split(" ")]
print((h+a-1)//a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if hp % dmg == 0: print(int(hp//dmg))
else: print(int(hp//dmg) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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 sys
H, A = map(int, input().split())
count = 0
while True:
  H = H - A
  count += 1
  if H <= 0:
    print(count)
    sys.exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

ans = math.ceil(H / A)

print(ans)

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:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    print(math.ceil(N/K))





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

Submission status: Accepted

Solution code:
# 153 A

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

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

if h != 0:
    num += 1

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
print(H//A + 1 if H/A != H//A else 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 = (int(x) for x in input().split())
dm = divmod(H,A)
if dm[1] == 0:
	print(dm[0])
else:
	print(dm[0]+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

print(math.ceil(a/b))

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 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 = h//a
if h % a != 0:
    ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
h,a = map(int, input().split())
an, bn = divmod(h,a)
if bn == 0:
    print(an)
else:
    print(an+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:
#<ABC153>
#<A>
import math
H, A = map(int,input().split())
print(math.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())
for i in range(1, 2*(10**4)):
  H -= A
  if H <= 0:
    break
print(i)

Submission status: Accepted

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

y = h // a

if (h % a) > 0:
    y = y + 1

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

cont=0

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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