Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x = int(input())

b = -1
while True:
    b+=1
    amin = round((x + b**5)**0.2, 10)
    apls = round((x - b**5)**0.2,10)

    if isinstance(amin, float) and amin.is_integer():
        print(int(amin),b)
        break
    elif isinstance(apls,float) and apls.is_integer():
        print(int(apls),-1*b)
        break

Fixed submission:
x = int(input())

b = -1
while True:
    b+=1
    amin = (x + b**5)**0.2
    apls = (x - b**5)**0.2

    if isinstance(amin, float):
        amin = round(amin,10)
        if amin.is_integer():
            print(int(amin),b)
            break
    
    if isinstance(apls,float):
        apls = round(apls,10)
        if apls.is_integer():
            print(int(apls),-1*b)
            break

Buggy python submission (verdict: Runtime Error):
x = int(input())

b = -1
while True:
    b+=1
    amin = round((x + b**5)**0.2, 5)
    apls = round((x - b**5)**0.2,5)

    if isinstance(amin, float) and amin.is_integer():
        print(int(amin),1*b)
        break
    elif isinstance(apls,float) and apls.is_integer():
        print(int(apls),-1*b)
        break
    

Fixed submission:
x = int(input())

b = -1
while True:
    b+=1
    amin = (x + b**5)**0.2
    apls = (x - b**5)**0.2

    if isinstance(amin, float):
        amin = round(amin,10)
        if amin.is_integer():
            print(int(amin),b)
            break
    
    if isinstance(apls,float):
        apls = round(apls,10)
        if apls.is_integer():
            print(int(apls),-1*b)
            break

Buggy python submission (verdict: Runtime Error):
x = int(input())

a = 0
while True:
    bmin = (x + a**5)**0.2
    bpls = (x - a**5)**0.2

    if bmin.is_integer():
        print(a,int(bmin))
        break
    elif bpls.is_integer():
        print(a,int(bpls))
        break
    
    a+=1
    print(a)

Fixed submission:
x = int(input())

b = -1
while True:
    b+=1
    amin = (x + b**5)**0.2
    apls = (x - b**5)**0.2

    if isinstance(amin, float):
        amin = round(amin,10)
        if amin.is_integer():
            print(int(amin),b)
            break
    
    if isinstance(apls,float):
        apls = round(apls,10)
        if apls.is_integer():
            print(int(apls),-1*b)
            break
Buggy python submission (verdict: Time Limit Exceeded):
import math

k = int(input())+1

sum = 0
for a in range(1,k):
    for b in range(1,k):
        for c in range(1,k):
            common = math.gcd(a,b)
            sum += math.gcd(common,c)

print(sum)

Fixed submission:
import math
k = int(input())+1

sum = 0
for a in range(1,k):
    for b in range(a,k):
        for c in range(b,k):
            tmp = math.gcd(math.gcd(a,b),c)

            if a != b and b != c and a != c:
                tmp *= 2
            if a!=b or b!=c:
                tmp *= 3
            sum += tmp

print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
r, g, b = [int(x) for x in input().split()]
times = int(input())

def check(r, g, b, times):
    while True:
        if b > g > r:
            return 'Yes'
        elif b < g:
            times -= 1
            b *= 2
        elif g < r:
            times -= 1
            g *= 2
        if times < 0:
            return 'No'

print(check(r, g, b, times))

Fixed submission:
r, g, b = [int(x) for x in input().split()]
times = int(input())

def check(r, g, b, times):
    while True:
        if b > g > r:
            return 'Yes'
        elif b <= g:
            times -= 1
            b *= 2
        elif g <= r:
            times -= 1
            g *= 2
        if times < 0:
            return 'No'

