Problem:


Score : 100 points

Problem Statement

Serval is fighting with a monster.

The health of the monster is H.

In one attack, Serval can decrease the monster's health by A.
There is no other way to decrease the monster's health.

Serval wins when the monster's health becomes 0 or below.

Find the number of attacks Serval needs to make before winning.

Constraints

1 \leq H \leq 10^4

1 \leq A \leq 10^4

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H A

Output

Print the number of attacks Serval needs to make before winning.

Sample Input 1

10 4

Sample Output 1

3

After one attack, the monster's health will be 6.

After two attacks, the monster's health will be 2.

After three attacks, the monster's health will be -2.

Thus, Serval needs to make three attacks to win.

Sample Input 2

1 10000

Sample Output 2

1

Sample Input 3

10000 1

Sample Output 3

10000



Sample input:
10 4


Sample output:
3

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H=int(input())
A=int(input())
 
ans=int(H//A)+1
print(ans)

Submission status: Runtime Error

Solution code:
H=int(input())
A=int(input())

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

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
H = int(input())
A = int(input())
result = H - 1　// A
print(result + 1)

Submission status: Runtime Error

Solution code:
n, k = map(int,input().split())
hp = list(map(int,input().split()))
sorted_hp = sorted(hp)
if n>=k:
  print(sum(sorted_hp[0:n-k]))
else:
  print(0)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

while (Ans =< 0):
	H -= A
	Ans += 1

print(Ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

while Ans =< 0:
	Ans = h-a
	Ans2+=1

print(Ans2)

Submission status: Runtime Error

Solution code:
h, a = input()

h = int(h)
a = int(a)

cnt = 0

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

print(cnt)

Submission status: Runtime Error

Solution code:
h, a = int(input())
cnt = 0

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

print(cnt)

Submission status: Runtime Error

Solution code:
h = int(input())
a = int(input())
cnt = 0

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

print('{}'.format(cnt))

Submission status: Runtime Error

Solution code:
h = int(input())
a = int(input())
cnt = 0

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

print(cnt)

Submission status: Runtime Error

Solution code:
H = input()
A = input()

while Ans =< 0:
	Ans = H-A
	Ans2++

print(Ans)

Submission status: Runtime Error

Solution code:
import math

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

Submission status: Runtime Error

Solution code:
hp, _ = map(int, input().split(" "))
s = sum(map(int, input().split(" ")))
print((hp - s) <= 0)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import math

args = sys.argv

hp = int(args[1])
attack = int(args[2])

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.ceil(hp / attack))

print(int(ans))

Submission status: Runtime Error

Solution code:
import sys
import math

args = sys.argv

hp = int(args[1])
attack = int(args[2])

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.ceil(hp / attack))

print(ans)

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

hp = int(args[1])
attack = int(args[2])

if(hp <= attack):
    ans = "1"
else:
    ans = str(hp // attack)

print(ans)

Submission status: Runtime Error

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

import sys
import math

args = sys.argv

hp = int(args[1])
attack = int(args[2])

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.floor(hp / attack))

print(str(ans))

Submission status: Runtime Error

Solution code:
import sys
import math

args = sys.argv

hp = int(args[1])
attack = int(args[2])

if(hp <= attack):
    ans = "1"
else:
    ans = str(math.floor(hp / attack))

print(str(ans))

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv
if(args[0] <= args[1]):
    ans = "1"
else:
    ans = int(args[1]) / int(args[0])

