Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import re
a = input()
b = re.compile('^([^L][^R])*[^L]?$')
if b.match(a):
print('Yes')
else:
print('No')


Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import re
a=input()
b=re.compile('^([^L][^R])*[^L]?$')
if b.match(a):
print('Yes')
else:
print('No')


Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import Re
a=input()
b=re.compile('^([^L][^R])*[^L]?$')
if a.match(b):
print('Yes')
else:
print('No')


Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import Re
a=input()
b=re.compile('^[^L][^R]*[^L]?$')
if a.match(b):
print('Yes')
else:
print('No')

Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import Re
a=input()
b=re.compile('^[^L][^R]*[^L]?$')
if a.match(b)
print('Yes')
else
print('No')


Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import Re
a=input()
b=re.compile('^([^L][^R]*[^L]?)$')
if a.match(b)
print('Yes')
else
print('No')

Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile('^([^L][^R])*[^L]?$')
if match(a,b):
    print('Yes')
else:
    print('No')


Fixed submission:
import re #与えられた条件にマッチする文字列か判定
a = input()
b = re.compile(r'^([^L][^R])*[^L]?$')
if b.match(a):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a=int,input()
print(a^3)

Fixed submission:
a=int(input())
print(a*a*a)
Buggy python submission (verdict: Runtime Error):
A,B=map(int(),input().split())
number1=A+B
number2=A-B
number3=A*B
print(max([number1,number2,number3]))

