Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from collections import Counter
from scipy.special import comb

def inpl(): return list(map(int, input().split()))


N, a, b = inpl()
array = inpl()
value = Counter(array)
array.sort(reverse=True)
ans = {}
sum_a = 0
kosuu = 0
last = -1
# print("koko")
for i, num in enumerate(array):
    # print(i, num)
    sum_a += num
    if last != num:
        kosuu = 1
        last = num
    else:
        kosuu += 1
    if a <= i+1 <= b:
        ans[sum_a/(i+1)] = ans.get(sum_a/(i+1), 0) + comb(value[num], kosuu)
print("{:.10f}".format(max(ans)))
print(int(ans[max(ans)]))

Fixed submission:
from collections import Counter
from operator import mul
from functools import reduce

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

def inpl(): return list(map(int, input().split()))


N, a, b = inpl()
array = inpl()
value = Counter(array)
array.sort(reverse=True)
ans = {}
sum_a = 0
kosuu = 0
last = -1
# print("koko")
for i, num in enumerate(array):
    # print(i, num)
    sum_a += num
    if last != num:
        kosuu = 1
        last = num
    else:
        kosuu += 1
    if a <= i+1 <= b:
        ans[sum_a/(i+1)] = ans.get(sum_a/(i+1), 0) + cmb(value[num], kosuu)
print("{:.10f}".format(max(ans)))
print(int(ans[max(ans)]))
Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())

ans = 0
for x in range(k+1):
    for y in range(min(s-x+1, k+1)):
        z = s - x - y
        if min(x, y, z) < 0 or z > k:
            continue
        ans += 1
print(ans)

Fixed submission:
k, s = map(int, input().split())

ans = 0
for x in range(k+1):
    if 0 <= s - x <= k:
        ans += s-x+1
    elif 0 <= s-x-k <= k:
        ans += k - s + x + k + 1
    # print(x, ans)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
k, s = map(int, input().split())

ans = 0
for x in range(k+1):
    for y in range(k+1):
        z = s - x - y
        if min(x, y, z) < 0 or z > k:
            continue
        ans += 1
print(ans)

Fixed submission:
k, s = map(int, input().split())

ans = 0
for x in range(k+1):
    if 0 <= s - x <= k:
        ans += s-x+1
    elif 0 <= s-x-k <= k:
        ans += k - s + x + k + 1
    # print(x, ans)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations as comb
from collections import deque as dq

def inpl(): return list(map(int, input().split()))


def dijkstra(a, b):
    node = dq()
    node.append(a)
    ncost = [1<<20 for _ in range(N+1)]
    first = a
    ncost[a] = 0
    path = {}
    while b not in node:
        for nb in edge[first]:
            if nb in node:
                continue
            if ncost[nb] > ncost[first] + cost[(first, nb)]:
                # print(nb, ncost[nb])
                path[nb] = first
                ncost[nb] = ncost[first] + cost[(first, nb)]
                # print(nb, ncost[nb])

        nf = 0
        # print(path)
        for t in range(N+1):
            if t in node:
                continue
            # print(nf, t)
            if ncost[nf] > ncost[t]:
                nf = t
        node.append(nf)
        first = nf
        # print(node)
    now = b
    # print(path)
    # print(ncost)
    ret = set()
    while True:
        if now == a:
            break
        ret.add((now, path[now]))
        ret.add((path[now], now))
        now = path[now]
    return ret


N, M = inpl()
cost = {}
edge = [dq() for _ in range(N+1)]
for _ in range(M):
    a, b, c = inpl()
    cost[(a, b)] = c
    cost[(b, a)] = c
    edge[a].append(b)
    edge[b].append(a)

ans = set()
for a, b, in comb([i for i in range(1, N+1)], 2):
    # print(a, b, "check")
    # print(dijkstra(a, b))
    ans = ans | dijkstra(a, b)
