Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
X = input()
ans = 0
r=0
g=0
b=0
G = []
R = []
B = []
for i in range(0,N):
    if(X[i] == 'G'):
        G.append(i)
        g+=1
for k in range(0,N):
    if(X[k] == 'R'):
        R.append(k)
        r+=1
for j in range(0,N):
    if(X[j] == 'B'):
        B.append(j)
        b+=1
ans = r*b*g
for i in G:
    for k in R:
        for j in B:
            if(i<k):
                if(k<j):
                    if(j-k == k-i):
                        ans -=1
                else:
                    if(i<j):
                        if(k-j == j-i):
                            ans -=1
                    else:
                        if(k-i == i-j):
                            ans -= 1
            else:
                if(i<j):
                    if(j-i == i-k):
                        ans -=1
                else:
                    if(k<j):
                        if(i-j == j-k):
                            ans -= 1
                    else:
                        if(i-k == k-j):
                            ans -= 1
print(ans)

Fixed submission:
N = int(input())
X = input()
ans = 0
r=0
g=0
b=0
G = []
R = []
B = []
for i in range(0,N):
    if(X[i] == 'G'):
        G.append(i)
        g+=1
for k in range(0,N):
    if(X[k] == 'R'):
        R.append(k)
        r+=1
for j in range(0,N):
    if(X[j] == 'B'):
        B.append(j)
        b+=1
ans = r*b*g
for i in range(0,N):
    for j in range(i+1,N):
        if(2*j-i < N) and X[i] != X[j]:
            if(X[2*j-i] != X[i]) and (X[2*j-i] != X[j]):
                ans -= 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
X = input()
ans = 0
for i in range(0,N):
    for k in range(i+1,N):
        if(X[i] != X[k]):
            for j in range(k+1,N):
                if(X[j] != X[i])and(X[j] != X[k])and(j-k != k-i):
                    ans += 1
print(ans)

Fixed submission:
N = int(input())
X = input()
ans = 0
r=0
g=0
b=0
G = []
R = []
B = []
for i in range(0,N):
    if(X[i] == 'G'):
        G.append(i)
        g+=1
for k in range(0,N):
    if(X[k] == 'R'):
        R.append(k)
        r+=1
for j in range(0,N):
    if(X[j] == 'B'):
        B.append(j)
        b+=1
ans = r*b*g
for i in range(0,N):
    for j in range(i+1,N):
        if(2*j-i < N) and X[i] != X[j]:
            if(X[2*j-i] != X[i]) and (X[2*j-i] != X[j]):
                ans -= 1
print(ans)
Buggy python submission (verdict: Runtime Error):
nums = [int(e) for e in input().split]
a = nums[0]
nums[0] = nums[2]
nums[2] = a
print(str(nums[0]) + ' ' + str(nums[1]) + ' ' + str(nums[2]))

Fixed submission:
nums = [int(e) for e in input().split()]
a = nums[0]
nums[0] = nums[1]
nums[1] = a
a=nums[0]
nums[0] = nums[2]
nums[2] = a
print(str(nums[0]) + ' ' + str(nums[1]) + ' ' + str(nums[2]))
Buggy python submission (verdict: Runtime Error):
nums1=[int(e) for e in input().split()]
nums2=[int(t) for t in input().split()]
all_vote = 0
sum = nums1[0]
for num in nums2:
  all_vote += num
for k in nums2:
  if (k/(all_vote) < 1/(4*nums1[1])):
    sum-=1
if(nums1[1]<=sum):
  print(Yes)
else:
  print(No)

Fixed submission:
nums1=[int(e) for e in input().split()]
nums2=[int(t) for t in input().split()]
all_vote = 0
sums = nums1[0]
for num in nums2:
  all_vote += num
for k in nums2:
  if (k/(all_vote) < 1/(4*nums1[1])):
    sums-=1