Fixed submission:
A,B=map(int,input().split())
a=A+B
b=A-B
c=A*B
print(max(a,b,c))
Buggy python submission (verdict: Runtime Error):
a = int(input())
print("{}".format(3*a*a)

Fixed submission:
r = int(input())
#rを定義してる
print("{}".format(3*r*r))
#出力したんや

Buggy python submission (verdict: Runtime Error):
a = int(input())
print("{}".Format(3*a*a))

Fixed submission:
r = int(input())
#rを定義してる
print("{}".format(3*r*r))
#出力したんや

Buggy python submission (verdict: Runtime Error):
N,D = map(int,input().split())
a = N//(2*D+1)
if N%(2*D+1) == 0:
	print(a)
else:
 	print(a+1)


Fixed submission:
r = int(input())
#rを定義してる
print("{}".format(3*r*r))
#出力したんや

Buggy python submission (verdict: Runtime Error):
N,D = map(int,input().split())
a = (N-1)/(2*D)
if (N-1)%(2*D) == 0:
	print(a)
else:
 	print((N-1)//(2*D+1))


Fixed submission:
r = int(input())
#rを定義してる
print("{}".format(3*r*r))
#出力したんや
Buggy python submission (verdict: Runtime Error):
N,D = map(int,input(),split())
a = (N-1)//(2*D)
if (N-1)%(2*D) == 0:
	print(a)
else:
 	print((N-1)//(2*D+1))


Fixed submission:
N,D = map(int,input().split())
a = N//(2*D+1)
if N%(2*D+1) == 0:
	print(a)
else:
 	print(a+1)

Buggy python submission (verdict: Runtime Error):
N,D = map(int,input(),split())
a = (N-1)/(2*D)
if (N-1)%(2*D)==0:
	print(a)
else:
 	print((N-1)//(2*D+1))


Fixed submission:
N,D = map(int,input().split())
a = N//(2*D+1)
if N%(2*D+1) == 0:
	print(a)
else:
 	print(a+1)

Buggy python submission (verdict: Runtime Error):
N,D = map(int,input(),split()))
a = (N-1)/(2*D)
if (N-1)%(2*D)==0:
	print(a)
else :
 	print((N-1)//2*D+1)

Fixed submission:
N,D = map(int,input().split())
a = N//(2*D+1)
if N%(2*D+1) == 0:
	print(a)
else:
 	print(a+1)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
d = a*b
if d>c:
print("{}".format(c))
else:
print("{}".format(d))


Fixed submission:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
d = a*b
if d>c:
print('c')
else:
print('d')


Fixed submission:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
d = a*b
if d>c:
print('c')
else if:
print('d')


Fixed submission:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
d = a*b
if d > c:
print('c')
else if:
print('d')


Fixed submission:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
d = a*b
if d>c
print("{}".format(c))
else if
print("{}".format(d))


Fixed submission:
a,b,c = map(int,input().split())
d = a*b
if d>c:
	print(c)
else:
	print(d)
Buggy python submission (verdict: Runtime Error):
b, c = map(int, input().split())
if b<c :
  print("0")
else if :
  print("10")
  


Fixed submission:
b, c = map(int, input().split())
num1 = 0
num2 = 10
if b<c:
  print(str(num1))
else:
  print(str(num2))

Buggy python submission (verdict: Runtime Error):
b, c = map(int, input().split())
if b<c:
  print("0")
else if:
  print("10")
  

Fixed submission:
b, c = map(int, input().split())
num1 = 0
num2 = 10
if b<c:
  print(str(num1))
else:
  print(str(num2))
Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,input().split()))
print(z,x,y)

Fixed submission:
x,y,z=map(int,input().split())
print(z,x,y)
Buggy python submission (verdict: Runtime Error):
s = input()

if((s[3]==s[4]) and (s[5]==s[6])):
  	print("Yes")
else:
	print("No")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s = input()

if((s[3]==s[4]) and (s[5]==s[6])):
  	print("yes")
else:
	print("no")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()

if (s[3]==s[4] and s[5]==s[6]):
	print("yes")
	else:
    print("no")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()

if s[3]==s[4] and s[5]==s[6]:
	print("sはcoffeeと似ています")
	else:
    print("sはcoffeeと似ていません")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()

if s[3]==s[4] and s[5]==s[6];
	print("sはcoffeeと似ています")
	else;
    print("sはcoffeeと似ていません")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()

if s[3]==s[4] and s[5]==s[6];
	print("sはcoffeeと似ています")
	else
    print("sはcoffeeと似ていません")


Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
s=input()

if s[3]==s[4] and s[5]==s[6]
	print("sはcoffeeと似ています")
	else
    print("sはcoffeeと似ていません")

Fixed submission:
s = input()

if((s[2]==s[3]) and (s[4]==s[5])):
  	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
X,Y,Z = map(int, input().split(" "))

A = int(Z)
B = int(X)
C = int(Y)

print(f"{A} {B} {C}")

Fixed submission:
X,Y,Z = map(int, input().split(" "))

A = int(Z)
B = int(X)
C = int(Y)

print(str(A) + " " + str(B) + " " + str(C))

Buggy python submission (verdict: Runtime Error):
X,Y,Z = map(int, input().split())

A = int(Z)
B = int(X)
C = int(Y)

print(f"{A} {B} {C}")


Fixed submission:
X,Y,Z = map(int, input().split(" "))

A = int(Z)
B = int(X)
C = int(Y)

print(str(A) + " " + str(B) + " " + str(C))
Buggy python submission (verdict: Runtime Error):
N,M = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
B = []

#総投票数を求める
sum_vote = sum(A)
#print(sum_vote)

#投票数が1/4Mを下回る物を削除していく つまり　新しいリストに代入
for i in range(len(A)):
    if A[i] => sum_vote * 1/(4 * M):
        B.append(A[i])
    else:
        pass

#最終判断
if len(B) >= M:
    print("Yes")
else:
    print("No")

Fixed submission:
N,M = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
B = []

#総投票数を求める
sum_vote = sum(A)
#print(sum_vote)

#投票数が1/4Mを下回る物を削除していく つまり　新しいリストに代入
for i in range(len(A)):
    if A[i] >= sum_vote * 1/(4 * M):
        B.append(A[i])
    else:
        pass

#最終判断
if len(B) >= M:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
# %%
N,K = map(int ,input().split(" "))
list1 = []

#差分して絶対値を求める関数
def abs_ded(A,B):
    return abs(A-B)

#繰り返して、リストに代入していく関数
def make_list(A,B):
    list1.append(abs_ded(A,B))
    while 1:
        key = abs_ded(list1[-1],B)
        if key <= B:
            if key >= list1[-1]:
                answer = list1[-1]
                break
            else:
                list1.append(key)
    
    print(answer)

make_list(N,K)

Fixed submission:
N,K = map(int ,input().split(" "))

a = N % K
b = K - a

if(a>b):
    print(b)
else:
    print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int ,input().split(" "))
list1 = []

#差分して絶対値を求める関数
def abs_ded(A,B):
    return abs(A-B)

#繰り返して、リストに代入していく関数
def make_list(A,B):
    list1.append(abs_ded(A,B))
    while 1:
        key = abs_ded(list1[-1],B)
        if key >= list1[-1]:
            answer = list1[-1]
            break
        else:
            list1.append(key)
    
    print(answer)

make_list(N,K)


Fixed submission:
N,K = map(int ,input().split(" "))

a = N % K
b = K - a

if(a>b):
    print(b)
else:
    print(a)
Buggy python submission (verdict: Time Limit Exceeded):
def check_l3(l):
    
    if l[0] < l[1] + l[2] and l[1] < l[0] + l[2] and l[2] < l[1] + l[0]:
        return 1
    else:
        return 0
    
N = int(input())

L = list(map(int , input().split(" ")))

L3 = []

i = 0
j = i + 1
k = j + 1

for i in range(N-2):
    for j in range(j,N-1):
        
        for k in range(k,N):
            l3 = [L[i],L[j],L[k]]
            if l3 not in L3:
                L3.append(l3)
            k = k + 1

        j = j + 1
        k = j + 1
    i = i + 1
    j = i + 1
    k = j + 1

# print(L3) #!!!!!!!

result = 0
for i in range(len(L3)):
    result += check_l3(L3[i])
print(result)

Fixed submission:
n = int(input())
l = list(map(int, input().split()))
# 昇順ソート 
l.sort()
# バイセクションサーチ（二分探索法）のライブラリbisect 
from bisect import bisect_left
# 満たされるべき条件は、a<b<c  a+b>c 
ans = 0
for i in range(n):
  for j in range(i+1, n):
    # ソートした最初の2つの数を足す
    t = l[i]+l[j]
    # bisect_left(対象リスト, 探したい値, lo=左側のインデックス, hi=右側のインデックス)
    # 2つの数の和と同じ数が、リストの何番目に入るかが求められる
    idx = bisect_left(l, t)
    # idxは、a+b=cになる境目
    # idx-(j+1)は a+b>c の条件をみたす、数がいくつあるかを計算している。
    ans += max(0, idx-j-1)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
def check_l3(l):
    
    if l[0] < l[1] + l[2] and l[1] < l[0] + l[2] and l[2] < l[1] + l[0]:
        return 1
    else:
        return 0
    



N = int(input())

L = list(map(int , input().split(" ")))

L3 = []

i = 0
j = i + 1
k = j + 1

for i in range(N-2):
    for j in range(j,N-1):
        
        for k in range(k,N):
            l3 = [L[i],L[j],L[k]]
            if l3 not in L3:
                L3.append(l3)
            k = k + 1

        j = j + 1
        k = j + 1
    i = i + 1
    j = i + 1
    k = j + 1

# print(L3) #!!!!!!!

result = 0
for i in range(len(L3)):
    result += check_l3(L3[i])
print(result)

Fixed submission:
n = int(input())
l = list(map(int, input().split()))
# 昇順ソート 
l.sort()
# バイセクションサーチ（二分探索法）のライブラリbisect 
from bisect import bisect_left
# 満たされるべき条件は、a<b<c  a+b>c 
ans = 0
for i in range(n):
  for j in range(i+1, n):
    # ソートした最初の2つの数を足す
    t = l[i]+l[j]
    # bisect_left(対象リスト, 探したい値, lo=左側のインデックス, hi=右側のインデックス)
    # 2つの数の和と同じ数が、リストの何番目に入るかが求められる
    idx = bisect_left(l, t)
    # idxは、a+b=cになる境目
    # idx-(j+1)は a+b>c の条件をみたす、数がいくつあるかを計算している。
    ans += max(0, idx-j-1)
print(ans)
Buggy python submission (verdict: Runtime Error):
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

lst1 = []
lst2 = []
A1,B1 = map(int, input().split(" "))

A = factorization(A1)
B = factorization(B1)

for i in range(len(A)):
    lst1.append(A[i][0])

for i in range(len(B)):
    lst2.append(B[i][0])
# print(lst1)
# print(lst2)

lst1_set = set(lst1)
lst2_set = set(lst2)

result_set = lst1_set & lst2_set


# print(result_set)
if A1 == 0 or B1 == 0:
    print(0)
elif A1 == 1 and B1 == 1:
    print(1)
else:
    print(len(result_set) + 1)
    

Fixed submission:
#整数で受け取る
N = int(input())

number = 0
#奇数の数を数える
for i in range(1, N+1):
    if i % 2 != 0:
        number += 1

result = number / N

print(result)

Buggy python submission (verdict: Runtime Error):
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""

def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

lst1 = []
lst2 = []
A1,B1 = map(int, input().split(" "))

A = factorization(A1)
B = factorization(B1)

for i in range(len(A)):
    lst1.append(A[i][0])

for i in range(len(B)):
    lst2.append(B[i][0])
# print(lst1)
# print(lst2)

lst1_set = set(lst1)
lst2_set = set(lst2)

result_set = lst1_set & lst2_set


# print(result_set)
if (A1 == 0 or B1 == 0):
    print(0)
else:
    print(len(result_set) + 1)

Fixed submission:
#整数で受け取る
N = int(input())

number = 0
#奇数の数を数える
for i in range(1, N+1):
    if i % 2 != 0:
        number += 1

result = number / N

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

Fixed submission:
S = input()

if S == "Sunny":
    result = "Cloudy"
elif S == "Cloudy":
    result = "Rainy"
else:
    result = "Sunny"

print(result)

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

Fixed submission:
S = input()

if S == "Sunny":
    result = "Cloudy"
elif S == "Cloudy":
    result = "Rainy"
else:
    result = "Sunny"

print(result)

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


Fixed submission:
S = input()

if S == "Sunny":
    result = "Cloudy"
elif S == "Cloudy":
    result = "Rainy"
else:
    result = "Sunny"

print(result)
Buggy python submission (verdict: Time Limit Exceeded):
def minus_point(num,point,N):
    for i in range(N):
        if i != num-1:
            point[i] = point[i] - 1
        else:
            continue

    
        
N,K,Q = map(int, input().split(" "))
A = []
point = []
for i in range(Q):
    A.append(int(input()))

for i in range(N):
    point.append(K)



for i in range(Q):
    minus_point(A[i], point, N)

for i in range(N):
    if point[i] > 0:
        print("Yes")
    else:
        print("No")

Fixed submission:
n,k,q = map(int,input().split(" "))
point = [k-q] * n
for i in range(0,q):
    point[int(input())-1] += 1
for j in range(0,n):
    if point[j] > 0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int , input().split(" "))
