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):
i = list(map(int, input().split()))
if i[0]%i[1]==0:
  print(i[0]/i[1])
else:
  print((i[0]/i[1])+1)

n=int(input())
z=0
while n>0:
  z+=n
  n=n//2
print(z)

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

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

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):
S1 = list(map(int, input().split()))
S2 = list(map(int, input().split()))

H = S1[0]

if H > sum(S2):
    print("no")
else:
    print("yes")

H, A = map(int, input().split())
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):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect

#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

import sys
import math
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

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

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

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

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 ceilT(a,b): 
    return (a+b-1)//b
H,A=map(int,input().split())
print(ceil(H,A))


def ceilT(a,b): 
    return (a+b-1)//b
H,A=map(int,input().split())
print(ceilT(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())
for n in range(0,):
  if h - a*n <= 0
  exit()
print(n)

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

import math
(H, A) = list(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(h//a+h%a)

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

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

H=input()
A=input()
h = int(H)
a= int(A)
n :int= h // a + 1
print(n)

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

h=input()
a=input()
H = int(h)
A= int(a)
n :int= H // A + 1
print(n)

h=input()
a=input()
H = int(h)
A= int(a)
n = H // A + 1
print(n)

H=input()
A=input()
h = int(H)
a = int(A)
if mod(h,a) == 0:
    n = h // A
else:
    n = h // a +1
print(n)

H=input()
A=input()
h = int(H)
a = int(A)
if mod(H,A) == 0:
    n = H // A
else:
    n = H // A +1
print(n)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

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

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

h,a=map(int, input().split())
count = 0
while True:
  result = h - a
  if (result > 0):
    count += 1
  else:
    break 
print(count)

h,a=map(int, input().split())
count = 0
while True:
  h = h - a
  if (h > 0):
    count += 1
  else:
    break
print(count + 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):
a=int(input())
b=int(input())
c=0
while 1:
  a-=b
  c+=1
  if a<=0:
    break
  else:
    pass
print(c)

h,a=map(int,input().split())
i=0
while 1:
    i+=1
    h-=a
    if h<=0:
        break
print(i)


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 sys
import math
input_list=sys.argv[0:]
H=int(input_list[1])
A=int(input_list[2])
Q=math.ceil(H/A)
print(Q)

import math
H=int(input())
A=int(input())
Q=math.ceil(H/A)
print(Q)

HN=input()
HN_list=HN.split()
H=int(HN_list[0])
N=int(HN_list[1])
A=input()
A_list=A.split()
aaa=map(int, A_list)
A_sum=sum(aaa)
if A_sum>H:
    print("Yes")
else:
    print("No")

import math
str = input()
str_list=str.split()
H=int(str_list[0])
A=int(str_list[1])
Q=math.ceil(H/A)
print(Q)

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-1)/a )


h, a = map(int, input().split())
print( h//a if h%a==0 else 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,N = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
    a,b = list(map(int, input().split()))
    A.append(a)
    B.append(b)

dp = [float('inf') for i in range(H+max(A))]
dp[0] = 0

for i in range(H+max(A)):
    m = []
    for j in range(N):
        if i-A[j] >= 0:
            m.append(dp[i-A[j]]+B[j])
    m.append(dp[i])
    dp[i] = min(m)

print(min(dp[H:]))




H,A = list(map(int, input().split()))
i = 0
while(True):
    i += 1
    if A * i >= H:
        break

print(i)

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 = list(map(int, input().split()))
lst = list(map(int, input().split()))
sum = 0
for _ in range(n):
  sum += lst[_]
if sum >= h:
  print('Yes')
else:
  print('No')

h, a = list(map(int, input().split()))
b = int(h/a)
if b == h/a:
  print(b)
else:
  print(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):
n, m = [int(x) for x in input().split()]
k = 0
if m>n:
    print(1)
else:
    print(n//m)

n, m = [int(x) for x in input().split()]
k = 0
if m>n:
    print(1)
else:
    while n > 0:
        n = n - m
        k += 1
    print(k)

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

h,a=[int(i)for i in 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)


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

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

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

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

h,a=map(int,input().split())
cnt=0
while True:
    h-=a
    cnt+=1
    if h<=0:
        break
print(cnt)

Verdicts: 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):
def main(Hitpoint,Attack):
  count_num = 0
  while true:
    Hitpoint -= Attack
    count_num += 1
    if Hitpoint <= 0:
      break

if __name__ == "__main__":
    inp=input()   
    main(inp.replace(' ', ','))

def main(Hitpoint,Attack):
  count_num = 0
  while True:
    Hitpoint -= Attack
    count_num += 1
    if Hitpoint <= 0:
      break
  return count_num
 
if __name__ == "__main__":
    inp=input().split()
    hitpoint = int(inp[0])
    attack = int(inp[1])
    print(main(hitpoint,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):
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):
import math


H, A = map(int, input().split())
n = math.floor(H/A)



print(n)

import math

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

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

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

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

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

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 =  [int(x) for x in input().split()]
attack = True
count = 0
while(attack):
    H = H - A
    count = count + 1
    if H < 0:
        attack = False

print(count - 1)
        

H , A =  [int(x) for x in input().split()]
attack = True
count = 0

while(attack):
    H = H - A
    count = count + 1
    if H <= 0:
        attack = False

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

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

import math
a,b=map(float,input().split())
print(math.ceil(a/b))

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

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

ans = (h + a - 1) // 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, a = map(int, input(), split())
n = 0
while True:
    h = h - a
    n = n + 1
    if h >= a:
        break
print(n) 

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

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

h, a = map(int, input(), split())
n = 0
while True:
    h = h - a
    n = n + 1
    if h <= a:
        break
print(n) 

h, a = map(int, input(), split())
n = 0
while True:
    h = h - a
    n = n + 1
    if h <= 0:
        break
print(n) 

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

Verdicts: Runtime Error

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):
from operator import itemgetter
H,N=map(int,input().split())
List=[]
A=0
B=0
C=10*10*10*10
D=0
for i in range(N):
    a,b=list(map(int,input().split()))
    c=a/b
    List.append((a,b,c))
List1=sorted(List,key=itemgetter(2))
List2=sorted(List,key=itemgetter(0))
for i in range(H):
    if A<H:
        h=H-A
        if h>=List1[N-1][0]:
            A=A+List1[N-1][0]
            B=B+List1[N-1][1]
        else:
            for j in range(N):
                if List2[j][0]>=h:
                    temp1=List2[j][0]
                    temp=List2[j][1]
                    if temp<=C:
                        C=temp
                        D=temp1
            B=B+C
            A=A+D
    elif A>=H:
        break
print(B)

H,A=map(int,input().split())
B=H//A
if H%A==0:
    print(B)
else:
    print(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):
import sys
H = sys.stdin.readline()
H = int(H)

count = 0
roop_c = 2
while True:
    H = H // 2
    count += roop_c
    roop_c *= 2

    if H == 1:
        break

print(count+1)


import sys
inputs = sys.stdin.readline()
inputs = inputs.split()
# inputs = inputs.split('')

H, A = int(inputs[0]), int(inputs[1])

count = 0
while H>0:
    H =  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):

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

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

