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

print(h//a + 1)

Submission status: Wrong Answer

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

ans=(H+N)//N
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)

Submission status: Wrong Answer

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

print(cnt)

Submission status: Wrong Answer

Solution code:
str = input()
nums  = str.split()
if nums[0] == "0" or nums[1] == "0":
     print("error")
else:
    turn = float(nums[0]) / float(nums[1]) + 0.9
    print(int(turn))

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)

Submission status: Wrong Answer

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


if H/A % 2 == 0:
    count_e = H/A
    print(int(count_e))
    
elif int(H/A) % 2 == 1:
    count_o = int(H/A) + 1
    print(count_o)
    
elif H < A:
    count_u =  1
    print(count_u)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
H, A = rii()
 
print(H // A)

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

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 = list(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())
ans = int(H/A) + int(H%A)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
if a%b==0:
  print(a/b)
else:
  print(int(a/b)+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:
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 True:
    if h > 0:
        h = h - a
        ans += 0
    else:
        print(ans)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
a,b=list(map(int,input().split()))
count=0
while (a<0):
  count+=1
  a-=b
print(count)

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split()))
c = a % b
my_result = (a + c) / b
print(int(my_result))

Submission status: Wrong Answer

Solution code:
H,A=map(int,input().split())
AP=0
for i in range(10000):
  AP=A*i
  if AP>=H:
    print(i)
    break

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

Solution code:
battle=input()
b=battle.split(" ")
b=list(map(int, b))

hits = round(b[0] / b[1])

if b[0] % b[1] != 0:
    hits = hits + 1
if b[0] == 0:
    hits = 1

print(hits)

Submission status: Wrong Answer

Solution code:
battle=input()
b=battle.split(" ")
b=list(map(int, b))

hits = 0

if b[0] % b[1] == 0:
    hits = round(b[0] / b[1])
else:
    hits = round(b[0] / b[1])+1

print(hits)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans=0

for i in range(H//A):
    ans+=1
print(ans+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
  cnt += 1
  h -= a

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A=map(int,input().split())
B=0
C=0
for i in range(0,H):
    B=B+A
    if B<=H:
        C=C+1
        print(C)
        break
    else:
        C=C+1

Submission status: Wrong Answer

Solution code:
H,A=map(int,input().split())
B=0
C=0
for i in range(0,H):
    B=B+A
    if B<=H:
        C=C+1
        print(C)
    else:
        C=C+1

Submission status: Wrong Answer

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

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

print(i)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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


print(i)

Submission status: Wrong Answer

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


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


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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,A=input().split()
H,A=int(H),int(A)
if max(A,H)<=10000 and min(A,H)>=1:
    print((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())
print((H-0.5)//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())
division = h // a 

if h > a and a != 1:
  print(int(division+1))
elif h > a and a == 1:
  print(division)
elif h < a or h == a:
  print(1)

Submission status: Wrong Answer

Solution code:
h, a = map(int, input().split())
division = h // a 
if h > a and a != 1:
  print(int(division+1))
elif h > a and a == 1:
  print(division)
elif h < a or h == a:
  print(h//a)

Submission status: Wrong Answer

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

if h > a and a != 1:
  print(int(division+1))
elif h > a and a == 1:
  print(division)
elif h < a or h == a:
  print(h/a)

Submission status: Wrong Answer

Solution code:
h, a = map(int, input().split())
division = h // a 
if h > a and a != 1:
  print(int(division+1))
elif h > a and a == 1:
  print(division)
elif h < a or h == a:
  print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a//b)

Submission status: Wrong Answer

Solution code:
import math 
H,A = map(int,input().split())
math.ceil(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())
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%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:
print((lambda x: x[0]//x[1])(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
H,A=map(int,input().split())
ans=(H-0.5)//A+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())

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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())
# U = input()
ans = 0

# print((a-1,b) if (s[0]==u) else a,b-1)
while True:
    h -= a
    if h<0:
        break
    ans+=1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

else:
  x=h//a
  print(x+1)

Submission status: Wrong Answer

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

else:
  x=h//a
  print(x+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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())
import math
print(math.ceil(H//A))

Submission status: Wrong Answer

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

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

print(h//a + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k, *h = map(int,open(0).read().split())
h.sort()
if n<=k:
  print(0)
else:
  a = h[0:n-k]
  print(sum(a))

Submission status: Wrong Answer

Solution code:
n,k, *h = map(int,open(0).read().split())
h.sort()
if n<=k:
  print(0)
else:
  a = h[:n-k]
  print(sum(a))

Submission status: Wrong Answer

Solution code:
n,k, *h = map(int,open(0).read().split())
h.sort 
if n<=k:
  print(0)
else:
  a = h[:n-k]
  print(sum(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(H//A + 1)

Submission status: Wrong Answer

Solution code:
H = 80
A = 4
H / A

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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())
for i in range(a):
  if h <= a * i:
    print(i)

Submission status: Wrong Answer

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

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

if h<a:
  print(1)
else:
  print(h//a +1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
y=0
if a[1]>a[0]:print(a[0])


else:
    for i in range(a[0]):
        while(a[0]>0):
            a[0] = a[0]-a[1]
            y+=1
        break
    print(y)

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
y=0
if a[1]>a[0]:print(a[0])

else:
    for i in range(a[0]):
        a[0] = a[0]-a[1]
        y+=1
        if a[0]<=0:
            print(y)
            break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i=h//a

print(int(i+1))

Submission status: Wrong Answer

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

i=h//a

print(i+1)

Submission status: Wrong Answer

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

i=h%a

t=h-i
print(int(t/a+1))

Submission status: Wrong Answer

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

i=h%a

t=(h-i)/a

print(t+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H, A = list(map(int,readline().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:
  (h // a +1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))


H,A=input2()
num=H//A+1
print(num)



	

# 逆ポーランド記法
# ８クイーン
# 単純換字暗号

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a != b:

    if b == 1:
        print(a)
    else:
        print(a//b+1)
elif a == b:
    print(1)

Submission status: Wrong Answer

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

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

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

ans = H // A + (H % A) * 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

H = 10000
A = 1

answer = math.ceil(H / A)

print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = h//a
print(t+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

def resolve():

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

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

    if sum(A)>=H:
        print("Yes")
    else:
        print('No')


import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """10 3
4 5 6"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """20 3
4 5 6"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """210 5
31 41 59 26 53"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_4(self):
        input = """211 5
31 41 59 26 53"""
        output = """No"""
        self.assertIO(input, output)

if __name__ == "__main__":
    unittest.main()

Submission status: Wrong Answer

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