# print(ans)
print(M-len(ans)//2)

Fixed submission:
from itertools import combinations as comb
from collections import deque as dq

def inpl(): return list(map(int, input().split()))


def dijkstra(a):
    node = dq()
    node.append(a)
    ncost = [1<<20 for _ in range(N+1)]
    first = a
    ncost[a] = 0
    path = {}
    while len(node) != N:
        for nb in edge[first]:
            if nb in node:
                continue
            if ncost[nb] > ncost[first] + cost[(first, nb)]:
                # print(nb, ncost[nb])
                path[nb] = first
                ncost[nb] = ncost[first] + cost[(first, nb)]
                # print(nb, ncost[nb])

        nf = 0
        # print(path)
        for t in range(N+1):
            if t in node:
                continue
            # print(nf, t)
            if ncost[nf] > ncost[t]:
                nf = t
        node.append(nf)
        first = nf
        # print(node)
    # print(path)
    # print(ncost)
    ret = set()
    for k, v in path.items():
        ret.add((k, v))
        ret.add((v, k))
    return ret


N, M = inpl()
cost = {}
edge = [dq() for _ in range(N+1)]
for _ in range(M):
    a, b, c = inpl()
    cost[(a, b)] = c
    cost[(b, a)] = c
    edge[a].append(b)
    edge[b].append(a)

ans = set()
for a in range(1, N+1):
    # print(a, b, "check")
    # print(dijkstra(a, b))
    ans = ans | dijkstra(a)
# print(ans)
print(M-len(ans)//2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
T = list(map(int, input().split()))
sumT = sum(T)
m = int(input())
for i in range(m):
  a, b = map(int, input().split())
  print(sumT - T[a] + b)

Fixed submission:
n = int(input())
T = list(map(int, input().split()))
sumT = sum(T)
m = int(input())
for i in range(m):
  a, b = map(int, input().split())
  print(sumT - T[a - 1] + b)

Buggy python submission (verdict: Runtime Error):
n = int(input())
T = list(map(int, input().split()))
sumT = sum(T)
m = int(input())
D = list(map(int, input().split()))
for i, d in enumerate(D):
  print(sumT - T[i] + d)

Fixed submission:
n = int(input())
T = list(map(int, input().split()))
sumT = sum(T)
m = int(input())
for i in range(m):
  a, b = map(int, input().split())
  print(sumT - T[a - 1] + b)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())

print(A[0]+B[0]+C[0])

Fixed submission:
A, B, C = map(str, input().split())
 
print(A[0]+B[0]+C[0])
Buggy python submission (verdict: Runtime Error):
S = input()
ans = "CODEFESTIVAL2016"
a = 0
for i in range(S):
  if S[i] != ans[i]:
    a += 1
print(a)

Fixed submission:
S = input()
ans = "CODEFESTIVAL2016"
a = 0
for i in range(len(S)):
  if S[i] != ans[i]:
    a += 1
print(a)
Buggy python submission (verdict: Runtime Error):
from collection import Counter
S = Counter(list(input()))
for k, v in S.items():
  if v % 2 == 1:
    print("No")
    exit()
print("Yes")

Fixed submission:
from collections import Counter
S = Counter(list(input()))
for k, v in S.items():
  if v % 2 == 1:
    print("No")
    exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter


def inpl():
    return list(map(int, input().split()))


N, A = inpl()
X = inpl()
cX = Counter(X)

dp = [[[0 for _ in range(N * max(X) + 1)] for j in range(i + 1)]
      for i in range(N + 1)]

dp[0][0][0] = 1
for i in range(1, N + 1):
    x = X[i - 1]
    for j in range(i + 1):
        for k in range(N * max(X) + 1):
            # print(i, j, k)
            if j == i and k - x < 0:
                dp[i][j][k] = 0
            elif j == i and k - x >= 0:
                dp[i][j][k] = dp[i - 1][j - 1][k - x]
            elif k - x < 0 or j == 0:
                dp[i][j][k] = dp[i - 1][j][k]
            else:
                dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - x]

ans = 0
for j in range(1, N + 1):
    if j * A > N * max(X):
        continue
    ans += dp[N][j][j * A]
print(ans)