print(num)




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

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

print(num)




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

num  = H // A
remain = H % A

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

print(num)



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

num  = H // A
remain = H % A

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

print(out)



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

num  = H // A
remain = H % A

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

print(out)



Verdicts: Wrong Answer

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):
HA=input()
HA=HA.split()
n=HA[0]/HA[1]
if int(HA[0])%int(HA[1])==0:
  print(n)
else:
  print(n+1)

HA=input()
HA=HA.split()
n=int(HA[0])/int(HA[1])
if int(HA[0])%int(HA[1])==0:
  print(int(n))
else:
  print(int(n+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())
a*m>=h
print(m)

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

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 = input()
A = input()

if H%A == 0:
  return H/A
else:
  return H/A + 1

H = input()
A = input()

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

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

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

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


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

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


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

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


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):
#!/usr/bin/env python3
h,n = map(int,input().split())
a = list(map(int,input().split()))
sum=0
for i in a:
    sum+=i

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


#!/usr/bin/env python3
H, A = map(int,input().split())
count=0
while H>0:
    count+=1
    H-=A
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())
ans=h//a
if ans%1!=0:
    ans=ans+1
print(ans)

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

H, A = map(int, input().split())
from math import ceil
print(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 = int(input())
a = int(input())
counter = 0

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

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

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

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 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):
N,K = map(int, input().split())
T = list(map(int, input().split()))
T.sort()
if K>=N:
    print(0)
else:
    for i in range(K):
        T.pop()
    
    print(sum(T)) 

def c(i):
    return i

H,A = map(int, input().split())
a,b = map(c,divmod(H,A))
if b==0:
    print(a)
else:
    print(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())
print((H+A-1)//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):
import Math

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


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

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


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):
import math
H, A = input().split()
print(math.ceil(H / A))

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):
hp = int(input())
attack = int(input())

