TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):
h,n=map(int,input().split())
a=map(int,input().split())
s=sum(a)

if s>=h:
    print("YES")
else:
    print("NO")

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(float, input().split())
attack_list = list(map(float, input().split()))

if(a <= sum(attack_list)):
    print("Yes")
else:
    print("No")

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h, a = map(int, input().split())

times = h // a
if h % a != 0 :
    times = 1
print(times)

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H,A=map(int,input().split())
ans=round(H/A)
print(ans)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, N = map(int, input().split())
move = [int(a) for a in map(int, input().split())]

smove = sum(move)
if smove >= H:
    print("Yes")
else:
    print("No")

from math import ceil

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h, a = map(int, input())

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


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

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

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

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


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

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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()

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 0 < H:
        count = count + 1
        H = H - A

    print(count)

    return


 
if __name__ == "__main__":
    propare()

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math

line = input()
numList = [int(num) for num in line.split(' ')]
monsterHP,servalA = numList[0].numList[1]
print(math.ceil(monsterHP/servalA))


import math
 
line = input()
numList = [int(num) for num in line.split(' ')]
monsterHP,servalA = numList[0],numList[1]
print(math.ceil(monsterHP/servalA))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A=map(int,input().split())

count=0

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

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

count=0

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
list = input().split(' ')
num = 0
a = int(list[1])
b = int(list[0])
while a > 0:
  a -= b
  num += 1
  
