Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def primes(n):
    primes = []
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    for i in range(len(is_prime)):
        if is_prime[i]:
            primes.append(i)
    return is_prime


Q = int(input())

ps = primes(10000)
like_numbers = [False] * 10001
for i in range(3, 10001, 2):
    if ps[i] and ps[(i + 1) // 2]:
        like_numbers[i] = True

like_numbers_cnt = [0] * 10001

for i in range(1, 10001):
    if like_numbers[i]:
        like_numbers_cnt[i] = like_numbers_cnt[i - 1] + 1
    else:
        like_numbers_cnt[i] = like_numbers_cnt[i - 1]

for _ in range(Q):
    l, r = map(int, input().split())
    print(like_numbers_cnt[r] - like_numbers_cnt[l - 1])


Fixed submission:
def primes(n):
    primes = []
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    for i in range(len(is_prime)):
        if is_prime[i]:
            primes.append(i)
    return is_prime


Q = int(input())

ps = primes(100000)
like_numbers = [False] * 100001
for i in range(3, 100001, 2):
    if ps[i] and ps[(i + 1) // 2]:
        like_numbers[i] = True

like_numbers_cnt = [0] * 100001

for i in range(1, 100001):
    if like_numbers[i]:
        like_numbers_cnt[i] = like_numbers_cnt[i - 1] + 1
    else:
        like_numbers_cnt[i] = like_numbers_cnt[i - 1]

for _ in range(Q):
    l, r = map(int, input().split())
    print(like_numbers_cnt[r] - like_numbers_cnt[l - 1])
Buggy python submission (verdict: Time Limit Exceeded):
A, B, C, D, E, F = map(int, input().split())
maxDensity = 0
ans_water = 0
ans_sugar = 0

for i in range(31):
    for j in range(31):
        for k in range(101):
            for l in range(101):
                water = (i * A + j * B) * 100
                sugar = k * C + l * D
                if water + sugar > F:
                    continue
                if sugar * 100 > water * E:
                    continue
                if sugar + water == 0:
                    density = 0
                else:
                    density = sugar / (sugar + water)
                if maxDensity < density:
                    ans_water = water
                    ans_sugar = sugar
                    maxDensity = density


print(ans_water + ans_sugar, ans_sugar)


Fixed submission:
A, B, C, D, E, F = map(int, input().split())
maxDensity = 0
ans_water = A * 100
ans_sugar = 0

for i in range(F // (100 * A) + 1):
    for j in range(F // (100 * B) + 1):
        water = (i * A + j * B) * 100
        rest = F - water
        if water > F:
            continue
        for k in range(rest // C + 1):
            for l in range(rest // D + 1):
                sugar = k * C + l * D
                if water + sugar > F:
                    continue
                if sugar * 100 > water * E:
                    continue
                if sugar + water == 0:
                    density = 0
                else:
                    density = sugar / (sugar + water)
                if maxDensity < density:
                    ans_water = water
                    ans_sugar = sugar
                    maxDensity = density


print(ans_water + ans_sugar, ans_sugar)
Buggy python submission (verdict: Runtime Error):
nums = input().split()

if nums[0] == "0":
print(1)

elif nums[1] == "0":
print(2)

elif nums[2] == "0":
print(3)

elif nums[3] == "0":
print(4)

elif nums[4] == "0":
print(5)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input().split()

if nums[0] = "0"
print(1)

elif nums[1] = "0"
print(2)

elif nums[2] = "0"
print(3)

elif nums[3] = "0"
print(4)

elif nums[4] = "0"
print(5)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input().split()

if numlist[0] = "0"
print(1)

elif numlist[1] = "0"
print(2)

elif numlist[2] = "0"
print(3)

elif numlist[3] = "0"
print(4)

elif numlist[4] = "0"
print(5)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input()
numlist = list(nums.split(' '))

if numlist[0] = "0"
print(1)

elif numlist[1] = "0"
print(2)

elif numlist[2] = "0"
print(3)

elif numlist[3] = "0"
print(4)

elif numlist[4] = "0"
print(5)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input()
numlist = list(nums.split(' '))

if numlist[0] = "0"
print(0)

elif numlist[1] = "0"
print(1)

elif numlist[2] = "0"
print(2)

elif numlist[3] = "0"
print(3)

elif numlist[4] = "0"
print(4)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input()
numlist = list(nums.split(' '))

if numlist[0] = "0"
print(0)

if numlist[1] = "0"
print(1)

if numlist[2] = "0"
print(2)

if numlist[3] = "0"
print(3)

if numlist[4] = "0"
print(4)


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)

Buggy python submission (verdict: Runtime Error):
nums = input()
numlist = list(nums.split(' '))
for i in numlist:
  if i == '0':
    print i


Fixed submission:
# coding: utf-8
# Your code here!
x=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)
elif(x[4]=="0"):
    print(5)
Buggy python submission (verdict: Runtime Error):
import operator

X, N = map(int, input().split())

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

abs_val_dict = {}

if N == 0:
    print (X)

for i in range (X-N, X+N):
    if i not in p:
        abs_val_dict[i] = abs(i-X)
    
print(min(abs_val_dict.items(), key=operator.itemgetter(1))[0])

Fixed submission:
import operator

X, N = map(int, input().split())

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

abs_val_dict = {}

if N == 0:
    print (X)

for i in range (X-N, X+N):
    if i not in p:
        abs_val_dict[i] = abs(i-X)

if abs_val_dict != {}:
    print(min(abs_val_dict.items(), key=operator.itemgetter(1))[0])

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

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

abs_val_dict = {}

if N == 0:
    print (X)

for i in range (X-N, X+N):
    if i not in p:
        abs_val_dict[i] = abs(i-X)
    
print(max(abs_val_dict, key = abs_val_dict.get()))

Fixed submission:
import operator

X, N = map(int, input().split())

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

abs_val_dict = {}

if N == 0:
    print (X)

for i in range (X-N, X+N):
    if i not in p:
        abs_val_dict[i] = abs(i-X)

if abs_val_dict != {}:
    print(min(abs_val_dict.items(), key=operator.itemgetter(1))[0])
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))

O = A.copy()

O = [k for k in O if O.count(k) == 1]

for i in A:
    for j in A:
        if i != j:
            if (i%j == 0):
                if i in O:
                    O.remove(i)

ans = len(O)

print(ans)

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


mx = max(A)
x = [0] * (mx + 1) # len(x)
for i in A:
    x[i] += 1
for i in range(1, mx + 1):
    if x[i] != 0:
        for j in range(2 * i, mx + 1, i):
            x[j] = 0
    if x[i] > 1:
        x[i] = 0
print(sum(x))

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

O = A.copy()

for h in A:
    if A.count(h) >1:
        if h in O:
            O.remove(h)



for i in A:
    for j in A:
        if i != j:
            if (i%j == 0):
                if i in O:
                    O.remove(i)

ans = len(O)

print(ans)

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


mx = max(A)
x = [0] * (mx + 1) # len(x)
for i in A:
    x[i] += 1
for i in range(1, mx + 1):
    if x[i] != 0:
        for j in range(2 * i, mx + 1, i):
            x[j] = 0
    if x[i] > 1:
        x[i] = 0
print(sum(x))

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

O = A.copy()

for i in A:
    for j in A:
        if i != j:
            if (i%j == 0):
                if i in O:
                    O.remove(i)

ans = len(O)

print(ans)

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


mx = max(A)
x = [0] * (mx + 1) # len(x)
for i in A:
    x[i] += 1
for i in range(1, mx + 1):
    if x[i] != 0:
        for j in range(2 * i, mx + 1, i):
            x[j] = 0
    if x[i] > 1:
        x[i] = 0
print(sum(x))
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int, input().split())
a = 1
MOD = 1000000007
d = [1] * (n + 1)
for i in range(n):
  d[i+1] = ((m - n + i) * d[i] + i * d[i-1]) % MOD
  a *= (m - i) % MOD
print(a * d[n] % MOD)

Fixed submission:
MOD = 10 ** 9 + 7
n, m = map(int, input().split())
a = 1
d = [1] * (n + 1)
for i in range(n):
  d[i + 1] = ((m - n + i) * d[i] + i * d[i - 1]) % MOD
  a = a * (m - i) % MOD
print(a * d[n] % MOD)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
q = int(input())
for _ in range(q):
  b, c = map(int, input().split())
  if a.count(b):
    l = a.index(b)
    r = n - a[::-1].index(b)
    for i in range(l, r):
      if a[i] == b:
        a[i] = c
  print(sum(a))
    

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
d = dict() 
for i in a:
  if i in d:
    d[i] += 1
  else:
    d[i] = 1
s = sum(a)
for _ in range(int(input())):
  b, c = map(int, input().split())
  if b in d:
    s += ((c - b) * d[b])
    if c in d:
      d[c] += d[b]
    else:
      d[c] = d[b]
    d[b] = 0
  print(s)
Buggy python submission (verdict: Runtime Error):
a, b = input().strip().split()
a, b = [int(a), int(b)]
ans = int(a * b)
print(ans)

Fixed submission:
a, b = input().strip().split()
a, b = [int(a), float(b)]
ans = int(a * round(b * 100) // 100)
# ans = int(a * b)
print(ans)
Buggy python submission (verdict: Runtime Error):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

t = 0
while A != B and t < T:
    if A < B:
        A += V
        B += W
    if A > B:
        A -= V
        B -= W
    t += 1

if A == B:
    print('YES')
else:
    print('NO')

Fixed submission:
S = str(input())
nickname = S[0:3]
print(nickname)
Buggy python submission (verdict: Time Limit Exceeded):
tmp = list(map(int, input().split()))
N, M = tmp[0], tmp[1]
A = []
B = []
for i in [0]*M:
    tmp = list(map(int, input().split()))
    A.append(tmp[0])
    B.append(tmp[1])

arranged = [[1]]
nextroom = []
ans = [0]*(N-1)
for j in [0]*M:
    flattenarr = sum(arranged, [])
    for i in range(M):
        for rooms in arranged:
            if A[i] in rooms and B[i] not in flattenarr:
                nextroom.append(B[i])
                if ans[B[i]-2] == 0:
                    ans[B[i]-2]=A[i]
                break

            if B[i] in rooms and A[i] not in flattenarr:
                nextroom.append(A[i])
                if ans[A[i]-2] == 0:
                    ans[A[i]-2]=B[i]
                break
    arranged.append(nextroom)
    nextroom = []

if 0 in ans:
    print('No')
else:
    print('Yes')
    for x in ans:
        print(x)

Fixed submission:
import queue

N, M = map(int, input().split())
adj = [[] for i in [0]*N] # 隣接リスト
for i in [0]*M:
    a, b = map(int, input().split())
    adj[a-1].append(b)
    adj[b-1].append(a)

que = queue.Queue()
que.put(1)
guide = [-1]*(N)
 
while not que.empty():
    x = que.get()
    for y in adj[x-1]:
        if guide[y-1] == -1:
            que.put(y)
            guide[y-1] = x


print('Yes')
for i in guide[1:]:
        print(i)

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

tmp = list(map(int, input().split()))
N, M = tmp[0], tmp[1]
A = []
B = []
for i in [0]*M:
    tmp = list(map(int, input().split()))
    A.append(tmp[0])
    B.append(tmp[1])

arranged = [[1]]
nextroom = []
ans = [0]*(N-1)
for j in [0]*M:
    flattenarr = sum(arranged, [])
    for i in range(M):
        for rooms in arranged:
            if A[i] in rooms and B[i] not in flattenarr:
                nextroom.append(B[i])
                if ans[B[i]-2] == 0:
                    ans[B[i]-2]=A[i]
                break

            if B[i] in rooms and A[i] not in flattenarr:
                nextroom.append(A[i])
                if ans[A[i]-2] == 0:
                    ans[A[i]-2]=B[i]
                break
    arranged.append(nextroom)
    nextroom = []

if 0 in ans:
    print('No')
else:
    print('Yes')
    for x in ans:
        print(x)

Fixed submission:
import queue

N, M = map(int, input().split())
adj = [[] for i in [0]*N] # 隣接リスト
for i in [0]*M:
    a, b = map(int, input().split())
    adj[a-1].append(b)
    adj[b-1].append(a)

que = queue.Queue()
que.put(1)
guide = [-1]*(N)
 
while not que.empty():
    x = que.get()
    for y in adj[x-1]:
        if guide[y-1] == -1:
            que.put(y)
            guide[y-1] = x


print('Yes')
for i in guide[1:]:
        print(i)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
order = []
for i in range(1, n+1):
    order += [str(a.index(i)+1)]
print(' '.join(order))

Fixed submission:
n = int(input())
li = range(1, n+1)
odd = 0
for i in li:
    if i % 2 == 1:
        odd += 1
ans = odd / n
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
order = []
for i in range(1, n+1):
    order += [a.index(i)+1]
print(' '.join(map(str, order)))

Fixed submission:
n = int(input())
li = range(1, n+1)
odd = 0
for i in li:
    if i % 2 == 1:
        odd += 1
ans = odd / n
print(ans)
Buggy python submission (verdict: Runtime Error):
n , k , q = map(int, input().split())
points = [k - q] * n
for i in range(q):
    c = int(input())
    points[c-1] += 1
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
S = input()

if S == 'Sunny':
    S_tomorrow = 'Cloudy'
elif S == 'Cloudy':
    S_tomorrow = 'Rainy'
else:
    S_tomorrow = 'Sunny'

print(S_tomorrow)

Buggy python submission (verdict: Runtime Error):
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k - q for i in range(n)]
for i in range(n):
    points[i-1] += a.count(i+1)
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
S = input()

if S == 'Sunny':
    S_tomorrow = 'Cloudy'
elif S == 'Cloudy':
    S_tomorrow = 'Rainy'
else:
    S_tomorrow = 'Sunny'

print(S_tomorrow)

Buggy python submission (verdict: Runtime Error):
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k - q for i in range(n)]
for i in range(n):
    points[i] += a.count(i)
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
S = input()