A = list(map(int, input().split(" ")))

for i in range(M):
    A.sort()
    A[N-1] = int(A[N-1] / 2)

result = 0

for i in range(N):
    result += A[i]

print(result)

Fixed submission:
import heapq
N,M = map(int , input().split(" "))
A = list(map(int, input().split(" ")))

A_q = list(map(lambda x:x*(-1),A))
heapq.heapify(A_q)

for i in range(M):

    max = heapq.heappop(A_q) * (-1) // 2
    heapq.heappush(A_q, -max)



result = 0
A_q = list(map(lambda x:x*(-1),A_q))

for i in range(N):
    result += A_q[i]

print(result)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split(" ")))  #食べた順番
B = list(map(int,input().split(" "))) #満足度
C = list(map(int,input().split(" ")) )#追加満足度


#満足度を足し合わせていく
manzoku = 0
for i in range(N):
    manzoku += B[A[i]-1]
    
    if i != 0 and (A[i] ==A[i-1] + 1):
        manzoku += C[A[i-1]-1]
        



print(manzoku)


Fixed submission:
N = int(input())

result = N*N*N 

print(result)
Buggy python submission (verdict: Runtime Error):
#input
N = int(input())
A = list(map(int,input().split()))

count = 0
flag = 0
 
#loop
while(1):
  for i in range(N):
    
    if A[i] %2 == 1:
      flag = 1
    else:
      temp = A[i]/2
      A[i] = temp;
  
  #judge
  if flag == 1:
    break
  else:
    count +=1
 
