Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):

l = list(map(int, input()))

p1 = l[0] * l[1]
p2 = l[2]

print(min(p1, p2))

Fixed submission:

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

p1 = l[0] * l[1]
p2 = l[2]

print(min(p1, p2))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
cnt = 0
for aa in a:
    for bb in b:
        for cc in c:
            if aa < bb < cc:
                cnt += 1
print(cnt)

Fixed submission:
import bisect
n = int(input())
a = sorted(list(map(int, input().split())))
b = sorted(list(map(int, input().split())))
c = sorted(list(map(int, input().split())))
cnt = 0
for bb in b:
    anum = bisect.bisect_left(a, bb)
    cnum = n - bisect.bisect_right(c, bb)
    cnt += (anum * cnum)
print(cnt)
Buggy python submission (verdict: Runtime Error):
import re

s = list(input())
t = list(input())

ls = len(s)
lt = len(t)

if ls < lt:
    print('UNRESTORABLE')
else:
    ans = []
    for i in range(len(s) - len(t) + 1):
        m = re.match(s[i:i + lt], t)
        if m is None:
            continue
        ans.append((s[:i]+t+s[i+lt:]).replace('?', 'a'))
    if not ans:
        print('UNRESTORABLE')
    else:
        print(min(ans))


Fixed submission:
import re

s = input().strip()
t = input().strip()

ls = len(s)
lt = len(t)

if ls < lt:
    print('UNRESTORABLE')
else:
    s = s.replace('?', '.')
    ans = []
    for i in range(len(s) - len(t) + 1):
        m = re.match(s[i:i + lt], t)
        if m is None:
            continue
        ans.append((s[:i]+t+s[i+lt:]).replace('.', 'a'))
    if not ans:
        print('UNRESTORABLE')
    else:
        print(min(ans))
Buggy python submission (verdict: Runtime Error):
from math import gcd
def lcm(a, b):
    return a * b // gcd(a, b)

n = int(input())
g = int(input())
for _ in range(n-1):
    t = int(input())
    g = lcm(g, t)
print(g)


Fixed submission:
from fractions import gcd
def lcm(a, b):
    return a * b // gcd(a, b)

n = int(input())
g = int(input())
for _ in range(n-1):
    t = int(input())
    g = lcm(g, t)
print(g)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
g = int(input())
for _ in range(n-1):
    t = int(input())
    r = max(t, g)
    l = min(t, g)
    i = 1
    while True:
        if (r*i) % l == 0:
            g = r * i
            break
        i += 1
print(g)


Fixed submission:
from fractions import gcd
def lcm(a, b):
    return a * b // gcd(a, b)

n = int(input())
g = int(input())
for _ in range(n-1):
    t = int(input())
    g = lcm(g, t)
print(g)
Buggy python submission (verdict: Runtime Error):
s = list(input())
f = s[0]
e = s[-1]
s.pop(0).pop(-1)
l = len(s)
print("".join([f, str(l), e]))

Fixed submission:
s = list(input())
f = s[0]
e = s[-1]
s.pop(0)
s.pop(-1)
l = len(s)
print("".join([f, str(l), e]))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = []
if n % 2 == 0:
    for i in range(n):
        if i % 2 == 0:
            ans.append(a[i])
        else:
            ans.insert(0, a[i])
else:
    for i in range(n):
        if i % 2 != 0:
            ans.append(a[i])
        else:
            ans.insert(0, a[i])
print(" ".join(map(str, ans)))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
ev = a[1::2]
od = a[::2]
if n % 2 == 0:
    ev = ev[::-1]
    ans = ev + od
else:
    od = od[::-1]
    ans = od + ev
print(" ".join(map(str, ans)))
Buggy python submission (verdict: Time Limit Exceeded):
N, A, B = map(int, input().split())

if N == 1:
    if A == B:
        print(1)
    else:
        print(0)
elif A > B:
    print(0)
else:
    c = 0
    for _ in range(N-2):
        c += (B-A)
    print(c+1)


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

if N == 1:
    if A == B:
        print(1)
    else:
        print(0)
elif A > B:
    print(0)
else:
    print((B-A)*(N-2)+1)
Buggy python submission (verdict: Runtime Error):
a, b, c = mapc(int, input().split())

if (b-a) == (c-b):
    print('YES')
else:
    print('NO')

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

if (b-a) == (c-b):
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = 1
for i in range(1, n+1):
    p = p * i