Fixed submission:
def inpl():
    return list(map(int, input().split()))


N, A = inpl()
X = inpl()
maxX = max(X)

dp = [[[0 for _ in range(N * maxX + 1)] for j in range(i + 1)]
      for i in range(51)]

dp[0][0][0] = 1
for i in range(N):
    x = X[i - 1]
    for j in range(i + 1):
        for k in range(N * maxX + 1):
            # print(i, j, k)
            if dp[i][j][k] == 0:
                continue
            dp[i + 1][j][k] += dp[i][j][k]
            dp[i + 1][j + 1][k + x] += dp[i][j][k]

ans = 0
for j in range(1, N + 1):
    if j * A > N * maxX:
        continue
    ans += dp[N][j][j * A]
print(ans)

Buggy python submission (verdict: Runtime Error):
from collections import Counter


def inpl():
    return list(map(int, input().split()))


N, A = inpl()
X = inpl()
cX = Counter(X)

dp = [[[0 for _ in range(N * max(X) + 1)] for j in range(i + 1)]
      for i in range(N + 1)]

dp[0][0][0] = 1
for i in range(1, N + 1):
    x = X[i - 1]
    for j in range(i + 1):
        for k in range(N * max(X) + 1):
            # print(i, j, k)
            if j == i and k - x < 0:
                dp[i][j][k] = 0
            elif j == i and k - x >= 0:
                dp[i][j][k] = dp[i - 1][j - 1][k - x]
            elif k - x < 0 or j == 0:
                dp[i][j][k] = dp[i - 1][j][k]
            else:
                dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - x]
print(sum(dp[N][j][j * A] for j in range(1, N + 1)))


Fixed submission:
def inpl():
    return list(map(int, input().split()))


N, A = inpl()
X = inpl()
maxX = max(X)

dp = [[[0 for _ in range(N * maxX + 1)] for j in range(i + 1)]
      for i in range(51)]

dp[0][0][0] = 1
for i in range(N):
    x = X[i - 1]
    for j in range(i + 1):
        for k in range(N * maxX + 1):
            # print(i, j, k)
            if dp[i][j][k] == 0:
                continue
            dp[i + 1][j][k] += dp[i][j][k]
            dp[i + 1][j + 1][k + x] += dp[i][j][k]

ans = 0
for j in range(1, N + 1):
    if j * A > N * maxX:
        continue
    ans += dp[N][j][j * A]
print(ans)
Buggy python submission (verdict: Runtime Error):
def inpl():
    return list(map(int, input().split()))


def f(a, b):
    if a == 0 and b == 0:
        return True
    elif a * b == 0:
        return False
    else:
        return True

S = input()

N = S.count('N')
W = S.count('W')
S = S.count('S')
E = E.count('E')

if f(N, S) is True and f(W, E) is True:
    print('Yes')
else:
    print('No')

Fixed submission:
def inpl():
    return list(map(int, input().split()))


def f(a, b):
    if a == 0 and b == 0:
        return True
    elif a * b == 0:
        return False
    else:
        return True


S = input()
# print(S)
cN = S.count('N')
cW = S.count('W')
cS = S.count('S')
cE = S.count('E')

if f(cN, cS) is True and f(cW, cE) is True:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().split())).sort()
ans = 0
for a, b in zip(A, A[1:]):
  ans += a
print(ans)

Fixed submission:
n = int(input())
A = sorted(list(map(int, input().split())))
ans = 0
flag = True
for i in reversed(range(len(A))):
  if flag is False:
    flag = True
    continue
  if i - 1 < 0:
    continue
  ans += A[i - 1]
  flag = False
print(ans)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=0
for i in range(0,10):
    i=i+1
    A=i+"000"
    if N<=A:
        print(A-N)
        break


Fixed submission:
N=int(input())
A=0
for i in range(0,N):
    i=i+1
    A=str(i)+"000"
    A=int(A)
    if N<=A:
        print(A-N)
        break

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=""
for i in range(0,10):
    i=i+1
    A=int(i+"000")
    if N<=A:
        print(A-N)
        break


