Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

x = [0] * M
y = [0] * M
c = [0] * M

min = 99999999

for i in range(M):
    x[i], y[i], c[i] = map(int, input().split())
    cost = a[x[i] - 1] + b[y[i] - 1] - c[i]
    if cost < min:
        min = cost

for i in range(A):
    if a[i] > cost:
        continue
    for j in range(B):
        if b[j] > cost:
            break
        cost = a[i] + b[j]
        if cost < min:
            min = cost

print(min)

Fixed submission:
input = input()

if len(input) % 2:
    print("No")
    exit(0)

result = "Yes"
isHi = False
for i in range(len(input)-1):
    if isHi:
        isHi = False
        continue;

    str = input[i] + input[i+1]
    if str != "hi":
        result = "No"
        break

    isHi = True

print(result)

Buggy python submission (verdict: Runtime Error):
import re
index = re.search(r'.*(hi)+.*, input())
if index:
    print("Yes")
else:
    print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
import re
index = re.match(r'*(hi)+*', input())
if index:
    print("Yes")
else:
    print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
import re
index = re.search(input(),(hi)+)
if index:
    print("Yes")
else:
    print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
import re
index = re.search(input(),'hi')
if index != -1:
    print("Yes")
else if :
    print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
if ("hi" in str(S)):
  print("Yes")
else:
  print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
if ("hi" in S):
  print("Yes")
else:
  print("No")

Fixed submission:
import re
index = re.fullmatch(r'(hi)+', input())
if index:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
P=[(int(x)+1)/2 for x in input().split()]
max=0
for i in range(N-K+1):
    kitai=0
    for k in range(K):
        kitai+=P[i+k]
    if max<kitai:
        max=kitai
print(max)


Fixed submission:
N,K = map(int, input().split())
P=[(float(x)+1)/2 for x in input().split()]
#print(P)
max=0
kitai=0
for i in range(K):
    kitai+=P[i]
max=kitai
for i in range(N-K):
    kitai-=P[i]
    kitai+=P[i+K]
    if max<kitai:
        max=kitai
print(max)
Buggy python submission (verdict: Runtime Error):
L,R=map(int,input().split())
min=2019
for i in range(L,R+1):
    for k in range(i+1,R+1):
        mod=(i*k)%2019
        if mod==0:
            min=0
            break
        if mod<min:
            min=mod
        else:
            continue
    	break
print(min)


Fixed submission:
L,R=map(int,input().split())
min=2019
for i in range(L,R+1):
    for k in range(i+1,R+1):
        mod=(i*k)%2019
        if mod<min:
            min=mod
        if mod==0:
            min=0
            break
    else:
        continue
    break
print(min)
Buggy python submission (verdict: Runtime Error):
 input = input()
 if len(input.replace("hi", "")) == 0:
  
    print("Yes")
 else
    print("No")


Fixed submission:
input = input()
if len(input.replace("hi", "")) == 0:
  
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a = int(raw_input())
print(48 - a)

Fixed submission:
import fileinput
for line in fileinput.input():
    print(48 - int(line))
Buggy python submission (verdict: Runtime Error):
n = int(input())

if 'hi' in n:
  print("Yes")
else:
  print("No")

Fixed submission:
n = raw_input()

length = len(n)
if length % 2 == 0:
  if n.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
ab = input().split(" ")
a = int(ab[0])
b = int(ab[1])


def check(a,b):
	if (a>9 or b>9):
		return -1
	else
		return a*b

print(check(a,b))


Fixed submission:
ab = input().split(" ")
a = int(ab[0])
b = int(ab[1])


def check(a,b):
	if (a>9 or b>9):
		return -1
	else:
		return a*b
ans = check(a,b)
print(ans)
Buggy python submission (verdict: Runtime Error):
nk = input().split(' ')
n = int(nk[0])
k = int(nk[1])
a = input().split(' ')
count = 0
sum = 0
for i in range(n):
#  print(i)
  sum = int(a[i])
  j = i+1
  if k<=sum :
    count = count + 1
  while j<n:
    sum = sum + int(a[j])
  #  print("sum:{} j:{} a[j]:{}".format(sum,j,a[j]))
    if k<=sum :
      count = count + 1
  #    print("sum:{} count:{}".format(sum,count))
    j += 1

print("{}".format(count))


Fixed submission:
xa = input().split(" ")
x = int(xa[0])
a = int(xa[1])

if x<a:
  print("0")
elif a<=x:
  print("10")
else:
  print("error")
Buggy python submission (verdict: Runtime Error):
import copy
n=int(input())
a=[]
for i in range(n):
  item = int(input())
  a.append(item)
count = 0
t = True
while t:
  b=[]
  for j in a:
    if j%2==0:
      b.append(j/2)
    elif j<2:
      t=False
    else:
      t=False
  if t== False:
    break
  count = coutn +1
  a=copy.deepcopy(b)
print(count)

    
        

Fixed submission:
import copy
n=int(input())
a=input().split(" ")
count = 0
t=True
while t:
  b=[]
  for j in a:
    if int(j)%2 == 0:
      b.append(int(j)/2)
    elif int(j)<2:
      t=False
    else:
      t=False
  if t==False:
    break
  count = count+1
  a=copy.deepcopy(b)
print(count)
Buggy python submission (verdict: Runtime Error):
# coding: utf-8


def main():
    n = int(input())
    point = list(map(int, input().split(' ')))    

    max_point = max(point)
    min_point = min(point)
    min_sums = []
    for p in range(min_point, max_point + 1):
        sum_ = 0
        for x in numbers:
            sum_ += (x - p) ** 2
        min_sums.append(sum_)

    print(min(min_sums))

    return 0


if __name__ == '__main__':
    main()

Fixed submission:
# coding: utf-8


def main():
    n = int(input())
    numbers = list(map(int, input().split(' ')))    

    max_number = max(numbers)
    min_number = min(numbers)
    min_sums = []
    for p in range(min_number, max_number + 1):
        sum_ = 0
        for x in numbers:
            sum_ += (x - p) ** 2
        min_sums.append(sum_)

    print(min(min_sums))

    return 0


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys


def main():
  n = int(input())
  a = int(input())
  b = n // a
  

  if (n - b * 500) <= a:
    print('Yes')
  
  else:
    print('No')
  
  return 0


if __name__ == '__main__':
  main()

Fixed submission:
# coding: utf-8
import sys


def main():
  n = int(input())
  a = int(input())
  
  if n % 500 != 0 and a == 0:
    print('No')
  
  elif (n - (n // 500) * 500) <= a:
    print('Yes')
    
  else:
    print('No')
  
  return 0


if __name__ == '__main__':
  main()
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
import sys

def main(argv=sys.argv):
  
  dict = {input().split()}
  print(dict)
  
  return 0


if __name__ == '__main__':
  sys.exit(main())

Fixed submission:
# coding: utf-8
import sys
 
def main(argv=sys.argv):
  
  set1 = set(input().split())
  print(len(set1))
  
  return 0
 
 
if __name__ == '__main__':
  sys.exit(main())
Buggy python submission (verdict: Runtime Error):
S, T= input().split()
A, B= map(int, input().split())
U= input().split()
 
if (S==U):
    print(A-1,B)
else if (T==U):
    print(A,B-1)
else:
    print(A,B)

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Buggy python submission (verdict: Runtime Error):
S, T= input().split()
A, B= map(int, input().split())
U= input().split()
 
if (S==U):
    print(A-1,B)
else if (T==U):
    print(A,B-1)

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Buggy python submission (verdict: Runtime Error):
S,T=input().split()
A,B=map(int, input().split())
U=input().split()
if(S==U):print(A-1,B)
else if(T==U):print(A,B-1)

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Buggy python submission (verdict: Runtime Error):
S, T= input().split()
A, B= map(int, input().split())
U= input().split()

if (S==U):
    print(str(A-1) B)
else:
    print(A str(B-1))

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Buggy python submission (verdict: Runtime Error):
S, T= input().split()
A, B= map(int, input().split())
U= input().split()

if (S==U):
    print(A-1 B)
else:
    print(A B-1)

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)

Buggy python submission (verdict: Runtime Error):
S, T= input().split()
A, B= int(input().split())
U= input().split()

if (S==U):
    print(A-1 B)
else:
    print(A B-1)

Fixed submission:
S, T= input().split()
A, B= map(int, input().split())
U= input()
if (S == U):
    print(A-1,B)
elif (T == U):
    print(A,B-1)
else:
    print(A,B)
Buggy python submission (verdict: Runtime Error):
import re
S = int(input())
print(re.sub(r"[a-z]", "x", S)) 

Fixed submission:
import re
s = input()
print(re.sub(r"[a-z]", "x", s))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
l = [e, d, c, b, a]
de = e - d
ce = e - c
cd = d - c
be = e - b
bd = d - b
bc = c - b
ae = e - a
ad = d - a
ac = c - a
ab = b - a
distance = [ab, ac, ad, ae, bc, bd,be, cd, ce, de]
output = []
ok = 'Yay!'
bad = ':('
for i in distance:
    if i >= k:
        output.append(bad)
    else i < k:
        output.append(ok)
if bad in output:
    print(bad)
elif ok in output:
    print(ok)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
de = e - d
ce = e - c
cd = d - c
be = e - b
bd = d - b
bc = c - b
ae = e - a
ad = d - a
ac = c - a
ab = b - a
distance = [ab, ac, ad, ae, bc, bd, be, cd, ce, de]
output = []
ok = 'Yay!'
bad = ':('
for i in distance:
    if i > k:
        output.append(bad)
    elif i <= k:
        output.append(ok)
if bad in output:
    print(bad)
elif ok in output:
    print(ok)
Buggy python submission (verdict: Time Limit Exceeded):
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]

ans = 0
be = 0

for i in range(a[0]-a[1]+1):
    sum = 0
    if be < b[i+a[1]-1]:
        for j in range(a[1]):
            sum += (1 + b[i+j])/2
        if ans < sum:
            ans = sum
    be = b[i]

print(ans)

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

sum = 0
ans = 0

for i in range(a[0]):
    sum += (1 + b[i])/2
    if i > a[1]-1:
        sum -= (1 + b[i-a[1]])/2
    if ans < sum:
        ans = sum

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
a = input().split()
b = input().split()

ans = 0
be = 0

for i in range(int(a[0])-int(a[1])+1):
    sum = 0
    if be < int(b[i+int(a[1])-1]):
        for j in range(int(a[1])):
            sum += (1 + int(b[i+j]))/2
        if ans < sum:
            ans = sum
    be = int(b[i])

print(ans)

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

sum = 0
ans = 0

for i in range(a[0]):
    sum += (1 + b[i])/2
    if i > a[1]-1:
        sum -= (1 + b[i-a[1]])/2
    if ans < sum:
        ans = sum

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
a = input().split()
b = input().split()

ans = 0

for i in range(int(a[0])-int(a[1])+1):
    sum = 0
    for j in range(int(a[1])):
        sum += (1 + int(b[i+j]))/2
    if ans < sum:
        ans = sum

print(ans)

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

sum = 0
ans = 0

for i in range(a[0]):
    sum += (1 + b[i])/2
    if i > a[1]-1:
        sum -= (1 + b[i-a[1]])/2
    if ans < sum:
        ans = sum

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
a = input().split()
b = input().split()

exlist = []

for i in range(int(a[0])):
    exlist.append((1 + int(b[i]))/2)

ans = 0

for i in range(int(a[0])-int(a[1])+1):
    sum = 0
    for j in range(int(a[1])):
        sum += exlist[i+j]
    if ans < sum:
        ans = sum

print(ans)

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

sum = 0
ans = 0

for i in range(a[0]):
    sum += (1 + b[i])/2
    if i > a[1]-1:
        sum -= (1 + b[i-a[1]])/2
    if ans < sum:
        ans = sum

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
a = input().split()
b = input().split()

exlist = []

for i in range(int(a[0])):
    sum = 0
    for j in range(int(b[i])+1):
        sum += j
    exlist.append(sum/int(b[i]))

ans = 0

for i in range(int(a[0])-int(a[1])+1):
    sum = 0
    for j in range(int(a[1])):
        sum += exlist[i+j]
    if ans < sum:
        ans = sum

print(ans)


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

sum = 0
ans = 0

for i in range(a[0]):
    sum += (1 + b[i])/2
    if i > a[1]-1:
        sum -= (1 + b[i-a[1]])/2
    if ans < sum:
        ans = sum

print(ans)
Buggy python submission (verdict: Runtime Error):
A,B,M=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
mi=min(a)+min(b)
for i in range(0,M):
  Data=list(map(int, input().split()))
  wari=a[Data[0]]+b[Data[1]]-Data[2]
  if(mi>wari):
    mi=wari
print(mi)

Fixed submission:
A,B,M=list(map(int, input().split()))
a=list(map(int, input().split()))
b=list(map(int, input().split()))
mi=min(a)+min(b)
for i in range(0,M):
  Data=list(map(int, input().split()))
  wari=a[Data[0]-1]+b[Data[1]-1]-Data[2]
  if(mi>wari):
    mi=wari
print(mi)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# 文字列の入力
a = int(input())
li = list(map(int, input().split()))
li2 = []

for i in range(a):
    li2.append(li[i])

if len(li2) != len(set(li2)):
    print('NO')
else:
    print('YES')


Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
a, b = map(str, input().split())
# スペース区切りの整数の入力
c, d = map(int, input().split())
# 文字列の入力
e = str(input())

if a == e:
    c = c - 1
elif b ==e:
    d = d - 1
    
# 出力
print("{} {}".format(c, d))
Buggy python submission (verdict: Runtime Error):
money,sum=int(input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=int(input().split())
sum=int(input())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=int(input())
sum=int(input())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=input()
sum=input()
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')
return 0

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=input()
sum=input()
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=input()
sum=input()
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')


Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
money=input()
sum=input()
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Fixed submission:
money,sum=map(int,input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
ta,ao,N= map(int,input().split())
#li = [int(x) for x in input().split()]
for i in range(N):
  if ta>0:
    ta-=1
  elif ao>0: 
    ao-=1
  elif (ta==0 & ao==0):
    break
    
print(str(ta)+" "+str(ao))

Fixed submission:
import sys
import math
ta,ao,N= map(int,input().split())
#li = [int(x) for x in input().split()]
N=N-ta
if N>0:
  ta=0
  N=N-ao
  if N>0:
    print("0 0")
    sys.exit()
  else:
    ao=abs(N)
else:
  ta=abs(N)

    
print(str(ta)+" "+str(ao))
Buggy python submission (verdict: Time Limit Exceeded):
N,A,B=map(int,input().split())
total=(10 ** 100) + 1

for i in range(total):
  if N <= i*A + i*B :
    if N >= i*A + (i-1)*B :
      ans=i*A
      break
    else :
      ans=i*A - (i*A+(i-1)*B - N)
      break
print(ans)

Fixed submission:
import math

N,A,B=map(int,input().split())
total=(10 ** 100) + 1

firstCnt=math.floor(N/(A+B))

for i in range(firstCnt,total):
  if N <= i*A + i*B :
    if N >= i*A + (i-1)*B :
      ans=i*A
      break
    else :
      ans=i*A - (i*A+(i-1)*B - N)
      break
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N,A,B=map(int,input().split())
total=(10 ** 100) + 1
lengthCnt=0
lengthA=0
lengthB=0
for i in range(total):
  if i % 2 == 0:
    lengthCnt += A
    lengthA += A
    if lengthCnt >= N :
      ans = lengthA - (lengthCnt - N)
      break
  else :
    lengthCnt += B
    lengthB += B
    if lengthCnt >= N :
      ans = lengthA
      break
      
print(ans)

Fixed submission:
import math

N,A,B=map(int,input().split())
total=(10 ** 100) + 1

firstCnt=math.floor(N/(A+B))

for i in range(firstCnt,total):
  if N <= i*A + i*B :
    if N >= i*A + (i-1)*B :
      ans=i*A
      break
    else :
      ans=i*A - (i*A+(i-1)*B - N)
      break
print(ans)
Buggy python submission (verdict: Runtime Error):
N = input()
a = input()
mylist = list(map(int, a.split(" ")))
for i in range(N+1):
  if mylist[i] % 2 == 0:
    if mylist[i] % 3 != 0 and mylist[i] % 5 != 0:
      print("DENIED")
    else:
      return
  print("APPROVED")
      


Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print(Yes)
elif (A == C and B != C):
  print(Yes)
elif (B == C and A != B):
  print(Yes)
else:
  print(No)


Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B & B != C):
  print(Yes)
elif (A == C & B != C):
  print(Yes)
elif (B == C & A != B):
  print(Yes)
else:
  print(No)

Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]

if (A == B & B != C) or (A == C & B != C) or (B == C & B != A):
  print(Yes)
else:
  print(No)
 


Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
def check(a,b,c):
  if (a == b & b != c) or (a == c & b != c) or (b == c & b != a):
    print(Yes)
  else:
    print(No)

check(A,B,C)

Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
def check(a,b,c):
  if (a == b & b != c) or (a == c & b != c) or (b == c & b != a):
    print(Yes)
  else:
    print(No)
    

Fixed submission:
a = input()
mylist = list(map(int, a.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B and B != C):
  print("Yes")
elif (A == C and B != C):
  print("Yes")
elif (B == C and A != B):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
mylist = list(map(int, myinput.split(" ")))
H = mylist[0]
A = mylist[1]
x = 0
while H >0:
  H -= A
  x += 1
print(x)

Fixed submission:
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:
  answer = H//A
print(answer)

Buggy python submission (verdict: Runtime Error):
mylist = list(map(int, myinput.split(" ")))
H = mylist[0]
A = mylist[1]
H // A = C
print(C)
        

Fixed submission:
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:
  answer = H//A
print(answer)

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


Fixed submission:
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:
  answer = H//A
print(answer)

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

Fixed submission:
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:
  answer = H//A
print(answer)
Buggy python submission (verdict: Runtime Error):
myinput = input()
myinput_H = input()
mylist = list(map(int, myinput.split(" ")))
N = int(mylist[0])
K = int(mylist[1])
list_H = list(map(int, myinput_H.split(" ")))
for i in range(K):
    list_H.remove(max(list_H))
sum = sum(list_H)
print(sum)

Fixed submission:
myinput = input()
myinput_H = input()
mylist = list(map(int, myinput.split(" ")))
N = mylist[0]
K = mylist[1]
list_H = list(map(int, myinput_H.split(" ")))
if N - K <= 0:
    print(0)
else:
    x = N - K
    list_H.sort()
    l = list_H[0:x]
    sum = sum(l)
    print(sum)