print(p % (10 ** 9 + 7))

Fixed submission:
n = int(input())
p = 1
for i in range(1, n+1):
    p = p * i
    p = p % (10 ** 9 + 7)
print(p % (10 ** 9 + 7))
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())
cnt = 0
for a in range(k+1):
    for b in range(k+1):
        for c in range(k+1):
            if a+b+c == s:
                cnt += 1
print(cnt)


Fixed submission:
k, s = map(int, input().split())
cnt = 0
for a in range(k+1):
    for b in range(k+1):
        if 0 <= s-a-b <= k:
            cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
print(k * ((nk - 1) ** (n - 1)))

Fixed submission:
n, k = map(int, input().split())
print(k * ((k - 1)**(n - 1)))
Buggy python submission (verdict: Time Limit Exceeded):
a = int(input())
inputList = input().split()

sum = 0
for i in range(a - 1):
  for j in range(i + 1, a):
    sum += int(inputList[i]) ^ int(inputList[j])

print(sum % 1000000007)

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

mod = 10**9 + 7
total = 0
for i in range(60):
  cnt = sum([1 for a in A if (a>>i & 1)])
  total += cnt * (n-cnt) * (1 << i)
  total %= mod
print(total)

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


index = 0
sum = 0
for i in range(a - 1):
  for j in range(i + 1, a):
    sum += (int(inputList[i]) ^ int(inputList[j]))

print(sum % (10 **9 + 7))


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

mod = 10**9 + 7
total = 0
for i in range(60):
  cnt = sum([1 for a in A if (a>>i & 1)])
  total += cnt * (n-cnt) * (1 << i)
  total %= mod
print(total)

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


index = 0
sum = 0
for i in inputList:
  if index == len(inputList) - 1:
    break
  for j in inputList[index+1:]:
    sum += (int(i) ^ int(j))
  index += 1

print(sum % (10 **9 + 7))


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

mod = 10**9 + 7
total = 0
for i in range(60):
  cnt = sum([1 for a in A if (a>>i & 1)])
  total += cnt * (n-cnt) * (1 << i)
  total %= mod
print(total)
Buggy python submission (verdict: Runtime Error):
A1 =int(input())
A2 =int(input())
A3 =int(input())

if A1+A2+A3 > 21:
    print("lose")
else:
    print("win")

Fixed submission:
A0,A1,A2 = (int(x) for x in input().split())

if A0+A1+A2 > 21:
    print("bust")
else:
    print("win")

Buggy python submission (verdict: Runtime Error):
A1=input()
A2=input()
A3=input()

if A1+A2+A3 >21:
    print("lose")
else:
    print("win")

Fixed submission:
A0,A1,A2 = (int(x) for x in input().split())

if A0+A1+A2 > 21:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
# coding:utf-8
A,B = [int(i) for i in input().split]
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)


Fixed submission:
# coding:utf-8
[A, B] = [int(i) for i in input().split(" ")]
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
# coding:utf-8
A,B = [int(i) for i in input().split]
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)


Fixed submission:
# coding:utf-8
[A, B] = [int(i) for i in input().split(" ")]
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
# coding:utf-8
A = int(input())
B = int(input())
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)


Fixed submission:
# coding:utf-8
[A, B] = [int(i) for i in input().split(" ")]
if (1 <= A <= 9) and (1 <= B <= 9):
    print(A*B)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
number = input().split()

for i in number:
 sum = sum + i
 
if(sum>21): 
 print("bust")
else:
 print("win")


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

sum = 0
for i in number:
 sum += i
 
if(sum>21): 
 print("bust")
else:
 print("win")

Buggy python submission (verdict: Runtime Error):
sum = 0;
for i in range(3):
    x = input()
    num_x = int(x)
    sum += num_x
if sum >= 21:
    print("bust")
else:
    print("win")


Fixed submission:
sum = 0;
x = list(map(int,input().split()))
for i in x:
    sum += i
if sum > 21:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
L = [int(i) for i in input().split()]
step = 0
i = 0

while step <= X and i <= N+1:
    step += L[i]
    i += 1
    #print(step)

print(i)

Fixed submission:
N, X = map(int, input().split())
L = [int(i) for i in input().split()]
step = [0]
nowstep = 0
ans = 0
i = 0

while i < N:
    step.append(nowstep + L[i])
    nowstep += L[i] 
    i += 1

