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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if h < a:
     ans = 1
elif 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())

if h < a:
     ans = 1
else:
    ans = h/a

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if (b!=0)and(H>A):
  b+=1

print(a)

Submission status: Wrong Answer

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

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

if b==2:
  b+=1

print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(num)

Submission status: Wrong Answer

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

if H > A:
    a = round(H/A)
    if H%A != 0: a += 1
    print(a)
else:
    print(1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a = round(H/A)
if a != 0: a += 1
print(a)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a = H/A
if a != 0: 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())

print(H // A + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(H//A+1)

Submission status: Wrong Answer

Solution code:
print("Hello")

Submission status: Wrong Answer

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

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)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print((H+1)//A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, M=map(int,input().split())
count=0
X=0
while N >= X:
  X = M * count
  count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N, M=map(int,input().split())
count=1
X=0
while N >= X:
  X = M * count
  count += 1
print(count-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

H, M = map(int, input().split())
print(int((H+M-1))/M)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(10000):
    if i*A <= H:
        i += 1
        count += 1
    else:
        break
print(count)

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

Attack_num = int(H/A) + 1

print(Attack_num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# abc 153
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Wrong Answer

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

print((-h//a))

Submission status: Wrong Answer

Solution code:
H_str, A_str = input().split(' ')

print(int(H_str) // int(A_str) + 1)

Submission status: Wrong Answer

Solution code:
import sys

def main():
    # sys.stdin = open('input153a.txt')
     
    h, a = map(int, input().split())

    print(h // a + 1)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h, a = input().split()
H = int(h)
A = int(a)
ans = 0
for i in range(H):
  if H >= 0:
    ans = ans + 1
    H = H - A
  else:
    break
print(ans)

Submission status: Wrong Answer

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

counter = 0

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

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

Submission status: Wrong Answer

Solution code:

a,b=map(int,input().split())
print(a//b if a>=b else (a//b) +1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
A=10
H=100
count=0

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, H = 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 = 0

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

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

Submission status: Wrong Answer

Solution code:

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,H= map(int, input().split())
count = 0
while H <= 0:
  H -= A
  count+=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())
print(h//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())

n=h/a+1

print (int(n))

Submission status: Wrong Answer

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

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(int((h+0.5)/a))

Submission status: Wrong Answer

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

print(int((h+1)/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if ( 1<= H ) & ( H <= 10000 ):
  if( 1<= A ) & ( A <= 10000 ):
    n = int(H/A) + 1
  else:
    n = 0
else:
  n = 0

print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A=map(int,raw_input().split())
ans=0
for i in range(1,10000):
  H = H-A
  ans += 1
  if H<=0:
    break
print ans

Submission status: Wrong Answer

Solution code:
H,A=map(int,raw_input().split())
ans=1
for i in range(1,10000):
  H = H-A
  if H-A>=0:
    ans += 1
  else:
    break
print ans

Submission status: Wrong Answer

Solution code:
H,A=map(int,raw_input().split())
ans=0
for i in range(1,10000):
  if H-A>=0:
    ans += 1
    H = H-A
  else:
    break
print ans

Submission status: Wrong Answer

Solution code:
H,A=map(int,raw_input().split())
ans=0
for i in range(1,10000):
  if H-A>=0:
    ans += 1
  else:
    break
print ans

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

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

Submission status: Wrong Answer

Solution code:
# = int(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = list(input())
# = [tuple(map(int, input().split())) for _ in range(n)]

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

print(h // a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#output
answer = H // A
if H - H //A > 0:
    answer += 1

print(answer)

Submission status: Wrong Answer

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

"""
name: 153A.py
プログラムの説明
"""

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

    times = a // b +1
    print(times)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

def propare():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))
    A = int(next(tokens))

    solve(H, A)

def solve(H: int, A: int):
    count = 0
    while 1 < H:
        count = count + 1
        H = H - A

    print(count)

    return


 
if __name__ == "__main__":
    propare()

Submission status: Wrong Answer

Solution code:
import sys

def propare():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))
    A = int(next(tokens))

    solve(H, A)

def solve(H: int, A: int):
    count = 0
    while H < 1:
        count = count + 1
        H = H - A

    print(count)

    return


 
if __name__ == "__main__":
    propare()

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)

Submission status: Wrong Answer

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

print((h//a)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
f_i = stdin

H, N = map(int, f_i.readline().split())

C = [10 ** 8] * (H * 2)
C[0] = 0
for line in f_i:
    A, B = map(int, line.split())
    for i, vals in enumerate(zip(C, C[A:]), start=A):
        v1, v2 = vals
        C[i] = min(v1 + B, v2)
        if i > H:
            break

print(min(C[H:]))

Submission status: Wrong Answer

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

if life < float(0.9):
    print(1)
    
else:
    if life - round(life) == 0.5:
        print(round(life-0.5+1))
    
    elif type(life) == float:
        print(round(life)+1)    
    
    else:
        print(round(life))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def win(h,a):
    l=h
    cnt=0
    while(l>=0):
        l=l-a
        cnt+=1
    return cnt
  
h=10
a=4
m=win(h,a)
print(win(h,a))

Submission status: Wrong Answer

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

if life < float(0.9):
    print(1)
    
else:
    if life - round(life) == 0.5:
        print(round(life-0.5+1))
    else:
        print(round(life))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

lines = sys.stdin.readlines()

H, _ = list(map(int, lines[0].split()))
AB = np.array([ np.array(list(map(float, s.split()))) for s in lines[1:] ]).flatten().reshape((-1,2))

ABnorm = AB[:,1] / AB[:, 0]
AB = np.insert(AB, 2, ABnorm, axis=1)
AB = AB[AB[:,0].argsort(), :]
AB = AB[AB[:,2].argsort(), :]


baseAmari = H
minv = -1
syomo = 0
syomo1min = 99999999
for i in range(len(AB)):
  if minv<AB[i, 2]:
    if baseAmari<=int(AB[i,0]):
      syomo += int(AB[i,1])
      break      
    minv = int(AB[i, 2])
    baseAt = baseAmari // int(AB[i,0])
    syomo += baseAt * int(AB[i,1])
    syomo1 = syomo + int(AB[i,1])
    if syomo1min>syomo1:
      syomo1min = syomo1
    baseAmari = baseAmari - baseAt*int(AB[i,0])
    if baseAmari == 0:
      break

if syomo > syomo1min:
  syomo = syomo1min
print(syomo)

Submission status: Wrong Answer

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

print(answer)

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 >= 0):
  H -= A
  count += 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:
def win(h,a):
    l=h
    cnt=0
    while(l>=0):
        l=l-a
        cnt+=1
    return cnt
  
h=10
a=4
print(win(h,a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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-H%A)/A)

Submission status: Wrong Answer

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

n = (int(H)/int(A))
if(float(n)):
    n = round(n)+ 1
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
class Main:
    import math
    s = list(map(int, input().split()))
    h = s[0]
    a = s[1]
    cnt = 0
    if h <= a:
        cnt = 1
        print(cnt)
    else:
        cnt = math.ceil(h/a)

    print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
class Main:
  s = list(map(int, input().split()))
  h = s[0]
  a = s[1]
  cnt = 1
  if h <= a:
    print(cnt)
  else:
    while h > a:
        h -= a
        cnt += 1
  print(cnt)

Submission status: Wrong Answer

Solution code:
import math
H,S = input().split()
H1 = int(H)
S1 = int(S) 
i = 1
temp=0
while(True):
    temp=S*i
    i=i+1
    if(H<=temp):
        break
print(i+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while(a>b) :
    a -= b
    cnt +=1

    if(a <= b):
        print(cnt)
        break

Submission status: Wrong Answer

Solution code:
import math
H,S = input().split()
H1 = int(H)
S1 = int(S) 
N = 0
i=1
N = math.floor(H1/S1)
print(N+1)

Submission status: Wrong Answer

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

n = round((int(H)/int(A)) + 0.1)

print(n)

Submission status: Wrong Answer

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

n = round((int(H)/int(A)) + 0.5)

print(n)

Submission status: Wrong Answer

Solution code:
list = input().split(' ')
num = 0
a = int(list[1])
b = int(list[0])
while a > 0:
  a -= b
  num += 1
  
print(num)

Submission status: Wrong Answer

Solution code:
atcoder = input().split()

H = int(atcoder[0])
A = int(atcoder[1])

print(H // A)

Submission status: Wrong Answer

Solution code:
n, m = [int(x) for x in input().split()]
k = 0
if m>n:
    print(1)
else:
    print(n//m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count=0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input().split()
de = int(s[0])
count = 0

while de >= 0:
    de = int(de) - int(s[1])
    # print(de)
    count += 1

print(count)

Submission status: Wrong Answer

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

count=0

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

Submission status: Wrong Answer

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

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:
input_list = list(map(int, input().split()))
hp = input_list[0]
atk = input_list[1]
times = int(hp / atk) + 1
print(times)

Submission status: Wrong Answer

Solution code:
firstinput = input("")
firstinputsplit = firstinput.split(" ")
H = int(firstinputsplit[0])
N = int(firstinputsplit[1])
kill = 0
if H < 10000 and N < 10000:
    while H > 0:
        H = H - N
        kill = kill + 1
    print(kill)
else:
    print("")

Submission status: Wrong Answer

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

if H > A:
    print(H//A+1)
else:
    print(1)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a//b+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s = input().split()

ans = int(s[0]) // int(s[1]) + 1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
H, A = list(map(int, input().split()))
if A == 1 or H == A:
  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 = input().split()
H = int(H)
A = int(A)

print(H % A + 1)

Submission status: Wrong Answer

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

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H >= 0:
        H -= A
        cnt += 1
    return cnt

print(attack(l))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

def attack(l):
    H = l[0]
    A = l[1]
    cnt = 0
    while H >= 0:
        H = H - A
        cnt += 1
    return cnt

print(attack(l))