Fixed submission:
N=int(input())
A=0
for i in range(0,N):
    i=i+1
    A=str(i)+"000"
    A=int(A)
    if N<=A:
        print(A-N)
        break
Buggy python submission (verdict: Runtime Error):
a=int(input())
B=0
C=0
D=0
B=A
C=a*a
D=a*a*a
print(B+C+D)

Fixed submission:
a=int(input())
B=0
C=0
D=0
B=a
C=a*a
D=a*a*a
print(B+C+D)
Buggy python submission (verdict: Runtime Error):
N,K=map(int,input.split())
p=list(int,input().split())
B=0
p.sort()
K=K-1
for i in range(0,K):
    B=B+p[i]
    i=i+1
    
print(B)

Fixed submission:
N,K=map(int,input().split())
p=list(map(int,input().split()))
B=0
C=0
p.sort()
N=N-5
for i in range(0,K):
    B=B+p[i]
    i=i+1
    
print(B)
Buggy python submission (verdict: Runtime Error):
X=int(input())
B=0
C=0
for i in range(0,360):
    B=B+X
    C=B%360
    K=K+1
    if C==0:
        print(K)
        break
        
    
    

Fixed submission:
X=int(input())
K=0
B=0
C=0
for i in range(0,360):
    B=B+X
    C=B%360
    K=K+1
    if C==0:
        print(K)
        break
Buggy python submission (verdict: Runtime Error):
x=list(map(int,input()))
if x[0]==0:
    print(1)
elif x[1]==0:
    print(2)
elif x[2]==0:
    print(3)
elif x[3]==0:
    print(4)
else:
    print(5)


Fixed submission:
x=list(map(int,input().split()))
if x[0]==0:
    print(1)
elif x[1]==0:
    print(2)
elif x[2]==0:
    print(3)
elif x[3]==0:
    print(4)
else:
    print(5)
Buggy python submission (verdict: Runtime Error):
S=input()
print(S[0]S[1]S[2])

Fixed submission:
S=input()
B=0
B=S[0]+S[1]+S[2]
print(B)
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input())
A=A*B
print(int(A))


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

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input())
A=A*B
print(A)


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

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input())
A=A*B
print(A)

Fixed submission:
A,B=map(int,input().split())
A=A*B
print(int(A))
Buggy python submission (verdict: Runtime Error):
N=input()
B=0
B=len(N)
B=B-1
if N[B]=="2" or N[B]=="4" N[B]=="5" or N[B]=="7" or N[B]=="9":
    print('hon')
elif N[B]=="0" or N[B]=="1" or N[B]=="6"or N[B]=="8":
    print('pon')
else:
    print('bon')


Fixed submission:
N=input()
B=0
B=len(N)
B=B-1
#print(B,N)
if N[B]=='2' or N[B]=='4' or N[B]=='5' or N[B]=='7' or N[B]=='9':
    print('hon')
elif N[B]=='0' or N[B]=='1' or N[B]=='6' or N[B]=='8':
    print('pon')
else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N=input()
if N[2]==2 and N[2]==4 and N[2]==5 and N[2]==7 and N[2]==9:
    print('hon')
elif N[2]==0 and N[2]==1 and N[2]==6 and N[2]==8:
    print('pon')
else:
    print('bon')


Fixed submission:
N=input()
B=0
B=len(N)
B=B-1
#print(B,N)
if N[B]=='2' or N[B]=='4' or N[B]=='5' or N[B]=='7' or N[B]=='9':
    print('hon')
elif N[B]=='0' or N[B]=='1' or N[B]=='6' or N[B]=='8':
    print('pon')
else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N=input()
if N[2]=='2' and N[2]=='4' and N[2]=='5' and N[2]=='7' and N[2]=='9':
    print('hon')
elif N[2]=='0' and N[2]=='1' and N[2]=='6' and N[2]=='8':
    print('pon')
else:
    print('bon')