print(count)

Fixed submission:
s = input()
print(s.count("1"))
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
#標準入力の取得
N,M = map(int,input().split())
A = list(map(int,input().split()))

cutoff = sum(A)/(4*M)
count_pop = sum(i >= cutoff for i in A)


if count_pop<M :
    print("No")
else:
    print("Yes")

Fixed submission:
# -*- coding: utf-8 -*-
X,Y,Z = map(int,input().split())
print("{} {} {}".format(Z,X,Y))

Buggy python submission (verdict: Runtime Error):
l = list(map(int,input().split()))
print(l[2]+' 'l[0]+' 'l[1])

Fixed submission:
n = list(map(int,input().split()))
print(str(n[2])+' ' +str(n[0])+' '+str(n[1]))
Buggy python submission (verdict: Runtime Error):
nm=input().split()
vote=[int(i) in input().split()]
n=int(nm[0])
m=int(nm[1])
selectable=0
for v in vote:
	if v < 4*m:
		continue
	else:
		selectable+=1
if selectable>=m:
	print("Yes")
else:
	print("No")


Fixed submission:
nm=input().split()
vote=[int(i) for i in input().split()]
n=int(nm[0])
m=int(nm[1])
selectable=0
all=sum(vote)
for v in vote:
	if v < all/(4*m):
		continue
	else:
		selectable+=1