for i in range(len(step)):
    if step[i] <= X:
        ans += 1
    else:
        pass

print(ans)

Buggy python submission (verdict: Runtime Error):
N, X = map(int, input().split())
L = [int(i) for i in input().split()]
step = 0
i = 0

while step <= X and i <= N:
    step += L[i]
    i += 1

print(i)

Fixed submission:
N, X = map(int, input().split())
L = [int(i) for i in input().split()]
step = [0]
nowstep = 0
ans = 0
i = 0

while i < N:
    step.append(nowstep + L[i])
    nowstep += L[i] 
    i += 1

for i in range(len(step)):
    if step[i] <= X:
        ans += 1
    else:
        pass

print(ans)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = list(map(str, input()))

if S[K] == 'A':
    S[K] = 'a'
elif S[K] == 'B':
    S[K] = 'b'
else:
    S[K] = 'c'
    
T = ''.join(S)

print(T)

Fixed submission:
N, K = map(int, input().split())
S = list(map(str, input()))

if S[K-1] == 'A':
    S[K-1] = 'a'
elif S[K-1] == 'B':
    S[K-1] = 'b'
else:
    S[K-1] = 'c'
    
T = ''.join(S)

print(T)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
S = list(map(str, input()))

if S[K] == 'A':
    S[K] = 'a'
elif S[K] == 'B':
    S[K] = 'b'
else:
    S[K] = 'c'

print(S)

Fixed submission:
N, K = map(int, input().split())
S = list(map(str, input()))

if S[K-1] == 'A':
    S[K-1] = 'a'
elif S[K-1] == 'B':
    S[K-1] = 'b'
else:
    S[K-1] = 'c'
    
T = ''.join(S)

print(T)
Buggy python submission (verdict: Runtime Error):
N = int(input()) 
hotel = [int(input()) for i in range(N)] #リストの内包表記
view = 1

for i in range (1, N, 1):
    judge = 1
    for j in range (0, i, 1):
        if hotel[i] >= hotel[j]:
            pass#何もしない
        else:
            judge = 0
            break
    if judge == 1:
        view += 1

print (view)


Fixed submission:
N = int(input()) 
hotel = list(map(int, input().split())) #入力してint型リストに格納
view = 1

for i in range (1, N, 1):
    judge = 1
    for j in range (0, i, 1):
        if hotel[i] >= hotel[j]:
            pass#何もしない
        else:
            judge = 0
            break
    if judge == 1:
        view += 1

print (view)

Buggy python submission (verdict: Runtime Error):
N = int(input()) 
hotel = list(map(int, input().split())) #入力してint型リストに格納
view = 1

for i in range (1, N-1, 1):
    judge = 1
    for j in range (0, i, 1):
        if hotel[i] >= hotel[j]:
            pass　#何もしない
        else:
            judge = 0
    if judge == 1:
        view += 1

print (view)

Fixed submission:
N = int(input()) 
hotel = list(map(int, input().split())) #入力してint型リストに格納
view = 1

for i in range (1, N, 1):
    judge = 1
    for j in range (0, i, 1):
        if hotel[i] >= hotel[j]:
            pass#何もしない
        else:
            judge = 0
            break
    if judge == 1:
        view += 1

print (view)
Buggy python submission (verdict: Runtime Error):
dishes_1 = [int(input()) for i in range(5)]
dishes_2 = [i % 10 for i in dishes_1]
dishes_sort = []

min_time = 0

for i in range (5):
    if dishes_2[i] == 0:
       dishes_sort.append(dishes_1[i])

for i in range (9, 1, -1):
    for j in range (5):
        if dishes_2[j] == i:
            dishes_sort.append(dishes_1[j])

for i in range (4):
    for j in range (9):
        if dishes_sort[i] % 10 == 0:
           break
        else:
            dishes_sort[i] += 1
            
print (sum(dishes_sort))

Fixed submission:
dishes_1 = [int(input()) for i in range(5)]
dishes_2 = [i % 10 for i in dishes_1]
dishes_sort = []

min_time = 0

for i in range (5):
    if dishes_2[i] == 0:
       dishes_sort.append(dishes_1[i])

for i in range (9, 0, -1):
    for j in range (5):
        if dishes_2[j] == i:
            dishes_sort.append(dishes_1[j])