Fixed submission:
N=input()
B=0
B=len(N)
B=B-1
#print(B,N)
if N[B]=='2' or N[B]=='4' or N[B]=='5' or N[B]=='7' or N[B]=='9':
    print('hon')
elif N[B]=='0' or N[B]=='1' or N[B]=='6' or N[B]=='8':
    print('pon')
else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N=input()
if N[2]='2' and N[2]='4' and N[2]='5' and N[2]='7' andN[2]='9':
    print('hon')
elif N[2]='0' and N[2]='1' and N[2]='6' and N[2]='8':
    print('pon')
else:
    print('bon')

Fixed submission:
N=input()
B=0
B=len(N)
B=B-1
#print(B,N)
if N[B]=='2' or N[B]=='4' or N[B]=='5' or N[B]=='7' or N[B]=='9':
    print('hon')
elif N[B]=='0' or N[B]=='1' or N[B]=='6' or N[B]=='8':
    print('pon')
else:
    print('bon')
Buggy python submission (verdict: Runtime Error):
K=int(input())
S=input()
C=0
B=0
B=len(S)
if B<=K:
    print(S)
else:
    R=B-K
    for i in range(0,R):
        i=i+1
        C=C+S[i]
        
    print(C)
        
        
    

Fixed submission:
K=int(input())
S=input()
if len(S)<=K:print(S)
else:print(S[0:K]+'...')

Buggy python submission (verdict: Runtime Error):
K=int(input())
S=input()
B=0
D=0
B=len(S)
B=int(B)
B=B+1
D=S+...
if B>=K:
    print(S)
else:
    print(D)


Fixed submission:
K=int(input())
S=input()
if len(S)<=K:print(S)
else:print(S[0:K]+'...')

Buggy python submission (verdict: Runtime Error):
K=int(input())
S=input()
B=0
D=0
B=len(S)
B=int(B)
D=S+'...'
if S>=K:
    print(S)
else:
    print(D)


Fixed submission:
K=int(input())
S=input()
if len(S)<=K:print(S)
else:print(S[0:K]+'...')

Buggy python submission (verdict: Runtime Error):
K=int(input())
S=input()
B=0
D=0
B=len(S)
B=int(B)
D=S+'...'
if S=>K:
    print(S)
else:
    print(D)

Fixed submission:
K=int(input())
S=input()
if len(S)<=K:print(S)
else:print(S[0:K]+'...')
Buggy python submission (verdict: Runtime Error):
S==input()
B="ABC"
if S==B:
    print("ARC")
else:
    print("ABC")

Fixed submission:
S=input()
B="ABC"
if S==B:
    print("ARC")
else:
    print("ABC")

Buggy python submission (verdict: Runtime Error):
s=input()
if S==ABC:
    print("ARC")
else:
    print("ARC")


Fixed submission:
S=input()
B="ABC"
if S==B:
    print("ARC")
else:
    print("ABC")

Buggy python submission (verdict: Runtime Error):
s=input()
if S=="ABC":
    print("ARC")
else:
    print("ARC")

Fixed submission:
S=input()
B="ABC"
if S==B:
    print("ARC")
else:
    print("ABC")
Buggy python submission (verdict: Runtime Error):
A,B,C,D=map(int,input().split())
for i in range(0,99):
    C=C-B
    if C<=0:
        print('Yes')
        break
    else:
        A=A-D
         if A<=0:
            print('No')
            break


Fixed submission:
A,B,C,D=map(int,input().split())
for i in range(0,100):
    C=C-B
    if C<=0:
        print('Yes')
        break
    else:
        A=A-D
        if A<=0:
            print('No')
            break

Buggy python submission (verdict: Runtime Error):
A,B,C,D=map(int,input().split())
for i in range(0,99):
    C=C-B
    if C<=0:
        print('Yes')
         break
    else:
        A=A-D
        if A<=0:
            print('No')
             break


