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

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

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

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

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

h,a = int(input()).split(' ')
attack =0
while(h>0):
  h=h-a;
  attack=attack+1
print(attack)

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

Verdicts: Wrong Answer

Time Limit Exceeded

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

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

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

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

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

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
print(math.ceil(int(input())/int(input())))

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

count = x//y

if x%y == 0:
    count += 1

print(count)

x,y = map(int,input().split())

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

a = sum(li)

if a > x:
    print('Yes')
else:
    print('No')


x,y = map(int,input().split())

count = x//y

if x%y != 0:
    count += 1

print(count)

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


def get_inputs():
    inputs = input().split(" ")
    monsters_num, diff, attack = int(inputs[0]), int(inputs[1]), int(inputs[2])
    monsters = []
    for monster in range(monsters_num):
        inputs = input().split(" ")
        coordinate, health = int(inputs[0]), int(inputs[1])
        monsters.append({"coordinate": coordinate, "health": health})
    return monsters, diff, attack, monsters_num


def between_coordinates(monster, coordinate, diff):
    if (coordinate - diff <= monster["coordinate"] <= coordinate) or (
            coordinate <= monster["coordinate"] <= coordinate + diff):
        return True
    return False


def sort_monsters_coordinates(monsters):
    return sorted(monsters, key=lambda k: k['coordinate'])


def get_alive_monsters(monsters):
    return [monster for monster in monsters if monster["health"] > 0]


def attack_leftmost_monster(coordinate, monsters, attack, diff):
    bombs_num = 0
    if len(monsters) == 0:
        return 0
    leftmost_monster = monsters.pop(0)
    needed_attacks = math.ceil(leftmost_monster["health"] / attack)
    bombs_num += needed_attacks
    for monster in monsters:
        if between_coordinates(monster, coordinate, diff):
            monster["health"] -= (needed_attacks * attack)
    monsters = get_alive_monsters(monsters)
    return monsters, bombs_num


def get_max_health(monsters):
    if len(monsters) == 0:
        return 0

    max_health = - math.inf
    for monster in monsters:
        if monster["health"] >= max_health:
            max_health = monster["health"]
    return max_health


monsters, diff, attack, monsters_num = get_inputs()
if len(monsters) > 0:
    monsters = sort_monsters_coordinates(monsters)
else:
    print(0)

coordinate = monsters[0]["coordinate"] + diff
total_bombs_num = 0

while len(monsters) > 0 and coordinate <= monsters[-1]["coordinate"] - diff:
    monsters, bombs_num = attack_leftmost_monster(coordinate, monsters, attack, diff)
    total_bombs_num += bombs_num
    if len(monsters) > 0:
        coordinate = monsters[0]["coordinate"] + diff
        
print(total_bombs_num + math.ceil(get_max_health(monsters) / attack))

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



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


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



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


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

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):
ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
H, A = rii()
 
print(H // A)

ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())

H, A = rii()