if S == 'Sunny':
    S_tomorrow = 'Cloudy'
elif S == 'Cloudy':
    S_tomorrow = 'Rainy'
else:
    S_tomorrow = 'Sunny'

print(S_tomorrow)
Buggy python submission (verdict: Time Limit Exceeded):
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k - q]*n
for i in range(n):
    points[i] += a.count(i+1)
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
n , k , q = map(int, input().split())
points = [k - q] * n
for i in range(q):
    c = int(input())
    points[c-1] += 1
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k - q for i in range(n)]
for i in range(n):
    points[i] += a.count(i+1)
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
n , k , q = map(int, input().split())
points = [k - q] * n
for i in range(q):
    c = int(input())
    points[c-1] += 1
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k for i in range(n)]
for correct in range(n):
    for others in range(n):
        if correct == others:
            continue
        else:
            points[others - 1] -= a.count(correct)
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')


Fixed submission:
n , k , q = map(int, input().split())
points = [k - q] * n
for i in range(q):
    c = int(input())
    points[c-1] += 1
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 11)]
lis = 'abcdefghijklmnopqrstuvwxyz'
N = int(input())
for b in reversed(bounds):
    if b <= N:
        break
N -= b 
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
    idx, N = divmod(N, 26**i)
    s = s + lis[idx]
