Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
arr_a = list(map(int, input().split()))

mod = 10**9 + 7

ans = 0
for i in range(n):
    b = sum(arr_a[i+1:])
    b = b % mod
    ans += arr_a[i] * b
    ans = ans % mod

print(ans)


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

mod = 10**9 + 7
memo = {}

for i in range(n):
    if i == 0:
        memo[n-i-1] = 0
    else:
        memo[n-i-1] = (memo[n-i] + arr_a[n-i]) % mod

ans = 0
for i in range(n):
    ans += arr_a[i] * memo[i]
    ans = ans % mod

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
arr_a = list(map(int, input().split()))

sum_a = sum(arr_a)
mod = 10**9 + 7

ans = 0
for i in range(n):
    b = sum(arr_a[i+1:])
    b = b % mod
    ans += arr_a[i] * b
    ans = ans % mod

print(ans)


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

mod = 10**9 + 7
memo = {}

for i in range(n):
    if i == 0:
        memo[n-i-1] = 0
    else:
        memo[n-i-1] = (memo[n-i] + arr_a[n-i]) % mod

ans = 0
for i in range(n):
    ans += arr_a[i] * memo[i]
    ans = ans % mod

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
arr_a = list(map(int, input().split()))

sum_a = sum(arr_a)
mod = 10**9 + 7

ans = 0
for i in range(n):
    b = sum(arr_a[i+1:])
    ans += arr_a[i] * b
    ans = ans % mod

print(ans)


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

mod = 10**9 + 7
memo = {}

for i in range(n):
    if i == 0:
        memo[n-i-1] = 0
    else:
        memo[n-i-1] = (memo[n-i] + arr_a[n-i]) % mod

ans = 0
for i in range(n):
    ans += arr_a[i] * memo[i]
    ans = ans % mod

print(ans)
Buggy python submission (verdict: Runtime Error):
n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")


Fixed submission:
n=int(input())
d=list(map(int, [input() for i in range(n)]))
print(len(set(d)))

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

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(f'{x} {y} {n-x-y}')
            exit()

print('-1 -1 -1')

Fixed submission:
n=int(input())
d=list(map(int, [input() for i in range(n)]))
print(len(set(d)))

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

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(f'{x} {y} {n-x-y}')
            exit()

print('-1 -1 -1')

Fixed submission:
n=int(input())
d=list(map(int, [input() for i in range(n)]))
print(len(set(d)))

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

for x in range(n + 1):
    for y in range(n + 1):
        for z in range(n + 1 - x - y):
            if x * 10000 + y * 5000 + z * 1000 == sum:
                print(f'{x} {y} {z}')
                exit()

print('-1 -1 -1')

Fixed submission:
n=int(input())
d=list(map(int, [input() for i in range(n)]))
print(len(set(d)))
Buggy python submission (verdict: Runtime Error):
n, sum = map(int, input().split())
for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(f'{x} {y} {n-x-y}')
            exit()

print(-1, -1, -1)

Fixed submission:
n, sum = [int(s) for s in input().split()]

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(x, y, n-x-y)
            exit()

print(-1, -1, -1)

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

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(f'{x} {y} {n-x-y}')
            exit()

print('-1 -1 -1')

Fixed submission:
n, sum = [int(s) for s in input().split()]

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(x, y, n-x-y)
            exit()

print(-1, -1, -1)

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

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(f'{x} {y} {n-x-y}')
            exit()

print('-1 -1 -1')

Fixed submission:
n, sum = [int(s) for s in input().split()]

for x in range(n + 1):
    for y in range(n - x + 1):
        if x * 10000 + y * 5000 + (n-x-y) * 1000 == sum:
            print(x, y, n-x-y)
            exit()

print(-1, -1, -1)
Buggy python submission (verdict: Runtime Error):
input()
s = list(map(int, input().split()))

cnt = 0
while True:
    if len(n for n in s if n % 2 != 0) != 0:
        print (cnt)
        break
    else:
        s = list(map(lambda n: n / 2, s))
        cnt = cnt + 1



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

