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: Wrong Answer

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  h, a = map(int, readline().split())
  print(h//a+1)
  
  
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
n = input()
(h, a) = n.split()
for i in range(1000):
    if int(h) <= int(a) * i:
        print(int(i))
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
base = input().split()
h = int(base[0])
a = int(base[1])
print((h//a)+1)

Submission status: Wrong Answer

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

while H > 0:
    H  -= A

print(H)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((h//a)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N[0]//N[1] +1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
h,a = iim()


print((h+1)//a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A=map(int,input().split())
count=1
for i in range(H):
  if 0<H:
    H-A
    count+=1
    H-=A

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = h/a

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

Submission status: Wrong Answer

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

n = 0
while h <= 0 :
  h - a
  n += 1
  
print(n)

Submission status: Wrong Answer

Solution code:
import math
n=input().split()
a=int(n[0])
b=int(n[1])
if a%b==0:
    print(a/b)
else:
   print(a//b+1)

Submission status: Wrong Answer

Solution code:
import math
n=input().split()
a=int(n[0])
b=int(n[1])
c=a/b
if a%b==0:
    print(a/b)
else:
   print(math.ceil(c))

Submission status: Wrong Answer

Solution code:
import  math
n=input().split()
a=int(n[0])
b=int(n[1])
if a%b==0:
    print(a/b)
else:
   print(math.ceil(a/b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
h, a = map(int,input().split())
num = math.floor(h/a)+1

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

x = 0
while True:
  H = H - A
  if H <= 0:
    break
  if H > 0:
    x += 1
print(x)

Submission status: Wrong Answer

Solution code:

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

    if h <= a:
        print(1)

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
H, A = map(int,input().split())
a = "EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE"
for i in a:
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

num  = H // A
remain = H % A

if remain > 0:
    out = num + 1
else:
    out = num 

print(out)

Submission status: Wrong Answer

Solution code:

##i18n##
a  = input().split()
H = int(a[0])
A = int(a[1])

num  = H // A
remain = H % A

if A >= H:
  out = 1
else:
 if remain > 0:
    out = num + 1
 else:
    out = num 

print(num)

Submission status: Wrong Answer

Solution code:

##i18n##
a  = input().split()
H = int(a[0])
A = int(a[1])

num  = H // A
remain = H % A
if remain >= 0:
    out = num + 1
else:
    out = num 

print(num)

Submission status: Wrong Answer

Solution code:

##i18n##
a  = input().split()
H = int(a[0])
A = int(a[1])

num  = H // A
remain = H % A
if remain != 0:
    out = num + 1
else:
    out = num 

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while True:
    if H < A:
        cnt += 1
        break
    else:
        H = H - A
        cnt += 1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(max(h // r + (1 if h // r == 0 else 0), 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(i)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
H,A = map(int,input().split())
if H % A >0:
  print(math.ceil(H/A))
else: 
  print(H/A)

Submission status: Wrong Answer

Solution code:
def main():
    H,A = list(map(int,input().split()))
    # H: 体力
    # A: 攻撃
    count = 0
    for _ in range(pow(10,4)):
        H -= A
        count += 1
        if (H < 0):
            break
    print(count)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    H,A = list(map(int,input().split()))
    # H: 体力
    # A: 攻撃
    count = 0
    for _ in range(H):
        H -= A
        count += 1
        if (H < 0):
            break
    print(count)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input1 = list(map(int,input().split()))
H = input1[0]
A = input1[1]
print(int(H % A) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

def main(health, attack):
    total = health / attack
    return math.ceil(total)


if __name__ == '__main__':
    main(h, a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from fractions import gcd
from itertools import permutations, combinations, accumulate
from collections import deque
from heapq import heappush, heappop, heapify
import math

input = sys.stdin.readline
sys.setrecursionlimit(10**6)

MOD = 10**9 + 7

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



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0
while hp >= 0:
    hp -= attack
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import floor
h,a = map(int,input().split())
print(floor(h//a)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ceil(h//a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = 1
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(2 * 10**6):
  continue

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def attack( K, H):
  cnt=0
  while(H>0):
    H=H-K
    cnt=cnt+1

  return cnt

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = h//a + 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()
H = int(get(text,2)[0])
A = int(get(text,2)[1])

print(H//A+1)

Submission status: Wrong Answer

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

val=n/m+0.5
print(int(val))

Submission status: Wrong Answer

Solution code:
H, A = map(int, input().split())
times, mod = divmod(H, A)
if mod != 0:
    times += times + 1
print(times)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
ans=float
ans=n/m
print(int(ans)+1)

Submission status: Wrong Answer

Solution code:
H,A = map(int,input().split())
 
if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False
 
count = 0
while H >= 0:
  count += 1
  H -= A
 
print(count)

Submission status: Wrong Answer

Solution code:
H,A = (int(x) for x in input().split())
 
if not H <= 10^4 and H >= 1:
  False
if not A <= 10^4 and H >= 1:
  False
 
count = 0
while H >= 0:
  count += 1
  H -= A
 
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A > H:
  print(1)
  
else:
  answer = H // A
  print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
In = input().split()
h = int(In[0])
a = int(In[1])
if a < h:
    if (h % a) != 0:
        print(h % a + 1)
    else:
        print(1)
else:
    print(1)

Submission status: Wrong Answer

Solution code:
N,M = (int(x) for x in input().split())
 
K = N/M
if N < M:
  print(1)
elif N%M == 0:
  print(K)
else:
  print(K+1)

Submission status: Wrong Answer

Solution code:
N,M = (int(x) for x in input().split())

K = N/M

print(K+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = 0

li = input("入力してね").split()
li = [int(i) for i in li]

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

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

print(H//A+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def monster(h,a):
  c = 0
  while h>0:
    h = h - a
    c += 1
  return c

Submission status: Wrong Answer

Solution code:
def monster(a,h):
  c = 0
  while h>0:
    h = h - a
    c += 1
  return c

Submission status: Wrong Answer

Solution code:
from sys import stdin

N,K=map(int,stdin.readline().rstrip().split())
H=sorted(list(map(int,stdin.readline().rstrip().split())))

if N-K<=0:
  print(0)
else:
  del H[N-K:]
  print(sum(H))

Submission status: Wrong Answer

Solution code:
value = input().split(' ')
hp = int(value[0])
at = int(value[1])
for i in range(10000):
  if hp > 0:
    hp = hp - at
  else:
    print(i)
    break

Submission status: Wrong Answer

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

if h%a == 0:
    print(h%a)

else:
    print(h%a+1)

Submission status: Wrong Answer

Solution code:
value = input().split(' ')
hp = int(value[0])
at = int(value[1])
for index in range(hp):
  hp = hp - at
  if hp <= 0:
    print(index)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(H/A)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(Y)

Submission status: Wrong Answer

Solution code:
H = 10
A = 2

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
c,d=(int(x) for x in input().split())
a=c//d+1
print(a)

Submission status: Wrong Answer

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

print(H%A+1)

Submission status: Wrong Answer

Solution code:
from sys import stdin

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

Submission status: Wrong Answer

Solution code:
import math

# スペース区切りの整数の入力
H, A = map(int, input().split())
n = math.floor(H/A)


# 出力
print(n)

Submission status: Wrong Answer

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

z = x/y
if(x%y==0):
  print(z)
else:
  print(z+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.floor(h/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def serveal_monter(input):
  H, A = input.split(" ")
  H = int(H)
  A = int(A)
  if H % A > 0:
    return (H // A) + 1
  return H // A

Submission status: Wrong Answer

Solution code:
def serveal_monter(input):
  H, A = input.split(" ")
  if H % A > 0:
    return (H // A) + 1
  return H // A

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_val = input().split()
print(1)

Submission status: Wrong Answer

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

print(h // a + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
 
for line in sys.stdin:
    h, a = list(map(lambda x: int(x), line.split()))
    print((h // a) + 1)

Submission status: Wrong Answer

Solution code:
import sys
 
for line in sys.stdin:
    h, a = list(map(lambda x: int(x), line.split()))
    print(h // a)

Submission status: Wrong Answer

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

print(int((H + A) / A))

Submission status: Wrong Answer

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

print(math.ceil(a / h))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def howmany(n,m):
        if n%m ==0:
            return n/m
        else:
            return n//m+1