if(nums1[1]<=sums):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
t=True
while t:
    a = abs(Min - y)
    if(a<Min):
        Min = a
    elif(a>Min):
        t = False
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
t=True
while t:
    a = abs(Min - y)
    if(a<Min):
        Min = a
    elif(a>Min):
        break
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)

Buggy python submission (verdict: Runtime Error):
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
t=True
while t:
    a = abs(Min-y)
  if(a<Min):
    Min = a
  elif(a>Min):
    break
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
t=True
while t:
  if(abs(Min -y)<Min):
    Min = abs(Min-y)
  elif(abs(Min - y) > Min):
    break
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
nums = [int(e) for e in input().split()]
x=nums[0]
y=nums[1]
Min = x
t=True
while t:
  a = Min-y
  if(abs(a)<Min):
    Min = abs(a)
  elif(abs(Min - y) > Min):
    break
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
nums = [int(e) for e in input().split()]
x=nums[0]
y=nums[1]
Min = x
t=True
while t:
  a = Min-y
  if(abs(a)<Min):
    Min = abs(a)
  elif(abs(Min - y) > Min):
    break
print(Min)

Fixed submission:
nums = [int(e) for e in input().split()]
Min=nums[0]
y=nums[1]
ans = Min % y
t = True
if (ans <= Min):
    Min = ans
    while t:
        a = abs(Min - y)
        if(a<Min):
            Min = a
        elif(a>Min):
            break
    print(Min)
else:
    print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 1
t = 10**9+7
for i in range(1,N+1):
    ans *= i
print(ans%t)

Fixed submission:
N = int(input())
ans = 1
t = 10**9+7
for i in range(1,N+1):
    ans = (ans*i)%t
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
prime=[]
count=[]
ans = 1
place = 0
n = math.factorial(N)
tmp = int(math.sqrt(n))+1
for k in range(1,N+1):
    for i in range(2,tmp):
        while k % i == 0:
            k //= i
            if(i in prime):
                count[prime.index(i)] += 1
            else:
                prime.append(i)
                count.append(1)
                place += 1
for j in range(0,place):
    ans *= (count[j]+1)
print(ans)

Fixed submission:
import math
N = int(input())
prime=[]
count=[]
ans = 1
place = 0
t=10**9
t+=7
for k in range(1,N+1):
    for i in range(2,k+1):
        while k % i == 0:
            k //= i
            if(i in prime):
                count[prime.index(i)] += 1
            else:
                prime.append(i)
                count.append(1)
                place += 1
for j in range(0,place):
    ans *= (count[j]+1)
print(ans%t)
Buggy python submission (verdict: Time Limit Exceeded):
X = [int(e) for e in input().split()]
ans = 0
for i in range(0,X[0]+1):
    for k in range(0,X[0]+1):
        for j in range(0,X[0]+1):
            if(i + k + j)==X[1]:
                ans += 1
                break
print(ans)


Fixed submission:
X = [int(e) for e in input().split()]
ans = 0
for i in range(0,X[0]+1):
    for k in range(0,X[0]+1):
        if(X[1] - (i+k))<=X[0] and X[1] - i - k >= 0:
            ans += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
x = [int(e) for e in input().split()]
a = x[0]
b = x[1]
c = x[2]
ans = 0
for i in range(a,b+1):
    if(c !=0)and(i%c)==0:
        ans+=1
print(ans)