cnt = 0
while True:
    if len([n for n in s if n % 2 != 0]) != 0:
        print (cnt)
        break
    else:
        s = list(map(lambda n: n / 2, s))
        cnt = cnt + 1

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

cnt = 0
while True:
    if len(n for n in s if n % 2 != 0) != 0:
        print (cnt)
        break
    else:
        s = map(lambda n: n / 2, s)



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

cnt = 0
while True:
    if len([n for n in s if n % 2 != 0]) != 0:
        print (cnt)
        break
    else:
        s = list(map(lambda n: n / 2, s))
        cnt = cnt + 1
Buggy python submission (verdict: Runtime Error):
m, t, s = input().split()
if m // s <= t:
  print('YES')
else:
  print('No')

Fixed submission:
m, t, s = input().split()
if float(m) / float(s) <= float(t):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if b > a:
    if a < 0:
        if b < 0:
            ab = -b - -a
        else:
            ab = -a + b
    else:
        ab = b - a
else:
    if b < 0:
        if q < 0:
            ab = -a - -b
        else:
            ab = -b + a
    else:
        ab = a - b


vt = v * t
wt = w * t



if vt - wt >= ab:
    print("YES")
else:
    print("NO")

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

if b > a:
    if a < 0:
        if b < 0:
            ab = -a - -b
        else:
            ab = -a + b
    else:
        ab = b - a
else:
    if b < 0:
        if a < 0:
            ab = -b - -a
        else:
            ab = -b + a
    else:
        ab = a - b


vt = v * t
wt = w * t



if vt - wt >= ab:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

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

ans = 1
for i in a:
    ans = ans * i
    if 0 in a:
        ans = 0
        break
    if ans > 10**18:
        ans = -1
        break
print(ans)

Fixed submission:
n = int(input())

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

ans = 1
if 0 not in a:
    for i in a:
        ans = ans * i
        if ans > 10**18:
            ans = -1
            break
else:
    ans = 0
print(ans)
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())

d = int(input())

num = [int(input()) for _ in range(n)]

print(n - d)

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

ans = []

for i in range(k*2):
  x = input().split()
  if 1 == i % 2:
    for j in range(len(x)):
      if int(x[j]) not in ans:
        ans.append(int(x[j]))

print(n - len(ans))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

ans = []

for i in range(n):
  s = input()
  if s in ans:
    pass
  else:
    ans.append(s)

print(len(ans))

Fixed submission:
n = int(input())

s = [input() for _ in range(n)]

print(len(set(s)))
Buggy python submission (verdict: Time Limit Exceeded):
import math
k = int(input())

ans = 0

for a in range(1, k+1):
    for b in range(1, k+1):
        for c in range(1, k+1):
            x = math.gcd(a, b)
            y = math.gcd(x, c)
            ans += y

print(ans)


Fixed submission:
import math
k = int(input())

ans = 0

for a in range(1, k+1):
    for b in range(1, k+1):
        for c in range(1, k+1):
            x = math.gcd(a, b)
            y = math.gcd(x, c)
            ans += y

print(ans)
Buggy python submission (verdict: Runtime Error):
x = int(input())
x_list = 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
print(y[x])


Fixed submission:
x = int(input())
y = 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51
print(y[x-1])
Buggy python submission (verdict: Runtime Error):
num = map(int, input().split())
A = max(num)
B = min(num)

X = A*B
num = 0
while X >= num:
  num += B
  if 0 == num % A:
    print(num)
    break
  elif X == num:
    print(num)


Fixed submission:
num = [int(i) for i in input().split()]
A = max(num)
B = min(num)

X = A*B
num = 0
while X >= num:
  num += B
  if 0 == num % A:
    print(num)
    break
  elif X == num:
    print(num)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 0

for i in range(n - 1):
    for j in range(i + 1, n):
        ans += a[i] * a[j]

ans = ans % (10 ** 9 + 7)

print(ans)

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

sum_a = sum(a)

ans = 0

for i in range(n - 1):
    sum_a -= a[i]
    ans += a[i] * sum_a

ans = ans % (10 ** 9 + 7)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

digit_sum = 0

while n > 0:
    digit_sum += n % 10
    n = n // 10