print(s + lis[N])

Fixed submission:
bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 12)]
lis = 'abcdefghijklmnopqrstuvwxyz'
N = int(input())
for b in reversed(bounds):
    if b <= N:
        break
N -= b 
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
    idx, N = divmod(N, 26**i)
    s = s + lis[idx]
print(s + lis[N])

Buggy python submission (verdict: Runtime Error):
bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 11)]
N = int(input())
for b in reversed(bounds):
    if b <= N:
        break
N -= b 
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
    idx, N = divmod(N, 26**i)
    s = s + lis[idx]
print(s + lis[N])

Fixed submission:
bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 12)]
lis = 'abcdefghijklmnopqrstuvwxyz'
N = int(input())
for b in reversed(bounds):
    if b <= N:
        break
N -= b 
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
    idx, N = divmod(N, 26**i)
    s = s + lis[idx]
print(s + lis[N])
Buggy python submission (verdict: Runtime Error):
from collections import Counter

def update(dic, b, c):
    n = dic.pop(b)
    dic[c] = n + dic.get(c, 0)
    
def calc_diff(dic, b, c):
    return c * dic[b] - b * dic[b]

def calc_total(dic):
    return sum(k * v for k, v in dic.items())

N = int(input())
lis = list(map(int, input().split()))
dic = dict(Counter(lis))
Q = int(input())
total = calc_total(dic)
for _ in range(Q):
    B, C = map(int, input().split())
    total += calc_diff(dic, B, C)
    print(total)
    update(dic, B, C)