for i in range (4):
    for j in range (9):
        if dishes_sort[i] % 10 == 0:
           break
        else:
            dishes_sort[i] += 1
            
print (sum(dishes_sort))
Buggy python submission (verdict: Runtime Error):
r = int(input())

r1 = 1

printint(((r**2)/(r1**2)))

Fixed submission:
r = int(input())
 
r1 = 1
 
print(int(r**2))
Buggy python submission (verdict: Runtime Error):
a.b = map(int,input().split())
if 1<=a<=9 and 1<=b<=9:
    print(a*b)
elif:
    print("-1")

Fixed submission:
a,b = map(int,input().split())
if 1<=a<=9 and 1<=b<=9:
    print(a*b)
else:
    print("-1")
Buggy python submission (verdict: Time Limit Exceeded):
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

num = int(input())
yaku = make_divisors(num)
ans = float("inf")
for i in yaku:
    for j in yaku:
        if i*j==num:
            ans=min(ans,i+j-2)
print(ans)

Fixed submission:
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(int(i+n/i-2))
    return divisors
ans = float("inf")
for i in make_divisors(int(input())):
    
    ans = min(ans,i)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = input()
l = list(map(int,input().split()))
ans = 0
for i in list(itertools.combinations(l,3)):
    i = sorted(i)
    a,b,c = i[0],i[1],i[2]
    if c<a+b:
        ans += 1