print(check(r, g, b, times))
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c,c = b.split(".")
print(int(a)*int(b)+int(a)*int(c)//100)

Fixed submission:
from decimal import Decimal
a,b = input().split()
a = Decimal(a)
b = Decimal(b)
print(int(a*b))
Buggy python submission (verdict: Time Limit Exceeded):
time = list(map(int, input().split()))
h1,m1 = time[0],time[1]
h2,m2 = time[2],time[3]
k = time[4]
ans = 0
full = (h2*60+m2) - (h1*60+m1)
while full - k !=0:
    full-=k
    ans+=k
print(ans)


Fixed submission:
h1,m1,h2,m2,k = list(map(int, input().split()))
h = h2 -h1
m = m2 - m1
print(h*60+m-k)
Buggy python submission (verdict: Time Limit Exceeded):
from sys import setrecursionlimit
setrecursionlimit(1000000)
def ans(n,l,p,c):
    if p>n:
        return ((p-n)*l[3])+c
    elif p==n:
        return c
    elif n/p <= 2:
        return min([ans(n,l,p*2,c+l[0]),ans(n,l,p*3,c+l[1]),ans(n,l,p*5,c+l[2]),((n-p)*l[3])+c])
    else:
        return min([ans(n,l,p*2,c+l[0]),ans(n,l,p*3,c+l[1]),ans(n,l,p*5,c+l[2]),ans(n,l,p+1,c+l[3])])
for _ in range(int(input())):
    n,a,b,c,d = map(int, input().split())
    Ans = ans(n,[a,b,c,d],0+1,0+d)
    print(Ans)


Fixed submission:
import sys
sys.setrecursionlimit(10**8)
T = int(input())
for _ in range(T):
    N,A,B,C,D = map(int,input().split())
    INF = float('inf')
    mem = {}
    def solve(n):
        if n==0: return 0
        if n==1: return D
        if n in mem: return mem[n]
        tmp = n*D
        if n%2==0:
            tmp = min(tmp, solve(n//2) + A)
        else:
            tmp = min(tmp, solve(n//2) + A+D, solve(n//2+1) + A+D)
        if n%3==0:
            tmp = min(tmp, solve(n//3) + B)
        else:
            d = n%3
            u = 3-d
            tmp = min(tmp, solve(n//3) + B+d*D, solve(n//3+1) + B+u*D)
        if n%5==0:
            tmp = min(tmp, solve(n//5) + C)
        else:
            d = n%5
            u = 5-d
            tmp = min(tmp, solve(n//5) + C+d*D, solve(n//5+1) + C+u*D)
        mem[n] = tmp
        return tmp
    print(solve(N))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
K = int(input())
ans = 0
for i in range(1,N+1):
    s = str(i).count("0")
    l = len(str(i))-s
    if l==K:
        ans+=1
print(ans)


Fixed submission:
from math import factorial as f
from functools import reduce
def C(n,k):
    a,b=sorted((k,n-k))
    return reduce(int.__mul__, range(b+1,n+1),1) // f(a)

def almost_everywhere_zero(v, k):
    if not v or not k: return 0
    s = str(v)
    n,d = len(s), int(s[0])
    
    if k>n: return 0
    
    below = 9**k * C(n-1,k) if n>k else 0
    return below + ( d if k==1 else (d-1) * 9**(k-1) * C(n-1,k-1) + almost_everywhere_zero(int(s[1:]), k-1) )
N = input()
K = int(input())
print(almost_everywhere_zero(N,K))
Buggy python submission (verdict: Runtime Error):
H, N= map(int, input().split())
An = list(map(int, input().split()))
if sum(An)>= H:
	print('Yes')
else:
	print('No

Fixed submission:
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
List = dict()
for i in range(N):
    X,L = map(int,input().split())
    List.update({X:L})
keys= sorted(List)
if len(List)<=1:
    print(len(List))
elif len(List)<3:
    if keys[0]+List[keys[0]]>keys[1]-List[keys[1]] or keys[1]-List[keys[1]]<keys[0]+List[keys[0]]:
        del List[keys[i]]
    print(len(List))
else:
    for i in range(1, len(keys)-1):
        if keys[i]+List[keys[i]]>keys[i+1]-List[keys[i+1]] or keys[i]-List[keys[i]]<keys[i-1]+List[keys[i-1]]:
            print(keys,keys[i],List[keys[i]],keys[i+1])
            del List[keys[i]]
    print(len(List))


Fixed submission:
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
l.sort()
nl=[]
for i in range(n):
  nl.append([l[i][0]+l[i][1],l[i][0]-l[i][1]])
nl.sort()
if n==1:
  print(1)
else:
  ans=1
  k=nl[0][0]
  for i in range(1,n):
    if k<=nl[i][1]:
      ans+=1
      k=nl[i][0]
  print(ans)
Buggy python submission (verdict: Runtime Error):
X = int(input())
t = X//2 + X
a=set(range(2,t))
l=map(lambda c:range(2*c,t,c),a)
result=a.difference(*l)
result=list(sorted(result))
matchingVals = filter(lambda x : x>X, result)
res = list(matchingVals)
print(res[0])

Fixed submission:
def check(num):
    if num > 1:
        for i in range(2, num):
            if (num % i) == 0:
                return False
                break
        else:
            return True
    else:
        return False


a = int(input())

for i in range(a, 100500):
    if check(i):
        print(i)
        break
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(a+b+c)
print(d)
if d>=22 :
    print("bust")
else:
    print("win")

Fixed submission:
a = input()
a = a.split()
result = map(lambda x: int(x), a)
res = 0
for num in result:
    res = res + num
if res>=22 :
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())
s = input().split(" ")
num_list = [int(x) for x in s]
taken_list, count = num_list.copy(), 0
for x in num_list:
    taken_list.remove(taken_list[0])
    for y in taken_list:
        count += x ^ y
print(count % (pow(10, 9)+7))

Fixed submission:
import numpy as np

MAX_DIGIT = 60
MOD = 10**9 + 7

N = int(input())
A = np.array([int(a) for a in input().split()])

answer = 0
for d in range(MAX_DIGIT + 1):
    A, r = (A>>1), A % 2
    s = int(r.sum())
    base = (1<<d) % MOD #this may be key
    answer += (base * s * (N - s)) % MOD

answer %= MOD
print(answer)
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n%2==0:
    print(str(((n)/2)/n)
else:
    print(str(((n+1)/2)/n))

Fixed submission:
n = int(input())
if n%2==0:
    print(str((n/2)/n))
else:
    print(str(((n+1)/2)/n))

Buggy python submission (verdict: Runtime Error):
n = int(input())
	if n%2 == 0;
  		y = n/2
	if round(n/2)<(n/2):
    	y=round((n+1)/2)
	print(str(y/n))

Fixed submission:
n = int(input())
if n%2==0:
    print(str((n/2)/n))
else:
    print(str(((n+1)/2)/n))

Buggy python submission (verdict: Runtime Error):
x= int(input())
y = round(x/2)
return y/x

Fixed submission:
n = int(input())
if n%2==0:
    print(str((n/2)/n))
else:
    print(str(((n+1)/2)/n))

Buggy python submission (verdict: Runtime Error):
x = round(n /2)
return x

Fixed submission:
n = int(input())
if n%2==0:
    print(str((n/2)/n))
else:
    print(str(((n+1)/2)/n))
Buggy python submission (verdict: Runtime Error):
from fractions import gcd
def result(n):
    lists = list()
    num = n
    for i in range(2, int((n**0.5//1))+1):
        if num%i==0:
            time=0
            while num%i==0:
                num //= i
                time+=1
            if not i in lists:
                lists.append(i)
    if num!=1:
        if not num in arr:
                lists.append(num)
    return lists
A , B = list(map(int,input().split()))
print(len(result(gcd(A,B)))+1)

Fixed submission:
from fractions import gcd
def result(n):
    lists = list()
    num = n
    for i in range(2, int((n**0.5//1))+1):
        if num%i==0:
            time=0
            while num%i==0:
                num //= i
                time+=1
            if not i in lists:
                lists.append(i)
    if num!=1:
        if not num in lists:
                lists.append(num)
    return lists
A , B = list(map(int,input().split()))
print(len(result(gcd(A,B)))+1)

Buggy python submission (verdict: Runtime Error):
import math
def result(n):
    lists = list()
    num = n
    for i in range(2, int((n**0.5//1))+1):
        if num%i==0:
            time=0
            while num%i==0:
                num //= i
                time+=1
            if not i in lists:
                lists.append(i)
    if num!=1:
        if not num in arr:
                lists.append(num)
    return lists
A , B = list(map(int,input().split()))
print(len(result(math.gcd(A,B)))+1)

Fixed submission:
from fractions import gcd
def result(n):
    lists = list()
    num = n
    for i in range(2, int((n**0.5//1))+1):
        if num%i==0:
            time=0
            while num%i==0:
                num //= i
                time+=1
            if not i in lists:
                lists.append(i)
    if num!=1:
        if not num in lists:
                lists.append(num)
    return lists
A , B = list(map(int,input().split()))
print(len(result(gcd(A,B)))+1)
Buggy python submission (verdict: Runtime Error):
if input() > 30:
  print("Yes")
else:
  print("No")

Fixed submission:
if int(input()) >= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input(). split ()))
if 0 in A:
	print(0)
	return
prod = 1
for a in A:
	prod *= a
	if prod > 1000000000000000000:
		print(-1)
		return
print(prod)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 1

for i in range(n):
  ans *= a[i]
  if ans > 10 ** 18:
    ans = -1
    break

print(ans)

Buggy python submission (verdict: Runtime Error):
def main ():
N = int(input())
A = list(map(int,input(). split ()))
if 0 in A:
print(0)
return
prod = 1
for a in A:
prod *= a
if prod > 1000000000000000000:
print(-1)
return
print(prod)
main ()

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 1

for i in range(n):
  ans *= a[i]
  if ans > 10 ** 18:
    ans = -1
    break

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = map(int,input().split())
ans = 1

for i in a:
  ans *= i

if ans > 10 ** 18:
  ans = -1

print(ans)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 1

for i in range(n):
  ans *= a[i]
  if ans > 10 ** 18:
    ans = -1
    break

print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = input()
b = input()
c = input()

t = n * 2;

for i in range(n):
    if a[i] == b[i] : t -= 1
    if b[i] == c[i] : t -= 1
    if c[i] == a[i] : t -= 1
    
    if a[i] == b[i] and b[i] == c[i] and c[i] == a[i] : t += 1
    
print(t)

Fixed submission:
n , x , y = map(int , input().split())

min = x + y - n
if min < 0 : min = 0

if x < y : print (str(x) + " " + str(min))
else : print(str(y) + " " + str(min))
Buggy python submission (verdict: Runtime Error):
c = input()
if c>=A and c<=Z:
    print('A')
else:
    print('a')

Fixed submission:
c = input()
if c>='A' and c<='Z':
    print('A')
else:
    print('a')
Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
ans = 1
for i in range(1,n+1):  
    if(i%2==0):
        continue
    count=0
    for j in range(1,i+1):
        if(i%j == 0):
            count += 1
    if(count == 7):
            ans+=1
print(ans)

import numpy as np
n = int(input())
ans =0
for i in range(1,n+1):  
    if(i%2==0):
        continue
    count=0
    for j in range(1,i+1):
        if(i%j == 0):
            count += 1
    if(count == 7):
            ans+=1
print(ans)




Fixed submission:
import numpy as np
n = int(input())
ans =0
for i in range(1,n+1):  
    if(i%2==0):
        continue
    count=0
    for j in range(1,i+1):
        if(i%j == 0):
            count += 1
    if(count == 8):
            ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
import numpy as np
n = int(input())
for i in range(n):  
    if(n%2==0):
        break
    count=0
    for j in range(2,int(np.sqrt(i))+1):
        if(i%j == 0):
            count += 1
        if(count == 7):
            break
print(count)



Fixed submission:
import numpy as np
n = int(input())
ans =0
for i in range(1,n+1):  
    if(i%2==0):
        continue
    count=0
    for j in range(1,i+1):
        if(i%j == 0):
            count += 1
    if(count == 8):
            ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
count=0
for i in range(2,sprt(n)+1):
    if(n%i == 0):
        count += 1
    if(count == 7):
        break
print(count)



Fixed submission:
import numpy as np
n = int(input())
ans =0
for i in range(1,n+1):  
    if(i%2==0):
        continue
    count=0
    for j in range(1,i+1):
        if(i%j == 0):
            count += 1
    if(count == 8):
            ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
D,T,S = map(int,input.split())
if D/S <= T:
  print("Yes")
else:
  print("No")

Fixed submission:
D,T,S = map(int, input().split())
if D/S <= T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
D,T,S = map(int,input(),slpit())
if D/S <= T:
  print("Yes")
else:
  print("No")
  

Fixed submission:
D,T,S = map(int, input().split())
if D/S <= T:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
D = input()
T = input()
S = input()

D = int(D)
T = int(T)
S = int(S)

if D/S <= T:
  print(Yes)
else:
  print(No)
  

Fixed submission:
D,T,S = map(int, input().split())
if D/S <= T:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s=input()
t=input()

count_min = 1000

for i in range(len(s)-len(t)+1):
  count = 0
  for j in range(len(t)):
    if s[i+j] != t[j]:
      count++
  if count < count_min:
    count_min = count

print(count_min)      

Fixed submission:
s=input()
t=input()

count_min = 1000

for i in range(len(s)-len(t)+1):
  count = 0
  for j in range(len(t)):
    if s[i+j] != t[j]:
      count+=1 
  if count < count_min:
    count_min = count

print(count_min)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

count = 0
temp = a[0]

for i in range(n):
  if a[i] >= temp:
    temp = a[i]
  else:
    count += temp - a[i]
print(count)

Fixed submission:
N,X,T = map(int,input().split())
if N % X == 0:
  print(int(T*N/X))
else:
  print(T*(N//X+1))
Buggy python submission (verdict: Runtime Error):
N = input()
len_N = len(N)
N = int(N)
count = 0

for i in range(len_N):
  count += N[i]
if count%9 == 0:
  print("Yes")
else:
  print("No")

Fixed submission:
N = input()
len_N = len(N)
count = 0

for i in range(len_N):
  count += int(N[i])
if count%9 == 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
count = 0
for i in n-1:
  if a[i+1] < a[i]:
    count += a[i] - a[i+1]
print(count)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))

count = 0
temp = a[0]

for i in range(n):
  if a[i] >= temp:
    temp = a[i]
  else:
    count += temp - a[i]
print(count)
Buggy python submission (verdict: Runtime Error):
d,t,s=input().split()
if(s>=(d/t)):
    print("Yes")
else:
    print("No")

Fixed submission:
d,t,s=map(int,input().split())
if(s>=(d/t)):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
c=b+b
if(a-b!=0):
    print(int(a-b))
else:
    print(0)



Fixed submission:
a,b=[int(a)for a in input().split()]

c=b+b
if(a-c!=0)and(a-c>=0):
    print(a-c)
else:
    print(0)

#print(type(c))
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()

T=1000
ans = 0
for i in range(len(a)-len(b)+1):
  for j in range(len(b)):
    if a[i+j]=!b[j]:
      ans +=1
      ans = min(T, ans)
print(ans)
        
  

Fixed submission:
a = input()
b = input()

T=1000

for i in range(len(a)-len(b)+1):
  ans = 0
  for j in range(len(b)):
    if a[i+j]!=b[j]:
      ans +=1
  T = min(T, ans)
print(T)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int,input().split()))

ans = 0

for i in range(n-1):
  if l[i+1]<=max(l[0:i+1]):
    ans+= max(l[0:i+1])-l[i+1]
    
print(ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))

ans = 0

for i in range(n-1):
  if l[i+1]<l[i]:
    ans+= l[i]-l[i+1]
    l[i+1]=l[i]
    
print(ans)
Buggy python submission (verdict: Runtime Error):
x, k, d = map(int,input().split())
x =abs(x)
s = x//d
if x-k*d>0:
  print(x-k*d>0)
else:
    if (K-s)%2==0:
        print(X-s*D)
    else:
        print(-X+(s+1)*D)


Fixed submission:
x, k, d = map(int,input().split())
x =abs(x)
s = x//d
if x-k*d>0:
  print(x-k*d)
else:
    if (k-s)%2==0:
        print(x-s*d)
    else:
        print(-x+(s+1)*d)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int,input().split()))

ans=1
for i in range(n):
  ans*=l[i]

if ans-10**18>0:
  print(-1)
else:
  print(ans)
        
      
        
        
  

Fixed submission:
def main():
  n = int(input())
  l = list(map(int,input().split()))

  if 0 in l:
    print(0)
    return
  
  ans=1
  for i in range(n):
    ans*=l[i]
    if ans> 10**18:
      print(-1)
      return
    
  print(ans)
        
main()
Buggy python submission (verdict: Runtime Error):
a,b,c,k= map(int,input().split())

if a+b>=k:
  print(min(a,k))
else:
  print(2*a+b-k)

Fixed submission:
s= input()
t=input()

if t[:-1]==s:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a=[input() for i in range(n)]
print(len(set(a))

Fixed submission:
n = int(input())
a=[input() for i in range(n)]
print(len(set(a)))
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())

a1 =a//0.08
a2 =(a+1)//0.08
b1 = b//0.1
b2= (b+1)//0.1

A=range(a1,a2+1)
B=range(b1,b2+1)

if set(A)&set(B)==set():
  print(-1)
else:
  C = set(A)&set(B)
  print(min(C))

Fixed submission:
a, b = map(int,input().split())
ans = -1
for i in range(10):
    num = 10*b + i
    if a <= num*0.08 < a+1:
        ans = num
        break
print(ans)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
H = sorted(list(map(int, input().split())))
print(sum([0] + H[:-K]) if K > 0 else sum(H))


Fixed submission:
H, A = map(int,input().split())

ans = 0

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

print(ans)

Buggy python submission (verdict: Runtime Error):
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)


Fixed submission:
H, A = map(int,input().split())

ans = 0

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

print(ans)

Buggy python submission (verdict: Runtime Error):
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]))

Fixed submission:
H, A = map(int,input().split())

ans = 0

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

print(ans)

Buggy python submission (verdict: Runtime Error):
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))

Fixed submission:
H, A = map(int,input().split())

ans = 0

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

print(ans)

Buggy python submission (verdict: Runtime Error):
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))

Fixed submission:
H, A = map(int,input().split())

ans = 0

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

print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())

if a=b:
   print('Yes')
else:
  print('No')

Fixed submission:
a,b = map(int, input().split())
     
if a==b:
   print('Yes')
else:
   print('No')
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

print(t+s)

Fixed submission:
S,T=input().split()
print(T+S)
Buggy python submission (verdict: Runtime Error):
n,k,q = map(int,input().split())
l= [int(input()) for i in range(q)]
x=[k-q]*n
for i in range(q):
  x[l[i-1]]+=1
for i in range(n):
  if x[i]>0: 
    print("Yes")
  else:
    print("No")

Fixed submission:
n,k,q = map(int,input().split())
l= [int(input()) for i in range(q)]
x=[k-q]*n
for i in range(q):
  x[l[i]-1]+=1
for i in range(n):
  if x[i]>0: 
    print("Yes")
  else:
    print("No")
Buggy python submission (verdict: Runtime Error):
if C >= A -B:
  print(C - A + B)
else:
  Print(0)


Fixed submission:
a, b, c = map(int, input().split())

print(c-a+b if c > a-b else 0)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

print((a+b)//2 if (a+b)% == 0 else 'IMPOSSIBLE')

Fixed submission:
a, b = map(int, input().split())
     
if (a + b) / 2 == (a + b) // 2:
	print(int((a + b) / 2))
else:
	print('IMPOSSIBLE')