print(-(-(hp) //attack))



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

print(-(-(kazu[0]) // kazu[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,n = [int(x) for x in input().split()]

# dp[i] = min magic points to decrease i health points
maxmax = 99999999
dp = [maxmax for x in range(h+1)]
dp[0] = 0
for x in range(n):
    a,b = [int(r) for r in input().split()]
    
    for j in range(h):
        dp[min(j+a, h)] = min(dp[min(j+a, h)], dp[j]+b)

print(dp[h])


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

print(a//b)

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

print(math.ceil(a/b))


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):
a = input()
a = a.split(" ")
i = 0
while 1:
  if a[0]<0:
    break
  else:
    i = i+1
 	a[0]=a[0]-a[1]
    
print(i)

a = input()
a = a.split(" ")
i = 0
while 1:
  if a[0]<0:
    break
  else:
    i = i+1
    a[0]=int(a[0])-int(a[1])
    
print(i)

a = input()
a = a.split(" ")
i = 0
while 1:
  if a[0]<0:
    break
  else:
    i = i+1
 	b=a[0]-a[1]*i
    
print(i)

a = input()
a = a.split(" ")
i = 0
while 1:
  if int(a[0])=<0:
    break
  else:
    i = i+1
    a[0]=int(a[0])-int(a[1])
    
print(i)
  

a = input()
a = a.split(" ")
i = 0
while 1:
  if int(a[0]) <= 0:
    break
  else:
    i = i+1
    a[0]=int(a[0])-int(a[1])
    
print(i)
  

Verdicts: 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-1)//a)

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

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

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 math
A,H=input().split()
print(math.ceil(H/A))


import math
A,H==(float(x) for x in input().split())
print(math.ceil(H/A))


import math
H,A=(float(x) for x in input().split())
print(math.ceil(H/A))

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):
b = int(input())
a = int(input())
c = 0
while (b>0):
    b = b-a
    c = c+1
print(c)

H = int(input())
A = int(input())
c = 0
while (H>0):
    H = H-A
    c = c+1
print(c)

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

import math

H, A = [int(x) for x in input().split()]
print(math.ceil(H/A))

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(input().split())

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

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

print((h+a-1)//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):
import math 
h, a = map(int, input.split())
ans = math.ceil(h/a)
print(ans)

import math 
h, a = map(int, input().split())
ans = math.ceil(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, N = map(int, input().split())
A = list(map(int, input().split()))
atk = 0
for i in A:
    atk += i
if H > atk:
    print("No")
else:
    print("Yes")

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

K = N/M

print(K+1)

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

K = N/M
if N < M:
  print(1)
else if N > M && N%M == 0:
  print(K)
else:
  print(K+1)



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

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

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

h,a=(int(x) for x in input().split())
i = 0
while h > 0:
    h = h - a
    i = i + 1
print(i)

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,inpit().split())
ans = 0
for k in range(100000000):
  h = h-a
  if h <=0:
    ans = k+1
    break
print(ans)

h,a = map(int,input().split())
ans = 0
for k in range(100000000):
  h = h-a
  if h <=0:
    ans = k+1
    break
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())
q, mod = divmod(h, a)
if mod != 0:
  print(q)
else:
  print(q+1)


h, a = map(int, input().split())
q, mod = divmod(h, a)
if mod == 0:
  print(q)
else:
  print(q+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, N = map(int, input().split())
A = input()

waza = 0
for i in range(0, N):
    waza = waza + int(A.split()[i])

if waza >= H:
    print("Yes")
else:
    print("No")


import math

hp, attack = map(int, input().split())

print(math.ceil(hp / attack))


#

#     print(x)
# else:
#     print(x + 1)

# count = 0
# 
# while True:

#     count += 1
# 
#     if hp <= 0:
#         print(count)
#         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 = int(input()),int(input())
if(H%A != 0): print((H//A) + 1)
else: print(H/A)

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, n = map(int, input().split())
dp = [10 ** 9] * (h+1)
dp[0] = 0

for ni in range(n):
  a, b = map(int, input().split())
  for hi in range(h):
    nj = min(j+a, h)
    dp[nj] = min(dp[nj], dp[j] + b)

print(dp[h])

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

count = 0
while True:
    h -= a
    count += 1
    if h <= 0:
        break
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 A>=H:
	print(1)
else:
  print((N//M)+1)

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

if A>=H:
	print(1)
elif 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())
print(sum(sorted(list(map(int, input().split())))[:0 if n<=k else n-k]))

h, a = map(int, input().split())
ans = 0
while h>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):
import math
n, m = input().split()
print(math.ceil(n/m))

import math
n, m = int(input().split())
print(math.ceil(n/m))


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


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

h,a = map(int, input().split())
if h<=a: print(1)
else:
	print(h//a if h%a==0 else 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):
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
import string


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, A = inputIntList()
  ans = math.floor(H / A)

  return ans


if __name__ == "__main__":
  print(main())


#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
import string


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


def main():
  H, A = inputIntList()
  ans = math.ceil(H / A)

  return ans


if __name__ == "__main__":
  print(main())


Verdicts: Wrong Answer

Accepted