print(ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
l = sorted(l)
ans = 0
for c in range(n):
    a=0
    b=c-1
    while a<b:
        if l[a]+l[b]>l[c]:
            ans+=b-a
            b-=1
        else:
            a+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
import itertools
n = input()
l = list(map(int,input().split()))
ans = 0
for i in list(itertools.combinations(l,3)):
    i.sort()
    a,b,c = i[0],i[1],i[2]
    if c<a+b:
        ans += 1
print(ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
l = sorted(l)
ans = 0
for c in range(n):
    a=0
    b=c-1
    while a<b:
        if l[a]+l[b]>l[c]:
            ans+=b-a
            b-=1
        else:
            a+=1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = input()
l = list(map(int,input().split()))
ans = 0
for i in list(itertools.combinations(l,3)):
    a,b,c = i[0],i[1],i[2]
    if a<b+c and b<a+c and c<a+b:
        ans += 1
print(ans)
    

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
l = sorted(l)
ans = 0
for c in range(n):
    a=0
    b=c-1
    while a<b:
        if l[a]+l[b]>l[c]:
            ans+=b-a
            b-=1
        else:
            a+=1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = input()
l = list(map(int,input().split()))
combi = list(itertools.combinations(l,3))
ans = 0
for i in combi:
    a,b,c = i[0],i[1],i[2]
    if a<b+c and b<a+c and c<a+b:
        ans += 1
print(ans)
    

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
l = sorted(l)
ans = 0
for c in range(n):
    a=0
    b=c-1
    while a<b:
        if l[a]+l[b]>l[c]:
            ans+=b-a
            b-=1
        else:
            a+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
for i in list([int(a.index(i))+1 for i in range(1,n+1)]):
    print(i,end=" ")

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
d = dict(zip(a,range(1,n+1)))
for i in range(1,n+1):
    print(d[i],end=" ")

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
b = list([int(a.index(i))+1 for i in range(1,n+1)])
for i in b:
    print(i,end=" ")

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
d = dict(zip(a,range(1,n+1)))
for i in range(1,n+1):
    print(d[i],end=" ")
Buggy python submission (verdict: Runtime Error):
import math

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

n = int(input())
a = [int(input()) for i in range(n)]
r = 1
for i in a:
    r = lcm(r, i)
print(r)

Fixed submission:
def gcd(x, y):
    if y==0:
        return x
    else:
        return gcd(y, x%y)

def lcm(x, y):
    return (x * y) // gcd(x, y)

n = int(input())
a = [int(input()) for i in range(n)]
r = 1
for i in a:
    r = lcm(r, i)
print(r)

Buggy python submission (verdict: Runtime Error):
import math
import functools

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

n = int(input())
print(functools.reduce(lcm, [int(input()) for i in range(n)]))


Fixed submission:
def gcd(x, y):
    if y==0:
        return x
    else:
        return gcd(y, x%y)

def lcm(x, y):
    return (x * y) // gcd(x, y)

n = int(input())
a = [int(input()) for i in range(n)]
r = 1
for i in a:
    r = lcm(r, i)
print(r)
Buggy python submission (verdict: Runtime Error):
values = input()
values = [int(x) for x in values]
 
sum = 0
 
for val in values:
  sum += val
  
if sum >= 22:
  print("bust")
else:
  print("win")

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

sum = 0

for val in values:
    sum += val

if sum >= 22:
    print("bust")
else:
    print("win")

Buggy python submission (verdict: Runtime Error):
values = input()
values = [int(x) for x in values]

sum = 0

for val in values:
  sum += val
  
if val >= 22:
  print("bust")
else:
  print("win")

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

sum = 0

for val in values:
    sum += val

if sum >= 22:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
print(input().count(1))


Fixed submission:
print(input().count('1'))
Buggy python submission (verdict: Runtime Error):
A1, A2, A3 = input().split(' ')
if A1 + A2 + A3 >= 22:
    return 'bust'
else:
    return 'win'

Fixed submission:
A1, A2, A3 = [int(x) for x in input().split(' ')]
if A1 + A2 + A3 >= 22:
    print('bust')
else:
    print('win')
Buggy python submission (verdict: Runtime Error):
str = input()
lst = list(reversed(str))
lst.insert(0," ")
count = 0

for i in lst[1:]:
  if lst[i] != lst[-i]:
    count += 1
  else:
    pass
print(count)
    

Fixed submission:
str = input()
lst = list(str)
count = 0

for i in range(int(len(lst)/2)):
  if lst[i] != lst[-i-1]:
    count += 1
  else:
    pass
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
count = 0

for i in range(N):
  if N <= int(i*1.08) < N+1:
    print(i)
    count += 1

if count == 0:
    print(":(")


Fixed submission:
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  print(1)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  return 1
else:
  return 0

Fixed submission:
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  print(1)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
c,d = map(int, input().split())
if c == a+1:
  return 1
else:
  return 0


Fixed submission:
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  print(1)
else:
  print(0)

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


Fixed submission:
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  print(1)
else:
  print(0)

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

Fixed submission:
li = []
for i in range(2):
  a,b = map(int, input().split())
  li.append(a)
  
if li[1] == li[0]+1:
  print(1)
else:
  print(0)
Buggy python submission (verdict: Runtime Error):
x = []
u = []
Y = 0
for i in range(N):
    str = input().split(' ')
    x[i] = int(str[0])
    u[i] = int(str[1])
    if u[i] == 'JPY':
        Y += x[i]
    else:
        Y += x[i] * 380000.0
print(Y)

Fixed submission:
N = int(input())
x = 0
u = 0
Y = 0
for i in range(N):
    str = input().split(' ')

    x = float(str[0])
    u = str[1]
    if u == 'JPY':
        Y += x
    else:
        Y += x * 380000.0
print(Y)
Buggy python submission (verdict: Runtime Error):
(A, B, C) = map(input().split(), int)

if A + B + C >= 22:
  print("bust")
else:
  print("win")

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

if A + B + C >= 22:
  print("bust")
else:
  print("win")

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

if A + B + C >= 22:
  print("bust")
else:
  print("win")

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

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

if c - (a - b) < 0:
    print(0)
else:
    print(c - remain)


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

if c - (a - b) < 0:
    print(0)
else:
    print(c - (a - b))
Buggy python submission (verdict: Runtime Error):
s = input()
s.sort()
if s[0] == s[1] and s[2] == s[3]:
    print('Yes')
else:
    print('No')


Fixed submission:
s = list(input())
s.sort()
if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
s = input()
cmp = s[0]
cnt = 0
for i in range(1, n):
    if s[i] == cmp:
        cnt += 1
    else:
        cnt -= 1
if cnt == 0:
    print('Yes')
else:
    print('No')


Fixed submission:
s = list(input())
s.sort()
if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = int(intput())
p = list(map(int, input().split()))
cnt = 0
for i in range(1, n-1):
  if (p[i-1] < p[i] and p[i] < p[i+1]) or (p[i-1] > p[i] and p[i] > p[i+1]):
    cnt += 1
print(cnt)


Fixed submission:
n = int(input())
p = list(map(int, input().split()))
cnt = 0
for i in range(1, n-1):
    if (p[i-1] < p[i] and p[i] < p[i+1]) or (p[i-1] > p[i] and p[i] > p[i+1]):
        cnt += 1
print(cnt)