ans = digit_sum % 9

if ans == 0:
    print('Yes')
else:
    print('No')


Fixed submission:
n = int(input())

result = sum(list(map(int, str(n))))

if result % 9 == 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n, m, k = map(int, input().split())

A = list(map(int, input().split()))
B = list(map(int, input().split()))

a = [0] * (n + 1)
b = [0] * (m + 1)

for i in range(1, n + 1):
    a[i] = A[i - 1] + a[i - 1]

for j in range(1, m + 1):
    b[j] = B[j - 1] + b[j - 1]

ans = 0

for i in range(n + 1):
    if a[i] > k:
        break
    for j in range(m, -1, -1):
        if b[j] <= k - a[i]:
            break
    ans = max(ans, i + j)

print(ans)

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

A = list(map(int, input().split()))
B = list(map(int, input().split()))

a = [0] * (n + 1)
b = [0] * (m + 1)

for i in range(1, n + 1):
    a[i] = A[i - 1] + a[i - 1]

for j in range(1, m + 1):
    b[j] = B[j - 1] + b[j - 1]

ans = 0
num_b = m

for i in range(n + 1):
    if a[i] > k:
        break
    for j in range(num_b, -1, -1):
        if b[j] <= k - a[i]:
            break
        num_b -= 1
    ans = max(ans, i + j)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 0

for i in range(n):
    for j in range(n):
        if i == j:
            continue
        if a[i] % a[j] == 0:
            break
    else:
        ans += 1

print(ans)

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

m = 10 ** 6 + 7

count = [0] * m

for x in a:
    if count[x] != 0:
        count[x] = 2
        continue

    for i in range(x, m, x):
        count[i] += 1

ans = 0
for x in a:
    if count[x] == 1:
        ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 1

for i in range(n):
    ans *= a[i]

if ans <= 10 ** 18:
    print(ans)
else:
    print(-1)

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

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

ans = 1

for i in range(n):
    ans *= a[i]
    if ans > 10 ** 18:
        print(-1)
        exit()

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())

sum = 0

for i in N + 1:
    if i % 3 == 0 or i % 5 == 0:
        continue
    else:
        sum += i

print(sum)

Fixed submission:
N = int(input())

sum = 0

for i in range(N + 1):
    if i % 3 == 0 or i % 5 == 0:
        continue
    else:
        sum += i

print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
import math
n=int(input())
ans=0
for i in range(1,n+1):
    for j in range(1,n+1):
        for k in range(1,n+1):
            ans+=math.gcd(math.gcd(i,j),k)
print(ans)


Fixed submission:
import math


K = int(input())

sum = 0

for i in range(1, K + 1):
    for j in range(1, K + 1):
        sum += math.gcd(i, j)
        if j == K:
            break
        else:
            for k in range(j + 1, K + 1):
                sum += math.gcd(i, math.gcd(j, k)) * 2

print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
import math


K = int(input())

sum = 0

for i in range(1, K + 1):
    for j in range(1, K + 1):
        for k in range(1, K + 1):
            sum += math.gcd(i, math.gcd(j, k))

print(sum)



Fixed submission:
import math


K = int(input())

sum = 0

for i in range(1, K + 1):
    for j in range(1, K + 1):
        sum += math.gcd(i, j)
        if j == K:
            break
        else:
            for k in range(j + 1, K + 1):
                sum += math.gcd(i, math.gcd(j, k)) * 2

print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a, b):
    if b == 0:
        return a

    return gcd(b, a % b)


K = int(input())

sum = 0

for i in range(1, K + 1):
    for j in range(1, K + 1):
        for k in range(1, K + 1):
            tmp = gcd(j, k)
            sum += gcd(i, tmp)

print(sum)



Fixed submission:
import math


K = int(input())

sum = 0

for i in range(1, K + 1):
    for j in range(1, K + 1):
        sum += math.gcd(i, j)
        if j == K:
            break
        else:
            for k in range(j + 1, K + 1):
                sum += math.gcd(i, math.gcd(j, k)) * 2

print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

R = S.count('R')
G = S.count('G')
B = S.count('B')

ans = R * G * B