print(num)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a=map(int,input().split())
h-=0.01
print(h//a+1)

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a =map(int,input().split())
if h % a == 0:
  print(h // a)
else:
  (h // a +1)






n,a = map(int,input())
if n%a == 0:
  print(n//a)
else:
  print(n//a +1)

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

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

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

ans = 0

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

print(ans)



Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H , A = map(int, input().split())
ans = 0
while(H >= 0):
  H = H - A
  ans + 1
print(ans)

h,a = tuple(map(int,input().rstrip().split()))
print((h+a-1)//a)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a = map(int,input().split())
print(h//a + (1-int(h%a==0))


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


h,a = map(int,input())
print(h//a + (1-(h%a==0))

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A = map(int,input().split())
print(H//A)

H,A = map(int,input().split())
div,mod = divmod(H,A)
if mod==0:
    print(div)
else:
    print(div+1)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math

h, n = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += a[i]

if sum >= h:
    print('Yes')
else:
    print('No')


h, n = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    sum += a[i]

if sum >= h:
    print('Yes')
else:
    print('No')


import math
h, a = map(int,input().split())
num = math.ceil(h/a)

print(num)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import numpy as np

s = input().split()
H = int(s[0])
N = int(s[1])

m = np.array([list(map(int, input().split())) for i in range(N)])
A = m[:, 0]
B = m[:, 1]

def func(H, m):
    A = m[:, 0]
    B = m[:, 1]

    if H < A[i]:
        i = np.argmin((H // A) * B)
        return (H // A[i]) * B[i]
    else:
        i = np.argmax(A / B)
        H_next = H - (H // A[i]) * B[i] 
        return (H // A[i]) * B[i] + func(H_next)
        
        func(H_next, )
        j = np.argmin(B)
        print((H // A[i])*B[i] + B[j])

print(func(H, m))

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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N,M = map(int,input().split())
i=1
for(i in range(N)):
    He=N*i
    if(H<He):
      break
    else:
      continue
print(i)

import math
H,S = map(int,input().split())
i=1
if(H<=S):
  print(1)
elif(H>S):
  N = math.floor(H/S)
print(N)

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

i = 0

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

print(i)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A = map(int, input().split())
cnt = 0
while(H):
  H -= A
  cnt += 1

print(cnt)

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

Verdicts: Time Limit Exceeded

Accepted
Problem: 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.

Submission attempts (in order):
'''
211 5
31 41 59 26 53
'''
power, moves = [int(x) for x in input().split()]
powers = sum([int(x) for x in input().split()])
print(["No","Yes"][powers >= power])

H, A = [int(x) for x in input().split()]
print( (H // A ) + (H % A > 0))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math

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

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

import math

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

print (math.ceil(H / A))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, A = int(input().split())

ans = -(-H // A)

print(ans)

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

ans = -(-H // A)

print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input())
n = (H-1)//A + 1
print(n)

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())

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


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

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H,A=int(input())
  
print((H // A)+1)

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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())
print((H + A - 1) / A)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int,input().split())
N = list(map(int,input().split()))
print("Yes" if sum(N) >= a else "No")

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h = int(input())
count = 0
def dfs(h):
    global count
    count += 1
    if h == 1:
        quit()
    else:
            dfs(h//2)
            dfs(h//2)

dfs(h)
print(count)

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

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

print(count)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())

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

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

if H % A != 0:
  print(H//A)
  
elif H % A == 0:
  print(H/A)

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math

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

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

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


import math

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

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

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b=map(int,input().split())
c=a%b
if c==0:
  print(a/b)
else:
  print(a/b+1)

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, A = int(input().split())
H = int(H)
A = int(A)
cnt=1
while H-A>0:
	H=H-A
    cnt=cnt+1
print(cnt)

a, b = input().split()
print((a+b-1)//b)

a,b = input().split()
##print(type(a))
a = int (a)
b = int(b)
cnt = 1 
while a - b > 0:
    a=a-b
    cnt = cnt + 1
print(cnt)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A=map(int,input().split())
count=1
if H%N==0:
  for i in range(H):
    if 0<H:
      H-A
      count+=1
      H-=A
  print(count)
else:
  for i in range(H):
    if 0<H:
      H-A
      count+=1
      H-=A
  print(count+1)

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

print(count)

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a = map(int, input().split())

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a=map(int, input())
print(h//a+1)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h,n = map(int,input().split())
list1 = list(map(int,input().split()))

if h-sum(list1)<=0:
    print('Yes')
else:
    print('No')

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

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

print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())

while H > 0:
    H  -= A

print(H)

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

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

print(c)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())
print(int(H/A))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
class Main:
    import math
    H = int(input())
    if H == 1:
        print(1)
    else:
        cnt = int(math.log(H, 2))
        num = 0
        for i in range(cnt+1):
            num += 2 ** i
            print(num)


class Main:
    import math
    H = int(input())
    if H == 1:
        print(1)
    else:
        cnt = int(math.log(H, 2))
        num = 0
        for i in range(cnt+1):
            num += 2 ** i
    print(num)

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

    else:
        cnt = 1
    print(cnt)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A = map(int,input().split())
answer = H // A
if answer == 0:
	answer += 1
print(answer)

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

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

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


Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,N=map(int,input().split())
A=[int(x) for x in input().split()]
if sum(A)>=H:
    print('Yes')
else:
    print('No')

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

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

H,N=map(int,input().split())
A=map(int,input().split())
if sum(A)>=H:
    print('Yes')
else:
    print('No')

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


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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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())
  

def main():
    n, k = [int(i) for i in input().split()]
    num = [int(i) for  i in input().split()]
    if k >= n:
        return 0
    else:
        l = sorted(num)
        return sum(l[0:n-k])
print(main())


def main():
    n, k = [int(i) for i in input().split()]
    num = [int(i) for  i in input().split()]
    sorted(num)
    del num[-k:]
    print(sum(num))
main()


def main():
    n, k = [int(i) for i in input().split()]
    num = [int(i) for  i in input().split()]
    if k >= n:
        return 0
    else:
        num = sorted(num)
        return sum(num[0:n-k])
print(main())


def main():
    n, k = [int(i) for i in input().split()]
    num = [int(i) for  i in input().split()]
    if k >= n:
        return 0
    else:
        l = sorted(num)
        return sum(l[:-k])
print(main())


def main():
    num = [int(i) for i in input().split()]
    h = num[0]
    a = num[1]
    return attack(h, a)

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

print(main())


Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h,a = map(int,input().split())

print(h // a)

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
tmp = input().split(" ")

HP = int(tmp[0])
attack = int(tmp[1])

print(math.ceil(HP/attack))

import math
tmp = input().split(" ")
 
HP = int(tmp[0])
attack = int(tmp[1])
 
print(math.ceil(HP/attack))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n, k = map(int, input().split())
h = list(map(int, input().split()))

h.sort()
for i in range(k):
    h.pop()
    if len(h) == 0:
        break
print(0 if len(h) == 0 else sum(h))

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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H , A = input().split()
H , A = int(H), int(A)
answer = H // A
if H % A == 0:
    print(answer)
else:
    print(anser + 1)

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, A = map(int, input().split())
n = H+A-1//A
print(n)

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

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


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h, a = map(int, input())

print(h//a + h%a)


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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h,a = map(int,input().split())

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


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

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=list(map(int,input()))
count=0
while (a<0):
  count+=1
  a-=b
print(count)
  

a,b=list(map(int,input().split()))
count=0
while (a<0):
  count+=1
  a-=b
print(count)
  

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a=map(int,input(),split())

n=h/a+1

print (int(n))

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H,A = map(int,input().split())
print(--H//A)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split()  ) 

result=0

if a % b <>0:
    result += 1 

result += a // b 
print(result)

#################



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

result=0

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

result += a // b 
print(result)

#####################



Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A=map(int,input().split());q=H//A;mod=H%A;print(q+mod)

H,A=map(int,input().split());q=H//A;mod=H%A;print(q+min(mod, 1))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h,a=map(int,input().split())
print(h//a if h%a+==0 else (h//a)+1)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h, a = map(int,input().split())


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

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

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


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

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


import math

n, d, a = map(int,input().split())
xh = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
    x,h = map(int,input().split())
    xh[i] = [x,h]

num = 0
xh.sort(key=lambda xh:xh[0])

dam = [0]*n
for i in range(n):
    res = xh[i][1]-dam[i]
    pos = xh[i][0]
    if res > 0:
        nat = math.ceil(res/a)
        num += nat
        for j in range(i+1,n):
            if xh[j][0]-d <= pos + d:
                dam[j] += a*nat
            else:
                break
    print(dam)
print(num)


import numpy as np

h, n = map(int,input().split())
a = np.zeros(n, dtype = int)
b = np.zeros(n, dtype = int)
for i in range(n):
    a[i], b[i] = map(int,input().split())

dp = np.zeros(10001, dtype = int)

for i in range(10001):
    dp[i] = (dp[i-a]+b).min()

print(dp[h])


h, n = map(int,input().split())
a = list(input().split())
for i in n:
    h -= int(a[i])

if h > 0:
    print('No')
else:
    print("Yes")


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

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


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h,a = map(int,input().split())

ans=h//a
if(h%a!=0):
    ans++
print(ans)


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

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

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, A = input().split() 

import math

print(math.ceil(H/A))

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

import math

print(math.ceil(H/A))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
from collections import deque 
import math
n, d, a = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
l.sort(key = lambda x:x[0])
cnt = 0
queue = deque()
sum_bomb = 0
for i in range(n):
    while len(queue) != 0 and queue[0][0]<l[i][0]:
        sum_bomb -= queue[0][1] * a
        queue.popleft()
    l[i][1] -= sum_bomb
    if l[i][1] <= 0 :
        continue
    num = math.ceil(l[i][1]/a)
    right = l[i][0] + 2 * d
    queue.append([right, num])
    cnt += num
    sum_bomb += num * a
print(cnt)


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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
from bisect import bisect_left
import math
import sys
readlines = sys.stdin.readline

def main():
  n,d,a = map(int,input().split())
  xx = []
  hh = []
  X = []
  H = []
  for _ in range(n):
    tmp = list(map(int,input().split()))
    xx.append(tmp[0])
    hh.append(tmp[1])

  k = zip(xx,hh)
  q = sorted(k)
  for xxx,hhh in q:
    X.append(xxx)
    H.append(hhh)
  X = tuple(X)
  ans = 0
  end = n-1
  while True:
    x = X[end] - d
    start = bisect_left(X,x-d)
    num = math.ceil(H[end] / a)
    ans += num
    H[end] = 0
    e = end
    end = start-1
    for i in range(start,e):
      H[i] -= a * num
      if H[i] > 0:
        end = i
    if end < 0:
      break

  print(ans)
if __name__ == '__main__':
  main()

import math

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

print(math.ceil(h/a))


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
#python3
from numpy import ceil
h, a = map(int, input().split())

print(ceil(h/a))


#python3
from numpy import ceil
h, a = map(int, input().split())
n = ceil(h/a)
print(int(n))


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
H,A = map(int,input().split())
X = math.ceil(H/A)

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys

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

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:
      return hits
    return hits + 1


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)


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)


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

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


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
h a = map(int, input().split(' '))
if h % a == 0:
    print(h // a)
else:
    print(h // a + 1)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N, K =map(int, input().split())
H_list = list(map(int, input().split()))

print(H_list)

import math

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

print(math.ceil(H/A))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
h=int(input())
ans=0
c=1
while h>1:
    ans+=c
    c*=2
    h//=2
ans+=c
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
H,A=map(int, input().split())
print(math.ceil(H/A))

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

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

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
H, N = map(int, input().split())
A = [int(x) for x in input().split()]
list2 = sorted(A, reverse=True)  
if N>0:
    del list2[0:N]
    print(sum(list2))
elif N<0:
    print(sum(A))

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

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

print(count)

H, N = map(int, input().split())
A = [int(x) for x in input().split()]
list2 = sorted(A, reverse=True)  
if N>0:
    del list2[0:N]
    print(sum(list2))
elif N<0:
    print(sum(A))

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


print(count)

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define MOD (long long)(1e9+7)
#define INF (1LL<<60)



template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}


// 最大公約数
ll gcd(ll a, ll b)
{
  if(b == 0) return a;
  return gcd(b, a % b);
}

// mod m におけるa の逆元
ll modinv(ll a, ll m) {
  ll b = m, u = 1, v = 0;
  while (b) {
    ll t = a / b;
    a -= t * b; swap(a, b);
    u -= t * v; swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}

// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
  ll s = sqrt(n);
  ll r = 0;
  for(ll i = 2; i <= s; i++) {
    if((n % i) == 0) {
      r = 0;
      do {
	r++;
	n = n / i;
      } while((n % i) == 0);
      prim.push_back({i, r});
    }
  }
  if(n > s) {
    prim.push_back({n, 1});
  }
}

void solve()
{
  // ll N; cin >> N;
  // ll N, K; cin >> N >> K;
  // ll x, y, z; cin >> x >> y >> z;
  // ll a, b, c; cin >> a >> b >> c;
  // string s; cin >> s;
  // vector<ll> a(N); rep(i, N) cin >> a[i];
  
  // ll ans = 0;
  // bool ok = false;

  // cout << ans << endl;
  // cout << (ok?"Yes":"No") << endl;
}


int main(void)
{
  // ll t; cin >> t; rep(i, t)
  solve();
}


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


Verdicts: Runtime Error

Accepted