print((H // A)

ri = lambda S: [int(v) for v in S.split()]
def rii(): return ri(input())
 
H, A = rii()
H, r = divmod(H, A)
r = 1 if r else r
print(H + r)

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

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

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

H,A=map(int,input().split())
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 = int(input("モンスターの体力を入力してください")) 
A = int(input("サーバルの攻撃力を入力してください"))
i = 0
while H > 0:
    H -=A
    i += 1
    print("モンスターの体力は", end="")
    print(H, end="")
    print("です。")
    
print("よって",end = "")
print(i, end = "")
print("回の攻撃でモンスターに勝つことができます")


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

if i[0] == i[1]:
    print("1")
elif i[0] % i[1] > 0:
    print((i[0] // i[1]) + 1)
else :
    print(i[0] // i[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())

memo_count = {}
def searchCount(h):
    if h==1: 
        return 1
    elif h in memo_count:
        return memo_count[h]
    else:
        h_half = int(h / 2)
        memo_count[h] = 1 + 2*searchCount(h_half)
        return memo_count[h]

print(searchCount(H))


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):
import numpy as np

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

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

win = 0
for i in range(N):
	for j in range(i+1, N):
		if x[i] + x[j] >= H:
			win = 1
			print("Yes")
			break
	if win == 1:
		break


if win == 0:
	print("No")

import numpy as np

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

ans = N // A

if N%A>0:
	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())
answer = H // A
print(answer)

H, A = map(int, input().split())
a = H // A
b = H % A
if b == 0:
  print(a)
else:
  print(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):
import math
H,A = input().strip().split()
print(math.ceil(H/A))

import math
H, A = map(int, input().strip().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),*t=[list(map(int,o.split()))for o in open(0)]
d=[0]*(h+10100)
for i in range(1,h+1):d[i]=min(d[i-a]+b for a,b in t)
print(d[h])

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):
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if h <= s:
	print('YES')
else:
	print('NO')

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

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

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

import math
s = list(map(int, input().split()))
print(str(math.ceil(s[0] / s[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 = input().split().
count = 0
while H > 0:
    H -= A
    count +=1

print(count)


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

print(count)


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=input().split()
print(int(H)//int(A)+1 if 1<=H<=10000 and 1<=A<=10000)

H,A=map(int,input().split())
if 1<=H<=10000 and 1<=A<=10000:
    print(H//A+1 if H%A!=0 else int(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, intput().split())
res = H // A
if H % A > 0:
  	res += 1
print(res)


H, A = map(int, input().split())
res = H // A + (H % A > 0)
print(res)

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 = input().split()
H = int(H)
#print(H)
#H, N = input().split()
lis = list(map(int,input().split()))
A =sum(lis)
if H > A:
    print("No")
else:
    print("Yes")

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

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 sys import stdin

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

from sys import stdin

H,A = [int(x) for x in stdin.readline().rstrip().split()]
if H%A==0:
    print(int(H/A))
elif A>H :
    print(1)
else :
    print(1+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):
input1 = input().split(' ')
input2 = input().split(' ')
n = int(input1[0])
k = int(input1[1])
h = input2

for _ in range(k):
  if len(h) == 0:
    break
  h.pop(h.index(max(h)))

h = list(map(int, input2))
print(sum(h))

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

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


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


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().split()
H = [int(i) for i in H]

if H[0] > H[1]:
    H[0] = H[0] - H[1]
    count+ = 0
else:
    count+ = 1
print(count)

H = input().split()
H = [int(i) for i in H]

count = 0

while True:
    if H[0] > H[1]:
        H[0] = H[0] - H[1]
        count+=1
    else:
        count = count + 1
        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())
cnt=0
while():
  h=h-a
  if h>=0:
    cnt+=1
  else:
    print(cnt)

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

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_list = list(map(int, input().split()))
if H <= sum(A_list):
    print('Yes')
else:
    print('No')

import numpy as np

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

print(int(np.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):
import math

def resolve():

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

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

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


import sys
from io import StringIO
import unittest

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

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

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

h,a = map(int,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):
H = int(input(""))
A = int(input(""))

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

print(i)

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

i = 0
while H > 0:
    H -= A
    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):
from math import seil

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

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

if (H % A):
    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):
import math
h, a = map(int, input().split())

print(math.ceil(a / h))

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())
print(math.floor(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=input().split()
S=1
if int(H)-S*int(A)>0:
  S+=1
else:
  print(S)

H,A=input().split()
S=1
if int(H)-S*int(A)>=0:
  S+=1
else:
  print(S)

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

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

for j in range(10000):
  
  H = H - A
  
  
  if H <= 0:
    i = i
  else:
    i = i + 1


if H <= 0:
  print(i)

H = input()
A = input()

i = 1


for j in range(10000):
    H = H - A
    if H < 0 :
      print(i)
    else:
      i = i + 1

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

for j in range(10000):
    H = H - A
    if H <= 0:
        i = i
    else:
        i = i + 1
if H <= 0:
    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):
INF = 100100100

h, n = map(int, input().split())
ab = []
maxA = -1
for i in range(n) :
    a, b = map(int, input().split())
    ab.append([a, b])
    maxA = max(maxA, a)

#dp = [[INF for i in range(h+1)] for j in range(n+1)]
dp = [INF for i in range(h+maxA+1)]
dp[0] = 0
for i in range(n) :
    for j in range(h+1) :
        dp[j+ab[i][0]] = min(dp[j+ab[i][0]], dp[j]+ab[i][1])

print(min(dp[h:]))


'''
for i in range(n) :
    for j in range(h+1) :
        dp[i+1][j] = min(dp[i+1][j], dp[i][j])
        dp[i+1][min(j+ab[i][0], h)] = min(dp[i+1][min(j+ab[i][0], h)], dp[i+1][j]+ab[i][1])
'''

#    print(dp[i])


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):
value = input().split(' ')
hp = int(value[0])
at = int(value[1])
for index in range(hp):
  hp = hp - at
  if hp <= 0:
    print(index)
    break

hp, at = map(int, input().split(' '))
ans = 0
while hp > ans * at:
  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())
print(h//a + (h%a>0)

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

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

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

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

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

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

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

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

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

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

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

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

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

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

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

print(-eval(("-"+input()).replace(" ","//")))

Verdicts: Wrong Answer

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

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

print(ans)

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

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

print(ans)

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

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

print(round(ans))


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):
inport math
line = input().split(' ')
M = int(line[0])
N = int(line[1])
print(math.floor(M/N))

inport math
line = input().split(' ')
M = int(line[0])
N = int(line[1])
print(math.ceil(M/N))


import math
line = input().split(' ')
M = int(line[0])
N = int(line[1])
print(math.ceil(M/N))


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

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

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(int(math.floor(h/a)))

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

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,0)+1)

H,A=map(int,input().split())
if H%A==0:
    print(H//A)
if 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())
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):
x = input().split()
n = int(x[0])
k = int(x[1])
 
h = input().split()
 
sorted(h)
 
if n-k <= 0:
    print(0)
    exit()
 
c = 0
for i in range(n-k):
    c += int(h[i])
print(c)
    


x = input().split()
n = int(x[0])
k = int(x[1])
 
h = input().split()
 
h = sorted(h)
 
if n-k <= 0:
    print(0)
    exit()
 
c = 0
for i in range(n-k):
    c += int(h[i])
print(c)
    


x = input().split()
n = int(x[0])
k = int(x[1])
 
h = input().split()
 
sorted(h)
 
if n-k <= 0:
    print(0)
    exit()
 
c = 0
for i in range(n-k):
    c += int(h[i])
print(c)
    

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

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=int(input().split())
count=0

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

print(A)

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

H.sort(reverse=True)
del H[:K]
H_sum = sum(H)
print(H_sum)


n,k= map(int,input().split())
h = list(map(int,input().split()))
h.sort()
if n<=k:
  print(0)
else:
  a = h[0:n-k]
  print(sum(a))

n,k= map(int,input().split())
h = list(map(int,input().split()))
h.sort()
if n<=k:
  print(0)
else:
  a = h[:n-k]
  print(sum(a))

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

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

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

N, K = map(int, input().split())
H = sorted(list(map(int, input().split())))
print(sum([0] + H[:-K]) if K > 0 else sum(H))


N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort()
if N<=K:
    print(0)
else:
    print(sum(H[0:N-K]))

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

ans = 0

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

print(ans)

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

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 = map(int, input().split())
ans = "Yes" if sum(a) >= h else "No" 
print(ans)
         

a, b = map(int, input().split())
ans  = -(-a//b)
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):
a,b,c,d=map(int,input().split())
print(max(a*b,c*d))

a,b,c,d=map(int,input().split())
print(max(a*b,c*d))

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 = map(int, input().split())
# U = input()
ans = 0

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

print(ans)

h,a = map(int, input().split())
# U = input()
ans = 0

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

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):
import numpy as np
N, a = list(map(int, input().split()))