for i in range(N):
    for j in range(i + 1, N):
        if S[i] != S[j]:
            k = 2 * j - i
            if k < N:
                if S[i] != S[j] and S[i] != S[k] and S[j] != S[k]:
                    ans -= 1

print(ans)

Fixed submission:
N = int(input())
S = input()

R = S.count('R')
G = S.count('G')
B = S.count('B')

ans = R * G * B

for i in range(N):
    for j in range(i + 1, N):
        if S[i] != S[j]:
            k = 2 * j - i
            if k >= N:
                break
            if S[i] != S[j] and S[i] != S[k] and S[j] != S[k]:
                ans -= 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
Q = int(input())

T = 0
for i in range(Q):
    Query = list(input().split())
    if Query[0] == "1" :
        T = T + 1
    elif Query[0] == "2" :
        if T % 2 == 0 :
            if Query[1] == "1" :
                S = Query[2] + S
            elif Query[1] == "2" :
                S = S + Query[2]
        elif T % 2 == 1 :
            if Query[1] == "1" :
                S = S + Query[2]
            elif Query[1] == "2" :
                S = Query[2] + S

if T % 2 == 1 :
    S = S[::-1]

print(S)

Fixed submission:
S = input()
Q = int(input())

T = ""
for i in range(Q) :
    Query = list(input().split())
    if Query[0] == "1" :
        S, T = T, S
    elif Query[0] == "2" :
        if Query[1] == "1" :
            T = T + Query[2]
        elif Query[1] == "2" :
            S = S + Query[2]

T = T[::-1]
T = T + S
print(T)

Buggy python submission (verdict: Time Limit Exceeded):
S = input()
Q = int(input())

for i in range(Q):
    Query = list(input().split())
    if Query[0] == "1" :
        S = S[::-1]
    if Query[0] == "2" :
        if Query[1] == "1" :
            S = Query[2] + S
        elif Query[1] == "2" :
            S = S + Query[2]

print(S)

Fixed submission:
S = input()
Q = int(input())

T = ""
for i in range(Q) :
    Query = list(input().split())
    if Query[0] == "1" :
        S, T = T, S
    elif Query[0] == "2" :
        if Query[1] == "1" :
            T = T + Query[2]
        elif Query[1] == "2" :
            S = S + Query[2]

T = T[::-1]
T = T + S
print(T)
Buggy python submission (verdict: Runtime Error):
n = int(input())
words = {}

for i in range(n) :
    new_word = input()
    if new_word in words.keys() :
        words[new_word] += 1
    else :
        words[new_word] = 1

mx_freq = max(words.values())
mx_words = [k for k in words.items() if words[k] == mx_freq]

mx_words.sort()

for mx_word in mx_words :
    print(mx_word)

Fixed submission:
n = int(input())
dictionary = {}
for i in range(n) :
    new_word = input()
    if new_word in dictionary.keys() :
        dictionary[new_word] += 1
    else :
        dictionary[new_word] = 1

max_val = max(dictionary.values())
keys_of_max_val = [key for key in dictionary if dictionary[key] == max_val]

keys_of_max_val.sort()

for word in keys_of_max_val :
    print(word)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
dictionary = {}
for i in range(n) :
    new_word = input()
    if new_word in dictionary.keys() :
        dictionary[new_word] += 1
    else :
        dictionary[new_word] = 1

max_word_list = [k for k, v in dictionary.items() if v == max(dictionary.values())]

max_word_list.sort()

for word in max_word_list :
    print(word)

Fixed submission:
n = int(input())
dictionary = {}
for i in range(n) :
    new_word = input()
    if new_word in dictionary.keys() :
        dictionary[new_word] += 1
    else :
        dictionary[new_word] = 1

max_val = max(dictionary.values())
keys_of_max_val = [key for key in dictionary if dictionary[key] == max_val]

keys_of_max_val.sort()

for word in keys_of_max_val :
    print(word)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = []

for _ in range(n):
    a.append(int(input()))

for i in range(n):
    a_removed = a.copy()
    del a_removed[i]
    print(max(a_removed))

Fixed submission:
n = int(input())