Fixed submission:
x = [int(e) for e in input().split()]
a = x[0]
b = x[1]
c = x[2]
ans = 0
ans = (b//c) - (a-1)//c 
print(ans)
Buggy python submission (verdict: Runtime Error):
X = [int(e) for e in input().split()]
A = [int(f) for f in input().split()]
i=0
ans=0
while i<X[0]:
    if(A[i] + A[i+1]) <= X[1] and i+1 < X[0]:
        i+=1
    else:
        A[i+1] -= 1
        ans += 1
        continue
    i+=1
print(ans)

Fixed submission:
X = [int(e) for e in input().split()]
candies = [int(f) for f in input().split()]
i=1
ans=0
t = 0
while i<X[0]:
    if(candies[i-1]+candies[i]) > X[1] :
        t = (candies[i-1]+candies[i]) - X[1]
        ans += t
        if(t>=candies[i]):
            candies[i] = 0
        else:
            candies[i] -= t
    i+=1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
res = 1
a = map(int, input().split())
for x in a:
    res *= x
if res > 1e18:
    res = -1
print(res)


Fixed submission:
def solve():
    _ = int(input())
    a = list(map(int, input().split()))
    res = 1
    for x in a:
        if x == 0:
            print(0)
            return
    for x in a:
        res *= x
        if res > int(1e18):
            print(-1)
            return
    print(res)


solve()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
res = 1
a = map(int, input().split())
for x in a:
    res *= x
if res > 1e18:
    res = -1
print(res)


Fixed submission:
def solve():
    _ = int(input())
    a = list(map(int, input().split()))
    res = 1
    for x in a:
        if x == 0:
            print(0)
            return
    for x in a:
        res *= x
        if res > int(1e18):
            print(-1)
            return
    print(res)


solve()
Buggy python submission (verdict: Time Limit Exceeded):
paramA, paramB, paramC, paramK = list(map(lambda x: int(x), input().split(' ')))
params = [1 for i in range(paramA)]
params.extend([0 for i in range(paramB)])
params.extend([-1 for i in range(paramC)])

result = 0
for p in params:
    if paramK > 0:
        result += p
        paramK -= 1

print(result)

Fixed submission:
paramA, paramB, paramC, paramK = list(map(lambda x: int(x), input().split(' ')))

result = min(paramA, paramK)
paramK -= paramA
if paramK > 0:
    paramK -= paramB
    if paramK > 0:
        result -= min(paramC, paramK)

print(result)
Buggy python submission (verdict: Time Limit Exceeded):
param_n = int(input())
params1 = list(map(lambda x: int(x), input().split(' ')))

for i in range(param_n):
    print(len(list(filter(lambda x: x == i + 1, params1))))

Fixed submission:
param_n = int(input())
params1 = list(map(lambda x: int(x), input().split(' ')))

result = [0 for i in range(param_n)]

for employee in params1:
    result[employee - 1] += 1

for num in result:
    print(num)

Buggy python submission (verdict: Time Limit Exceeded):
# 部下の人数を返す
def get_subordinates(my_number):
    counter = 0
    for i, employee in enumerate(params1):
        if employee == my_number:
            counter += 1
    return counter

param_n = int(input())
params1 = list(map(lambda x: int(x), input().split(' ')))

for i in range(param_n):
    print(get_subordinates(i + 1))

Fixed submission:
param_n = int(input())
params1 = list(map(lambda x: int(x), input().split(' ')))

result = [0 for i in range(param_n)]

for employee in params1:
    result[employee - 1] += 1

for num in result:
    print(num)
Buggy python submission (verdict: Runtime Error):
#coding: utf-8

inputN, inputK = map(int, input().split())
inputA = list(map(int, input().split()))
minNumber = inputN
minPos = 0

if inputN == inputK:
    print (1)
elif inputN <= (inputK-1)*100000 + 1:
    for i in range(2, 100001):
        if inputN <= (inputK-1)*i + 1:
            print (i)
            break
else:

    for i in range(len(inputA)):
        if inputA[i] < minNumber:
            minNumber = inputA[i]
            minPos = i

    splitNumber = (inputN + 1) / (inputK - 1)
    print (int(splitNumber))


Fixed submission:
#coding: utf-8

counter = 0
inputStr = input()

strA = "+"
strB = "-"

for i in range(1, 5):
    if inputStr[i-1:i] == strA:
        counter += 1
    else:
        counter -= 1

print (counter)

Buggy python submission (verdict: Runtime Error):
#coding: utf-8

inputN, inputK = map(int, input().split())
inputA = list(map(int, input().split()))
minNumber = inputN
minPos = 0

if inputN == inputK:
    print (1)
elif inputN <= (inputK-1)*2 + 1:
    print (2)
elif inputN <= (inputK-1)*3 + 1:
    print (3)
elif inputN <= (inputK-1)*4 + 1:
    print (4)
elif inputN <= (inputK-1)*5 + 1:
    print (5)
else:
    for i in range(len(inputA)):
        if inputA[i] < minNumber:
            minNumber = inputA[i]
            minPos = i

    splitNumber = (inputN + 1) / (inputK - 1)
    print (int(splitNumber))



Fixed submission:
#coding: utf-8

counter = 0
inputStr = input()

strA = "+"
strB = "-"

for i in range(1, 5):
    if inputStr[i-1:i] == strA:
        counter += 1
    else:
        counter -= 1

print (counter)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = input().split()
res = 1
for i in a:
  res *= int(i)
if res > 10 ** 18:
  res = -1
print(res)


Fixed submission:
def f(a):
	res = 1
	for i in range(n):
		res *= int(a[i])
		if res > 10 ** 18:
			if zer(i):
				return 0
			else:
				return -1
	return res

def zer(i):
	for j in range(i, n):
		if a[j] == "0":
			return True
	return False
n = int(input())
a = input().split()

print(f(a))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
res = 1
for i in a:
  res *= i
if res > 10 ** 18:
  res = -1
print(res)

Fixed submission:
def f(a):
	res = 1
	for i in range(n):
		res *= int(a[i])
		if res > 10 ** 18:
			if zer(i):
				return 0
			else:
				return -1
	return res

def zer(i):
	for j in range(i, n):
		if a[j] == "0":
			return True
	return False
n = int(input())
a = input().split()

print(f(a))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
li = [0] * (n+1)
for i in range(len(a)):
	if li[a[i]] == 0:
		li[a[i]] = a.count(a[i])
#print(li)
li = li[1:]
print(*li, sep = "\n")


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
li = [0] * (n+1)
for i in range(len(a)):
	li[a[i]] += 1
#print(li)
li = li[1:]
print(*li, sep = "\n")
Buggy python submission (verdict: Runtime Error):
A, B = [int(x) for x in stdin.readline().rstrip().split()]
print(A * B)

Fixed submission:
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
print(A * B)
Buggy python submission (verdict: Runtime Error):
A,B=input().split()
print(int(A)*int(B.replace(".", ""))//100)

Fixed submission:
from sys import stdin
N = stdin.readline().rstrip()
An = [int(x) for x in stdin.readline().rstrip().split()]
W = 1
if any([A == 0 for A in An]):
    print(0)
    exit()
for A in An:
    W = W * A
    if 1000000000000000000 < W:
        print(-1)
        exit()
print(W)

Buggy python submission (verdict: Time Limit Exceeded):
input()
l = map(int, input().split())
r = 1
for i in l:
    r *= i
print(-1 if r > 1e18 else r)

Fixed submission:
input()
l = list(map(int, input().split()))
if 0 in l:
    print(0)
else:
    r = 1
    for i in l:
        r *= i
        if r > 1e18:
            break
    print(-1 if r > 1e18 else r)
Buggy python submission (verdict: Runtime Error):
a, b = input().split()
a = int(a)
b = int(round(b * 100))
print(int(rount(a * b / 100)))

Fixed submission:
a, b = input().split()
b = int(b[0] + b[2:])
print(str(int(a) * b)[0:-2] or 0)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
n = int(input())
a = map(int, input().split())

r = 1
for num in a:
  r *= num

if r > 1e18:
  print(-1)
else:
  print(r)


Fixed submission:
import sys
n = int(input())
a = [int(num) for num in input().split()]

if 0 in a:
  print(0)
  sys.exit()

r = 1
for num in a:
  r *= num
  if r > 1e18:
    print(-1)
    sys.exit()

print(r)
Buggy python submission (verdict: Runtime Error):
import math

a, b = [float(num) for num in input().split()]
r = floor(a * b)
print(r)


Fixed submission:
a, b = [float(num) for num in input().split()]
a = int(a)
b = round(b * 100)
r = a * b // 100
print(r)
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    n, m = map(int, input().split())
    a = [int(i) for i in input().split()]
    s = sum(a)
    a = sorted(a)[::-1]
    if a[m-1] >= (s / (4 * m)):
        print("Yes")
    else:
        print("No")


Fixed submission:
import sys


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(c, a, b)

Buggy python submission (verdict: Runtime Error):
import sys


if __name__ == '__main__':
    print(f"{sys.argv[-1]} {sys.argv[1]} {sys.argv[2]}")


Fixed submission:
import sys


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(c, a, b)
Buggy python submission (verdict: Runtime Error):
import math
A, B = map(int, input().split())
S = '100' + str(B)
S = int(S)

ans = A * B /100
print(ans)

Fixed submission:
import math
A, B = map(float, input().split())
A = int(A)
B = int(B*1000)
ans = A * B // 1000
print(ans)
Buggy python submission (verdict: Runtime Error):
N, K =map(int, input().split())
snuke = [0]*N

for i in range(K):
    d = int(input())
    a = list(map(int,input().split()))
    for j in range(d):
        snuke[a[j]] = 1

print(snuke.count(0))

Fixed submission:
N, K =map(int, input().split())
snuke = [0]*N

for i in range(K):
    d = int(input())
    a = list(map(int,input().split()))
    for j in range(d):
        snuke[a[j]-1] = 1

print(snuke.count(0))
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
H = list(map(int, input().split())) 
A = [0]*M
B = [0]*M
for i in range(M):
    A[i], B[i] = map(int, input().split())
    A[i] -= 1
    B[i] -= 1
lis = []
for i in range(M):
    if H[A[i]] < H[B[i]]:
        min.append(A[i])
    if H[A[i]] == H[B[i]]:
        min.append(A[i])
        min.append(B[i])
    if H[A[i]] > H[B[i]]:
        min.append(B[i])
print(len(set(lis)))

Fixed submission:
N, M = map(int, input().split())
H = list(map(int, input().split())) 
A = [0]*M
B = [0]*M
for i in range(M):
    A[i], B[i] = map(int, input().split())
    A[i] -= 1
    B[i] -= 1
lis = []
for i in range(M):
    if H[A[i]] < H[B[i]]:
        lis.append(A[i])
    if H[A[i]] == H[B[i]]:
        lis.append(A[i])
        lis.append(B[i])
    if H[A[i]] > H[B[i]]:
        lis.append(B[i])
print(len(H)-len(set(lis)))
Buggy python submission (verdict: Time Limit Exceeded):
S = input()[::-1]

cnts = [0]*2019

cnts[0] = 1

num = 0

d = 1

ans = 0

for i in S:
    num += int(i) * d
    d *= 10
    num %= 2019
    cnts[num] += 1

for j in cnts:
    ans += j * (j-1) // 2 

print(ans)

Fixed submission:
S = input()[::-1]

cnts = [0]*2019
cnts[0] = 1
num = 0
d = 1
ans = 0

for i in S:
    num += int(i) * d
    d *= 10
    num %= 2019
    d %= 2019
    cnts[num] += 1

for j in cnts:
    ans += j * (j-1) // 2 

print(ans)

Buggy python submission (verdict: Runtime Error):
S = str(input())
ans = 0

if len(S) <= 3:
    print(0)
else:   
    for i in range(len(S)-3):
        if S[i:i+3] % 2019 == 0:
            ans+=1
    print(ans)

Fixed submission:
S = input()[::-1]

cnts = [0]*2019
cnts[0] = 1
num = 0
d = 1
ans = 0

for i in S:
    num += int(i) * d
    d *= 10
    num %= 2019
    d %= 2019
    cnts[num] += 1

for j in cnts:
    ans += j * (j-1) // 2 

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
S = str(input())
ans = 0

if len(S) <= 3:
    print(0)
else:   
    for i in range(len(S)):
        for j in range(i+1,len(S)+1):
            if int(S[i:j]) % 2019 == 0:
                ans += 1
    print(ans)

Fixed submission:
S = input()[::-1]

cnts = [0]*2019
cnts[0] = 1
num = 0
d = 1
ans = 0

for i in S:
    num += int(i) * d
    d *= 10
    num %= 2019
    d %= 2019
    cnts[num] += 1

for j in cnts:
    ans += j * (j-1) // 2 

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
S = str(input())
ans = 0
for i in range(len(S)):
    for j in range(i+1,len(S)+1):
        if int(S[i:j]) % 2019 == 0:
            ans += 1

print(ans)

Fixed submission:
S = input()[::-1]

cnts = [0]*2019
cnts[0] = 1
num = 0
d = 1
ans = 0

for i in S:
    num += int(i) * d
    d *= 10
    num %= 2019
    d %= 2019
    cnts[num] += 1

for j in cnts:
    ans += j * (j-1) // 2 

print(ans)
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
St = ''
while len(St) < N:
    St += 'b' * A + 'r' * B
ans = 0

for i in range(0, N):
    if St[i] == 'b':
        ans += 1
    

print(ans)


Fixed submission:
N, A, B = map(int, input().split())
ans = N//(A+B) * A
tmp = N%(A+B)

print(ans + min(tmp, A))
Buggy python submission (verdict: Runtime Error):
N, K = map(int,input().split())
H = list(input().split())

H.sort(reverse=True)
print(sum(H[K:]))

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

H.sort(reverse=True)
print(sum(H[K:]))
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())

if (x==1)&(y==2):
    print('3')
elif (x==2)&(y==3):
    print('1')
elif x==3 & y==1:
    print('2')
elif x==1 & y==3:
    print('2')
elif x==2 & y==1:
    print('3')
else:print('1')

Fixed submission:
x = int(input())
y = int(input())

if (x==1)&(y==2):
    print('3')
elif (x==2)&(y==3):
    print('1')
elif (x==3) & (y==1):
    print('2')
elif (x==1) & (y==3):
    print('2')
elif (x==2) & (y==1):
    print('3')
elif (x==3) & (y==2):
    print('1')

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

if (x==1)&(y==2):
    print('3')
elif (x==2)&(y==3):
    print('1')
elif x==3 & y==1:
    print('2')
elif x==1 & y==3:
    print('2')
elif x==2 & y==1:
    print('3')
else:print('1')

Fixed submission:
x = int(input())
y = int(input())

if (x==1)&(y==2):
    print('3')
elif (x==2)&(y==3):
    print('1')
elif (x==3) & (y==1):
    print('2')
elif (x==1) & (y==3):
    print('2')
elif (x==2) & (y==1):
    print('3')
elif (x==3) & (y==2):
    print('1')
Buggy python submission (verdict: Runtime Error):
N = int(input())
S, T = list(input().split())

for i in range(1,N-1):
    S.insert(i+2,T[i])

ans = "".join(S)
print(ans)

Fixed submission:
N = int(input())
S, T = list(input().split())
S = list(S)
T = list(T)
j = 0
for i in range(0,N+N,2):
    S.insert(i+1,T[j])
    j +=1
print("".join(S))
Buggy python submission (verdict: Runtime Error):
import math
x,y = map(int,input().split())
ans = (x*y)/(math.gcd(x, y))
print(ans)

Fixed submission:
import fractions
x,y = map(int,input().split())
ans = (x*y)/(fractions.gcd(x, y))
print(round(ans))