if selectable>=m:
	print("Yes")
else:
	print("No")

Buggy python submission (verdict: Runtime Error):
nm=input().split()
vote=[int(i) in input().split()]
n=int(nm[0])
m=int(nm[1])
selectable=0
for v in vote:
  if v < 4*m:
    continue
  else:
    selectable+=1
if selectable>=m:
  print("Yes")
else:
  print("No")
      

Fixed submission:
nm=input().split()
vote=[int(i) for i in input().split()]
n=int(nm[0])
m=int(nm[1])
selectable=0
all=sum(vote)
for v in vote:
	if v < all/(4*m):
		continue
	else:
		selectable+=1
if selectable>=m:
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
  return 0
else:
  return 1

Fixed submission:
in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
  print(0)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
if sum(map(int,input().split()))<22:
 print("win")
else print("bust")


Fixed submission:
print('bust'if sum(map(int,input().split()))>=22else 'win')

Buggy python submission (verdict: Runtime Error):
if sum(map(int,input().split())<22:
 print("win")
else print("bust")


Fixed submission:
print('bust'if sum(map(int,input().split()))>=22else 'win')

Buggy python submission (verdict: Runtime Error):
a,b,c=int(input().split)
if a+b+c>21:
    print("bust")
else print("win")


Fixed submission:
print('bust'if sum(map(int,input().split()))>=22else 'win')

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split
if a+b+c>21:
    print("bust")
else print("win")


Fixed submission:
print('bust'if sum(map(int,input().split()))>=22else 'win')

Buggy python submission (verdict: Runtime Error):
a,b,c=input().split
if a+b+c>21:
    print(“bust”)
else print(“win”)

Fixed submission:
print('bust'if sum(map(int,input().split()))>=22else 'win')
Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = list(map(int, input().split()))

b = [k]*n

for i in range(q):
    a = int(input())
    b[a-1] += 1
    b = list(map(lambda x: x-1, b))

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')

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

b = [k]*n

for i in range(q):
    a = int(input())
    b[a-1] += 1

b = list(map(lambda x: x-q, b))

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = list(map(int, input().split()))
b = []

for _ in range(n):
    b.append(k)

for i in range(q):
    a = int(input())
    b[a-1] += 1
    b = list(map(lambda x: x-1, b))

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')

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

b = [k]*n

for i in range(q):
    a = int(input())
    b[a-1] += 1

b = list(map(lambda x: x-q, b))

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = list(map(int, input().split()))
b = []

for _ in range(n):
    b.append(k)

for i in range(q):
    a = int(input())
    b[a-1] += 1
    b = list(map(lambda x: x-1, b))

while len(b) > 0:
    if b[0] > 0:
        print('Yes')
    else:
        print('No')
    del b[0]

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

b = [k]*n

for i in range(q):
    a = int(input())
    b[a-1] += 1

b = list(map(lambda x: x-q, b))

for i in range(len(b)):
    if b[i] > 0:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
a, b = map(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):
a, b = map(int,input().split())
ans = 6-a-b
print(ans)


Fixed submission:
a = int(input())
b = int(input())
print(6-a-b)

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

Fixed submission:
a = int(input())
b = int(input())
print(6-a-b)
Buggy python submission (verdict: Runtime Error):
day = {"SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3, "FRY":2, "SAT":1}
s = input()
print(day[s])
  

Fixed submission:
day = {"SUN":7, "MON":6, "TUE":5, "WED":4, "THU":3, "FRI":2, "SAT":1}
s = input()
print(day[s])
Buggy python submission (verdict: Runtime Error):
a, b = map(int(), input().split())
if a - b * 2 > 0:
  print(a-b*2)
else:
  print(0)


Fixed submission:
a, b = map(int, input().split())
if a - b * 2 > 0:
  print(a-b*2)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
a, b = map(int(), input())
if a - b * 2 > 0:
  print(a-b*2)
else:
  print(0)

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

print(sum(a,b,c) - max(a,b,c))

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

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

if a > 12:
  print(b)
  break
elif a > 5:
  print(b/2)
  break
else:
  print(0)

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

if a > 12:
  print(b)
elif a > 5:
  print(round(b/2))
else:
  print(0)