a = []

for _ in range(n):
    a.append(int(input()))

a_max = max(a)
a_max_index = a.index(a_max)

a.sort(reverse=True)
a_second_max = a[1]

for i in range(n):
    if i == a_max_index:
        print(a_second_max)
    else:
        print(a_max)
Buggy python submission (verdict: Runtime Error):
d, t, s = map(int,input().split())

arrival = d/s

if arrival > t:
  print('no')
 else:
   print('yes')


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

if d/s > t:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())


root = list(range(n + 1))


from collections import defaultdict
d = defaultdict(set)



def find(i):
    if i == root[i]:
        return i
    root[i] = find(root[i])
    return root[i]

def union(u, v):
    fu, fv = find(u), find(v)
    if fu == fv:
        d[min(fu, fv)].add(max(u, v))
        return
    root[max(u, v)] = min(fu, fv)
    # root[u] = fv
    d[min(fu, fv)].add(max(u, v))



for i in range(m):
    u, v = map(int, input().split())
    union(u, v)



# print(d)
print(max(map(len, d.values())) + 1)


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


root = list(range(n + 1))


# from collections import defaultdict
# d = defaultdict(set)
cnt = [1] * (n + 1)


def find(i):
    if i == root[i]:
        return i
    root[i] = find(root[i])
    return root[i]

def union(u, v):
    fu, fv = find(u), find(v)
    if fu == fv:
        return
    cnt[min(fu, fv)] += cnt[max(fu, fv)]
    root[max(fu, fv)] = min(fu, fv)



for i in range(m):
    u, v = map(int, input().split())
    union(u, v)



# print(d)
print(max(cnt))

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


root = list(range(n + 1))


from collections import Counter
d = Counter()



def find(i):
    if i == root[i]:
        return i
    root[i] = find(root[i])
    return root[i]

def union(u, v):
    fu, fv = find(u), find(v)
    if fu == fv:
        return
    root[max(u, v)] = min(fu, fv)
    # root[u] = fv
    d[min(fu, fv)] += 1



for i in range(m):
    u, v = map(int, input().split())
    union(u, v)



# print(d)
print(max(d.values()) + 1)



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


root = list(range(n + 1))


# from collections import defaultdict
# d = defaultdict(set)
cnt = [1] * (n + 1)


def find(i):
    if i == root[i]:
        return i
    root[i] = find(root[i])
    return root[i]

def union(u, v):
    fu, fv = find(u), find(v)
    if fu == fv:
        return
    cnt[min(fu, fv)] += cnt[max(fu, fv)]
    root[max(fu, fv)] = min(fu, fv)



for i in range(m):
    u, v = map(int, input().split())
    union(u, v)



# print(d)
print(max(cnt))
Buggy python submission (verdict: Runtime Error):
[A, B, C] = list(map(int, input().split(' ')))

print(C + ' ' + A + ' ' + B)

Fixed submission:
[A, B, C] = list(map(str, input().split(' ')))

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

if(A[M] < (1 / 4 *sum(A))):
    print('No')
else:
    print('Yes')



Fixed submission:
[N, M] = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
A = sorted(A, reverse=True)

if(A[M-1] < (sum(A) * 1 / (4 * M))):
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
s,d = map(str, open(0).read().split())
ss = list(s)
dd = list(d)
a = 0
for i in range(ss):
  if(ss[i] == dd[i]):
    a += 1
    
print(a)

Fixed submission:
s,d = map(str, open(0).read().split())
ss = list(s)
dd = list(d)
a = 0
for i in range(len(ss)):
  if(ss[i] == dd[i]):
    a += 1
    
print(a)
Buggy python submission (verdict: Runtime Error):
values = map(int, input().split())
AplusB = values[0] + values[1]
AminusB = values[0] - values[1]
AtimesB = values[0] * values[1]
print(max([AplusB, AminusB, AtimesB]))

Fixed submission:
values = list(map(int, input().split(' ')))
AplusB = values[0] + values[1]
AminusB = values[0] - values[1]
AtimesB = values[0] * values[1]
print(max([AplusB, AminusB, AtimesB]))