Fixed submission:
A,B,C,D=map(int,input().split())
for i in range(0,100):
    C=C-B
    if C<=0:
        print('Yes')
        break
    else:
        A=A-D
        if A<=0:
            print('No')
            break
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().split()
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=int(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):
X=int(input())
N=int(input())
Z=int(input())
A=int(input())
G=int(input())
M=int(input())
A=0
G=0
N=0
M=0
Z=0
N=X/500
M=int(X%500)
Z=M/5
N=N+Z
for i in range(0,N):
    if X-500:
        X=X-500
        G=G+1000
    elif X-5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)

Fixed submission:
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=int(X/500)
M=int(X%500)
Z=int(M/5)
N=N+Z
for i in range(0,N):
    if X>=500:
        X=X-500
        G=G+1000
    elif X>=5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)

Buggy python submission (verdict: Runtime Error):
X=int(input())
N=int(input())
Z=int(input())
A=0
G=0
N=0
M=0
Z=0
N=X/500
M=int(X%500)
Z=M/5
N=N+Z
for i in range(0,N):
    if X-500:
        X=X-500
        G=G+1000
    elif X-5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)


Fixed submission:
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=int(X/500)
M=int(X%500)
Z=int(M/5)
N=N+Z
for i in range(0,N):
    if X>=500:
        X=X-500
        G=G+1000
    elif X>=5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)

Buggy python submission (verdict: Runtime Error):
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=X/500
M=int(X%500)
Z=M/5
N=N+Z
for i in range(0,N):
    if X-500:
        X=X-500
        G=G+1000
    elif X-5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)

Fixed submission:
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=int(X/500)
M=int(X%500)
Z=int(M/5)
N=N+Z
for i in range(0,N):
    if X>=500:
        X=X-500
        G=G+1000
    elif X>=5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)

Buggy python submission (verdict: Runtime Error):
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=X/500
M=int(X%500)
Z=M/5
N=N+Z
for i in range(0,N):
    if X-500:
        X=X-500
        G=G+1000
    elif X-5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)
        
    

Fixed submission:
X=int(input())
A=0
G=0
N=0
M=0
Z=0
N=int(X/500)
M=int(X%500)
Z=int(M/5)
N=N+Z
for i in range(0,N):
    if X>=500:
        X=X-500
        G=G+1000
    elif X>=5:
        X=X-5
        G=G+5
    else:
        break
        
print(G)
Buggy python submission (verdict: Runtime Error):
S=int(input())
if S[0]==S[1]:
    print('Yes')
elif S[1]==S[2]:
    print('Yes')
elif S[0]==S[2]:
    print('Yes')
else:
    print('No')
    


Fixed submission:
S=input()
if S[0]!=S[1]:
    print('Yes')
elif S[1]!=S[2]:
    print('Yes')
elif S[0]!=S[2]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
S,T=map(input()split())
print(T.S)

Fixed submission:
S,T=input().split()
S=T+S
print(S)
Buggy python submission (verdict: Runtime Error):
A=list(map(int,input()split()))
B=0
B=A[0]+A[1]+A[2]
if B>=22:
    print("bust")
else:
    print("win")

Fixed submission:
A=list(map(int,input().split()))
B=0
B=A[0]+A[1]+A[2]
if B>=22:
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
x, n = map(int, input().split())
if n == 0:
    print(x)
    exit()

p = np.array(list(map(int, input().split())))
for i in range(100):
    if not x-i in p:
        print(x-i)
        exit()
    elif not x+i in p:
        print(x+i)
        exit()

Fixed submission:
import numpy as np

x, n = map(int, input().split())
if n == 0:
    print(x)
    exit()

p = np.array(list(map(int, input().split())))
for i in range(100):
    if not x-i in p:
        print(x-i)
        exit()
    elif not x+i in p:
        print(x+i)
        exit()
Buggy python submission (verdict: Runtime Error):
import numpy as np
a = int(input())
b = np.array(list(map(int, input().split())))
b = np.prod(b)
if b > 10**18:
    print(-1)
else:print(b)


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

Buggy python submission (verdict: Runtime Error):
import numpy as np
a = int(input())
b = np.array(list(map(int, input().split())))
b = np.prod(b)
if b >= 10**18:
    print(-1)
else:print(b)

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