Fixed submission:
from collections import Counter

def update(dic, b, c):
    n = dic.pop(b)
    dic[c] = n + dic.get(c, 0)
    
def calc_diff(dic, b, c):
    if dic.get(b):
        return c * dic[b] - b * dic[b]
    return 0

def calc_total(dic):
    return sum(k * v for k, v in dic.items())

N = int(input())
lis = list(map(int, input().split()))
dic = dict(Counter(lis))
Q = int(input())
total = calc_total(dic)
for _ in range(Q):
    B, C = map(int, input().split())
    diff = calc_diff(dic, B, C)
    total += diff
    print(total)
    if diff:
        update(dic, B, C)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter, defaultdict

def update(dic, b, c):
    dic = dic.copy()
    n = dic.pop(b)
    dic[c] += n
    return dic

def calc_diff(dic, b, c):
    return c * dic[b] - b * dic[b]

def calc_total(dic):
    return sum(k * v for k, v in dic.items())

N = int(input())
lis = list(map(int, input().split()))
dic = defaultdict(int)
dic.update(Counter(lis))
Q = int(input())
total = calc_total(dic)
for _ in range(Q):
    B, C = map(int, input().split())
    total += calc_diff(dic, B, C)
    print(total)
    dic = update(dic, B, C)

Fixed submission:
from collections import Counter