print(str(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K =map(int, input().split())
H_list = list(map(int, input().split()))

print(H_list)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
#入力
N, K = map(int, input().split())
li = list(map(int,input().split()))
list.sort(li, reverse = True)

#出力
a = list(np.zeros(K))
b = list(np.ones(N-K))
a.extend(b)

print(np.dot(a, li))

Submission status: Runtime Error

Solution code:
H/A

Submission status: Runtime Error

Solution code:
import math
l = input().split()
print(math.ceil(l[0]/l[1]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H, A = map(int, input().spit())
times = 0
crack = Fasle
while True:
  H -= A
  times += 1
  if H < 0:
    crack = True
  if crack:
    break
print(times)

Submission status: Runtime Error

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

for j in range(10000):
  # i 回目の攻撃
  H = H - A
  
  # HP判定
  if H <= 0:
    i = i
  else:
    i = i + 1

# 何回攻撃すればよいか
if H <= 0:
  print(i)

Submission status: Runtime Error

Solution code:
H = input()
A = input()

i = 1

# 1回目の攻撃
for j in range(10000):
    H = H - A
    if H < 0 :
      print(i)
    else:
      i = i + 1

Submission status: Runtime Error

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

def calc_atack(H, A, counter =0):
    H -= A
    counter += 1
    if H <= 0:
        return counter
    else:
        return calc_atack( H, A, counter = counter)


print(calc_atack(H, A))

Submission status: Runtime Error

Solution code:
enemmyCountN,killerTimeK = map(int,input().split())
enemyHp = input().split()

intEnemyHp = [int(i) for i in enemyHp]
intEnemyHp.sort()

resultEnemyCount = enemmyCountN - killerTimeK
countNormal = 0

if killerTimeK >= enemmyCountN:
    print(0)

else:
    for i in range(resultEnemyCount):
        countNormal += intEnemyHp[i]
    print(countNormal)

Submission status: Runtime Error

Solution code:
enemmyCountN,killerTimeK = map(int,input().split())
enemyHp = input().split()

enemyHp.sort()

resultEnemyCount = enemmyCountN - killerTimeK
countNormal = 0


for i in range(resultEnemyCount):
    countNormal += int(enemyHp[i])

print(countNormal)

Submission status: Runtime Error

Solution code:
H, N = map(int, input().split())
x = [list(map(int, input().split())) for n in range(N)]
x = [[tmp[i] for tmp in x] for i in range(len(x[0]))]
A = x[0]
B = x[1]

def ibis(H, A, B):
    maxA = max(A)
    HmaxA = H + maxA
    minB = min(B)
    dp = [max(B) * H] * (HmaxA + 1)
    dp[0] = 0
    for h in range(HmaxA):
        for n in range(N):
            dp[h + 1] = min(dp[h + 1], dp[h] + minB)
            hp = h + A[n]
            if hp <= HmaxA:
                dp[hp] = min(dp[hp], dp[h] + B[n])
    return min(dp[H:HmaxA+1])

print(ibis(H, A, B))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a=s[0]
for i in range(s[1]):
  a -= m[i]

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

Submission status: Runtime Error

Solution code:
s = [list(map(int,input().split())) for i in range(2)]

a=s[0][0]
for i in range(s[0][1]):
  a -= s[1][i]

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

Submission status: Runtime Error

Solution code:
H,N = list(map(int,input().split()))
alist = list(map(int,input().split()))
if H <= sum(alist):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
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(' ', ','))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

ans = math.ceil(h/a)

print(ans)

Submission status: Runtime Error

Solution code:
def howmany(n,m):
  if n%m!==0:
    return n//m+1
  else:
    return n/m

Submission status: Runtime Error

Solution code:
from numba inmport 

@jit
def do():
  data = input().split()
  monsters = int(data[0])
  smash = int(data[1])
 
  mon_str = input().split()
  mon_str = [int(b) for b in mon_str]
  count = 0
 
  for i in range(smash):
      try:
          enemy = mon_str.index(max(mon_str))
          del mon_str[enemy]
    
      except ValueError:
          pass
  print(sum(mon_str))
 
do()

Submission status: Runtime Error

Solution code:
h,a=map(int, input().split())
a*m>=h
print(m)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H,N = map(int,input().split())
Magic =[]
A =[]
E =[]
for i in range(N):
    a,b = map(int,input().split())
    Magic.append((a,b))
    A.append(a)
    E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) for i in range(N)]
for i in range(N):
    if i == 0:
        for j in range(1,MAX_A//Magic[0][0]+1):
            DP[0][j*Magic[0][0]] = Magic[0][1]*j
    else:
        for j in range(1,(MAX_A+1)):
#            KARI = []
            DP[i][j]=DP[i-1][j]
            if j % Magic[i][0] == 0:
                DP[i][j]=min(DP[i][j],((j//Magic[i][0]) * Magic[i][1]))
            r = j // Magic[i][0]
            for k in range(r):
                DP[i][j]=min(DP[i][j],(DP[i-1][j-k*Magic[i][0]]+k*Magic[i][1]))
print(min(DP[N-1][H:MAX_A]))

Submission status: Runtime Error

Solution code:
H,N = map(int,input().split())
Magic =[]
A =[]
E =[]
for i in range(N):
    a,b = map(int,input().split())
    Magic.append((a,b))
    A.append(a)
    E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) for i in range(N)]
for i in range(N):
    if i == 0:
        for j in range(1,MAX_A//Magic[0][0]+1):
            DP[0][j*Magic[0][0]] = Magic[0][1]*j
    else:
        for j in range(1,(MAX_A+1)):
            KARI = []
            KARI.append(DP[i-1][j])
            if j % Magic[i][0] == 0:
                KARI.append((j//Magic[i][0]) * Magic[i][1])
            r = j // Magic[i][0]
            for k in range(r):
                KARI.append(DP[i-1][j-k*Magic[i][0]]+k*Magic[i][1])
            DP[i][j] = min(KARI)
print(min(DP[N-1][H:MAX_A]))

Submission status: Runtime Error

Solution code:
import math

H,N = map(int,input().split())
Magic =[]
A =[]
E =[]
for i in range(N):
    a,b = map(int,input().split())
    Magic.append((a,b))
    A.append(a)
    E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = math.ceil(MAX_A/E_MIN) +1
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) for i in range(N)]
for i in range(N):
    if i == 0:
        for j in range(1,MAX_A//Magic[0][0]+1):
            DP[0][j*Magic[0][0]] = Magic[0][1]*j
    else:
        for j in range(1,(MAX_A+1)):
            KARI = []
            KARI.append(DP[i-1][j])
            if j % Magic[i][0] == 0:
                KARI.append((j//Magic[i][0]) * Magic[i][1])
            r = j // Magic[i][0]
            for k in range(r):
                KARI.append(DP[i-1][j-k*Magic[i][0]]+k*Magic[i][1])
            DP[i][j] = min(KARI)
print(min(DP[N-1][H:MAX_A]))

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<tuple>
#include<map>
#include<queue>
#include<math.h>
#include<numeric>
#include<iomanip>
#define rep(i, n) rep2(i,0,n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
//scanf("%d", &a); '\n';

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int h, a;
	cin >> h >> a;
	cout << ceil(h / a);
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = -(-H // A)

print(ans)

Submission status: Runtime Error

Solution code:
import pandas as pd

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
H A = [int(i) for i in input().split(' ')]
print(H // A + 1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input_val = input().split()
print(input_val[0] % input_val[1] +1)

Submission status: Runtime Error

Solution code:
return H % A + 1

Submission status: Runtime Error

Solution code:
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("回の攻撃でモンスターに勝つことができます")

Submission status: Runtime Error

Solution code:
s = [list(map(int,input().split())) for i in range(2)]

a=0
for i in range(s[0][1]):
  a += s[1][i]

r = "Yes"
if a < s[0][0]:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
s = [list(map(int,input().split())) for i in range(2)]

p = s[0][0]
a = 0
for i in range(s[0][1]):
  a += s[1][i]

r = "Yes"
if p > a:
  r = "No"

print(r)

Submission status: Runtime Error

Solution code:
print(H/A+1)

Submission status: Runtime Error

Solution code:
def howmany(n,m):
  if n%m==0:
    return n//m+1
  else:
    return n/m
  
howmany(n,m)

Submission status: Runtime Error

Solution code:
c = H/A +1

print(c)

Submission status: Runtime Error

Solution code:
HA = input()

HA = HA.split(" ")

H = HA[0]
A = HA[1]

hit = 0

while H < 0:
  H = H - A
  hit = hit + 1

print(hit)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

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

Submission status: Runtime Error

Solution code:
import itertools

H,N = map(int,input().split())
A = list(map(int,input().split()))
l = list(itertools.permutations(A,N))

ans = []
for i in l:
    if sum(i) >= H:
        ans.append("Yes")
    else:
        ans.append("No")

if "Yes" in ans:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
 
h = float(input())
enemies = [h]

count = 0
while len(enemies) > 0:
  temp = []
  for enemy in enemies:
    count+=1
    if enemy > 1:
      temp.append(round(enemy / 2))
      temp.append(round(enemy / 2))
  enemies = temp

print(count)

Submission status: Runtime Error

Solution code:
h = int(input())
a = int(input())
i = 0
while h > 0:
    h = h - a
    i = i + 1
print(i)

Submission status: Runtime Error

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

for val in A:
	sum = sum + val

if sum >= H 
	print("Yes")
  
print("No")

Submission status: Runtime Error

Solution code:
def hoge(n, cnt=0):
    if n == 0:
        return cnt
    else:
        return hoge(int(n/2), 2 * cnt + 1)
      
def one_int():
    return int(input())
  
  
print(hoge(one_int()))

Submission status: Runtime Error

Solution code:
import math

h = float(input())
a = float(input())

print(math.ceil(h/a))

Submission status: Runtime Error

Solution code:
import math

h = float(input())
a = float(input())
 
print(math.ceil(h/a))

Submission status: Runtime Error

Solution code:
import math

h = int(input())
a = int(input())
 
print(math.ceil(h/a))

Submission status: Runtime Error

Solution code:
h = int(input())
a = int(input())

return math.ceil(h/a)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ls = [list(map(int,input().split())) for _ in range(n)]

amax = max(a for a,b in ls)

dp = [0]*(h+amax)

for i in range(1,h+amax):
  dp[i] = min(dp[max(0,i-a)]+b for a,b in ls)

print(min(dp[h:]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if h < a:
     ans = 1
elif h > a && h % a == 0:
    ans = h / a
elsif h > a && h % a != 0:
    ans = h  /a + 1

print(ans)

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
h = int(input())
a = int(input())
counter = 0

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

Submission status: Runtime Error

Solution code:
input_1 = input()
mylist = list(map(int, input_1.split(" ")))
H = mylist[0]
A = mylist[1]
if H % A =! 0:
  answer = H//A + 1
else:
  anser = H//A
print(answer)

Submission status: Runtime Error

Solution code:
input_1 = input("")
mylist = list(map(int, input_1.split(" ")))
H = mylist[0]
A = mylist[1]
if H % A =! 0:
  answer = H//A + 1
else:
  anser = H//A
print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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])
'''
#for i in range(n+1) :
#    print(dp[i])

Submission status: Runtime Error

Solution code:
i = input().split(" ")
monster_hp = int(i[0])
attack = int(i[1])

attack_time = 0
while monster_hp => 0:
  attack_time += 1
  monster_hp = monster_hp - attack
  
  
print(attack_time)

Submission status: Runtime Error

Solution code:
i = input().split(" ")
monster_hp = int(i[0])
attack = int(i[1])

attack_time = 0
while monster_hp => 0 :
  attack_time += 1
  monster_hp = monster_hp - attack
  
print(attack_time)

Submission status: Runtime Error

Solution code:
a, b = map(float, input().split())
attack_list = list(map(float, input().split()))

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

Submission status: Runtime Error

Solution code:
h=int(input("Enter the monsters health"))
a=int(input("Enter the number of attacks"))
i=0
for i in range(h,0,-a):
  i=i+1
 print(i)

Submission status: Runtime Error

Solution code:
H = input()
A = input()
c = 0
while true:
  H = H - A
  c = c+1
  if H < 0:
    print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def att(h ,a):
  for x in range(h):
    if h - (a * x) <=:
      return c

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H,N = map(int,input().split())
A = input().split()
if H - (int(sorted(A)[-1]) + int(sorted(A)[-2])) <= 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
H,N = map(int,input().split())
A = input().split()
if H - (int(sorted(A)[-1]) + int(sorted(A)[-2])) > 0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

print(int(h/a))

Submission status: Runtime Error

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

print(h%a+1)

Submission status: Runtime Error

Solution code:
import math

H,N=map(int,input().split())
A_list=[]
B_list=[]
for i in range(N):
    A,B=map(int,input().split())
    A_list.append(A)
    B_list.append(B)

amax=max(A_list)

inf=float('inf')
dp=[0]+[inf]*(H+amax)

for i in range(N):
    A=A_list[i]
    B=B_list[i]
    if A > H and B<dp[-1]:
        dp[-1]=B
        continue

    for j in range(A,1+H):
        if dp[j-A]+B<dp[j]:
            dp[j]=dp[j-A]+B
    
    minA=min(dp[H-A:])+B
    if minA < dp[-1]:
        dp[-1]=minA

print(dp[-1])

Submission status: Runtime Error

Solution code:
h,n = map(int,input().split())
L = []
for i in range(n):
  l = list(map(int,input().split()))
  L.append(l)
dp = [10**8]*10001
dp[0] = 0
for i in range(n):
  dp[L[i][0]] = L[i][1]
for i in range(10001):
  for j in range(n):
    if i-L[j][0] >= 0:
      dp[i] = min(dp[i],dp[i-L[j][0]]+L[j][1])
for i in range(9999,-1,-1):
  if dp[i] == 10**8:
    dp[i] = dp[i+1]
print(dp[h])

Submission status: Runtime Error

Solution code:
#!/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")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

inf=float('inf')
dp=[0]+[inf]*H

for i in range(N):
    A,B=map(int,input().split())
    ndp=copy.deepcopy(dp)
    for j in range(A,H+1):
        ndp[j]=min(ndp[j-A]+B,dp[j])

        if j > H-A:
            ndp[-1]=min(ndp[-1],ndp[j]+B)

    dp=ndp

print(dp[-1])

Submission status: Runtime Error

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

H = S1[0]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H=int(input())
A=int(input())
a=int(H/A)
if H%A!=0:
    a+=1
print(a)

Submission status: Runtime Error

Solution code:
H = int(input('H: '))
A = int(input('A: '))
 
if H%A == 0:
  x = H//A
  print(x)
else:
  x = (H//A)-1
  print(x)

Submission status: Runtime Error

Solution code:
H = int(input())
A = int(input())

if H%A == 0:
  x = H//A
  else:
    x = (H//A)-1

Submission status: Runtime Error

Solution code:
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))

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
h = input().split()
if (k >= len(h)):
    h.clear()
else:
    for i in range(k):
        m = max(h)
        h.remove(m)
b = 0
sum(h)
print(b)

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
h = input().split()
if (k > len(h)):
    h.clear()
else:
    for i in range(k):
        m = max(h)
        h.remove(m)
b = 0
for i in range(len(h)):
    b += int(h[i])

print(b)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    import math
    
    N, D, A = (int(i) for i in input().split())
    XH = [0]*N
    for i in range(N):
        XH[i] = tuple(int(j) for j in input().split())
    XH.sort()

    BOMB = [0]*N
    for i in range(N):
        boundary = XH[i][0]+2*D
        for k in range(i, N):
            if XH[k][0]> boundary:
                k = k-1
                break
        BOMB[i] = k

    count = 0
    for i in range(N):
        local_count = int(math.ceil(XH[i][1]/A))
        if local_count > 0:
            count+=local_count
            damage = local_count*A
            for j in range(i, BOMB[i]+1):
                XH[j] = (XH[j][0],XH[j][1] - damage])
    print(count)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    import math
    
    N, D, A = (int(i) for i in input().split())
    XH = [0]*N
    for i in range(N):
        XH[i] = list(int(j) for j in input().split())
    XH.sort()

    BOMB = [0]*N
    for i in range(N):
        boundary = XH[i][0]+2*D
        for k in range(i, N):
            if XH[k][0]> boundary:
                k = k-1
                break
        BOMB[i] = k

    count = 0
    for i in range(N):
        local_count = int(math.ceil(XH[i][1]/A))
        if local_count > 0:
            count+=local_count
            for j in range(i, BOMB[i]+1):
                XH[j][1] -= local_count*A

    print(count)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H = input()
A = input()

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

Submission status: Runtime Error

Solution code:
H = input()
A = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
H, N = (int(i) for i in input().split())
A = []
B = []
for i in range(N):
    a, b = (int(j) for j in input().split())
    A.append(a)
    B.append(b)
A_max = max(A)

DP = [0]
for i in range(1, H+A_max):
    dp = float('inf')
    for a, b in zip(A,B):
        if i-a>=0:
            dp = min(dp, DP[i-a] + b)
    DP.append(dp)
print(min(DP[H:]))