print(np.round(np.ceil(N/a)))

import sys
import numpy as np

lines = sys.stdin.readlines()

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

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


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

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

import numpy as np
N, a = list(map(int, input().split()))
 
print(int(np.ceil(N/a)))

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

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

import math
H, A = input().split()
H = int(H)
A = int(A)
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())
times, mod = divmod(H, A)
if mod != 0:
    times += times + 1
print(times)


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

x,y = map(int,input().split()) 
print(-(-x//y))



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

g = int(H / 2)
ans = 0
if g == 0:
    print(1)
else:
    n = 0
    while True:
        if 2 ** (n + 1) < H:
            n += 1
        elif 2 ** (n + 1) >= H:
            n += 1
            break
    for i in range(n + 1):
        ans = ans + (2 ** i)
print(ans)


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

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):
hp, atk = input().split()

hp = int(hp)
atk = int(atk)

value = 0

numlist = list((input().split()))

numlist = list(map(int, numlist))

for i in range(atk):
    value = value + numlist[i]
    
if value > hp:
    print("Yes")
else:
    print("No")

import math

hp, atk = input().split()

hp = int(hp)

atk = int(atk)

print(math.ceil(hp / atk))

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()))
if H <= sum(A):
  print ('Yse')
else:
  print ('No')

#a,b = map(int, input().split())
import math
if __name__ == "__main__":
    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= input().split()
H=int(H)
A=int(A)
ans=0
if (H % A==0):
    ans=int(H/A)
else:
    ans=int(H/A)


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


Verdicts: Wrong Answer

Accepted