def update(dic, b, c):
    n = dic.pop(b)
    dic[c] = n + dic.get(c, 0)
    
def calc_diff(dic, b, c):
    if dic.get(b):
        return c * dic[b] - b * dic[b]
    return 0

def calc_total(dic):
    return sum(k * v for k, v in dic.items())

N = int(input())
lis = list(map(int, input().split()))
dic = dict(Counter(lis))
Q = int(input())
total = calc_total(dic)
for _ in range(Q):
    B, C = map(int, input().split())
    diff = calc_diff(dic, B, C)
    total += diff
    print(total)
    if diff:
        update(dic, B, C)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lis = list(map(int, input().split()))
def calc(vals):
    val, *vals = vals
    for v in vals:
        val ^= v
    return val
ans = []
for n in range(len(lis)):
    ans.append(calc(lis[:n] + lis[n + 1:]))
print(*ans)

Fixed submission:
N = int(input())
lis = list(map(int, input().split()))
def calc(vals):
    val, *vals = vals
    for v in vals:
        val ^= v
    return val
ans = []
total = calc(lis)
for val in lis:
    ans.append(total ^ val)
print(*ans)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
from math import gcd
from functools import reduce


MOD = 1000000007  # type: int


def solve(N: int, A: "List[int]"):
    common_multi = reduce(lambda x, y: x * y // gcd(x, y), A)
    print(sum(map(lambda x: common_multi // x, A)) % MOD)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()


Fixed submission:
#!/usr/bin/env python3
import sys
from fractions import gcd
from functools import reduce


MOD = 1000000007  # type: int


def solve(N: int, A: "List[int]"):
    common_multi = reduce(lambda x, y: x * y // gcd(x, y), A)
    print(sum(map(lambda x: common_multi // x, A)) % MOD)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()