ZhenlongDai/ACPR huggingface dataset:
Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c = map(int, input().split())

if a % 2 == 0 or b % 2 == 0 or c % 2 == 0: print(0)
else:
  square = a*b*c/max(a,b,c)
  print(square)

Failing test case input:
5 5 5

Expected output:
25


Actual output:
25.0


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

if a % 2 == 0 or b % 2 == 0 or c % 2 == 0: print(0)
else:
  square = min(a*b, b*c, a*c)
  print(int(square))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = [int(i) for i in input().split()]
if a*b*c %2==0:
	print(0)
print(min(a*b, a*c, b*c))


Failing test case input:
38 5 5

Expected output:
0


Actual output:
0
25


Fixed submission (verdict: Accepted):
a, b, c = [int(i) for i in input().split()]
if a*b*c %2==0:
  print(0)
else:
  print(min(a*b, a*c, b*c))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
na = lambda: list(map(int, input().split()))
a, b, c = na()
if a*b*c % 2 == 0:
    print(0)

Failing test case input:
3 1 7

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
na = lambda: list(map(int, input().split()))
a, b, c = na()
if a*b*c % 2 == 0:
    print(0)
else:
    l = sorted([a, b, c])
    print(l[0] * l[1])

Problem: p04005
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a,b,c=map(int, input().split())
if a%2 and b%2 and c%2:
    print(0)
else:
    print(min(a*b,b*c,c*a))

Failing test case input:
5 1 10

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
a,b,c=map(int, input().split())
if not(a%2 and b%2 and c%2):
    print(0)
else:
    print(min(a*b,b*c,c*a))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
if (a*b*c)%2==0:
    print(0)
else:
    l=[a,b,c]
    l.sort()
    print(a*b)

Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
if (a*b*c)%2==0:
    print(0)
else:
    l=[a,b,c]
    l.sort()
    print(l[0]*l[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c = map(int,input().split())
if c % 2 == 0:
  print(0)
else:
  print(a * b)

Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
  print(0)
else:
  print(min(a * b,b * c,a * c))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math

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

if not (A % 2 + B % 2 + C % 2):
	print(0)
	exit()

tl = [A, B, C]
tm = max(tl)
tl.remove(tm)
t2, t3 = tl

print(t2 * t3)


Failing test case input:
1 3 10

Expected output:
0


Actual output:
3


Fixed submission (verdict: Accepted):
import math

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

if not(A % 2) or not(B % 2) or not(C % 2):
	print(0)
	exit()

tl = [A, B, C]
tm = max(tl)
tl.remove(tm)
t2, t3 = tl

print(t2 * t3)
Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
num = list(map(int,str.split(' ')))
if (num[0]%2)*(num[1]%2)*(num[2]):
	print(0)
else:
	num.sort()
print(num[0]*num[1])


Failing test case input:
-1 2 10

Expected output:
0


Actual output:
-2


Fixed submission (verdict: Accepted):
str = input()
num = list(map(int,str.split(' ')))
if ((num[0]%2)and(num[1]%2)and(num[2]%2))==0:
	print(0)
else:
	num.sort()
	print(num[0]*num[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
str = input()
num = list(map(int,str.split(' ')))
if (num[0]%2)*(num[1]%2)*(num[2])==1:
	print(0)
else:
	num.sort()
print(num[0]*num[1])


Failing test case input:
-1 2 2

Expected output:
0


Actual output:
-2


Fixed submission (verdict: Accepted):
str = input()
num = list(map(int,str.split(' ')))
if ((num[0]%2)and(num[1]%2)and(num[2]%2))==0:
	print(0)
else:
	num.sort()
	print(num[0]*num[1])

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a, b, c = map(int, input().split())

if a%2 == b%2 == c%2 == 0:
    print(0)
else:
    print(min(a*b, b*c, b*c))

Failing test case input:
6 5 5

Expected output:
0


Actual output:
25


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

if a%2 == 0 or  b%2 == 0 or c%2 == 0:
    print(0)
else:
    print(min(a*b, b*c, a*c))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())
if C % 2 == 0:
    print(0)
else:
    print(A * B)

Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):
X = list(map(int, input().split()))
X.sort()
if X[2] % 2 == 0:
    print(0)
else:
    print(X[0] * X[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,C = map(int,input().split())
if A%2==0 or B%2==0 or C==0:
  print(0)
else:
  print(A*B*C/max({A,B,C}))

Failing test case input:
5 5 5

Expected output:
25


Actual output:
25.0


Fixed submission (verdict: Accepted):
A,B,C = map(int,input().split())
if A%2==0 or B%2==0 or C%2==0:
  print(0)
else:
  print(A*B*C

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int,input().split())
if A%2 == 0 or B%2 == 0 or C%2 == 0:
    print(0)
else:
    L = sorted([A,B,C])
    print(A*B)

Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


Fixed submission (verdict: Accepted):
A, B, C = map(int,input().split())
if A%2 == 0 or B%2 == 0 or C%2 == 0:
    print(0)
else:
    print(min(A*B,B*C,C*A))

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):



a, b, c = map(int, input().split())
if (a or b or c) % 2 == 0:
    print(0)
if (a and b and c) % 2 != 0 :
    print(min(a * b, b * c, c * a))

Failing test case input:
1 0 10

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
a, b, c = map(int, input().split())
if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
    print(0)
elif (a and b and c) % 2 != 0 :
    print(min(a * b, b * c, c * a))
Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
sys.setrecursionlimit(10**6)

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

newa=sorted(a)





if newa[2]%2==0:
    print("0")
else:
    print(a[0]*a[1])

Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):
import sys
sys.setrecursionlimit(10**6)

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

newa=sorted(a)





if newa[2]%2==0 or newa[1]%2==0 or newa[0]%2==0:
    print("0")
else:
    print(newa[0]*newa[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())

print(min(B * C, C * A, A * C) if A % 2 or B % 2 or C % 2 else 0)


Failing test case input:
38 5 5

Expected output:
0


Actual output:
25


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

print(min(B * C if A % 2 else 0, C * A if B % 2 else 0, A * B if C % 2 else 0))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**9

def f():
    a,b,c = list(map(int, input().split()))
    return min(b*c*(a%2),a*b*(a%2),a*c*(b%2))

print(f())


Failing test case input:
5 3 10

Expected output:
0


Actual output:
15


Fixed submission (verdict: Accepted):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**9

def f():
    a,b,c = list(map(int, input().split()))
    return min(b*c*(a%2),a*b*(c%2),a*c*(b%2))

print(f())

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c=map(int,input().split())
for i in [a,b,c]:
  if i==0:
    print(0)
    break
else:
  s=a*b*c/max(a,b,c)
  print(int(s))
  

Failing test case input:
6 5 5

Expected output:
0


Actual output:
25


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
for i in [a,b,c]:
  if i%2==0:
    print(0)
    break
else:
  s=min(a*b,b*c,c*a)
  print(int(s))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,C = map(int,input().split())

if (A%2)*(B%2)*(C%2)==0:
  Answer = 0
else:
  Answer = max(A*B,A*C,B*C)

print(Answer)

Failing test case input:
3 1 13

Expected output:
3


Actual output:
39


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

if (A%2)*(B%2)*(C%2)==0:
  Answer = 0
else:
  Answer = min(A*B,A*C,B*C)

print(Answer)

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = list(map(int,input().split()))
cnt = 0
for i in range(3):
    if a[i]%2 == 1:
        cnt += 1
if cnt != 0:
    a.sort()
    print(a[0]*a[1])
else:
    print(0)

Failing test case input:
5 3 10

Expected output:
0


Actual output:
15


Fixed submission (verdict: Accepted):
a = list(map(int,input().split()))
cnt = 0
for i in range(3):
    if a[i]%2 == 0:
        cnt += 1
if cnt == 0:
    a.sort()
    print(a[0]*a[1])
else:
    print(0)
Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a,b,c = map(int,input().split())
print (0) if c%2 == 0 else print (a*b)


Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):
a,b,c = map(int,input().split())
ans = min(a*b,b*c,c*a)
x = max(a,b,c)
print (0) if x%2 == 0 else print (ans)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())
if A % 2 == 0 or B % 2 == 0 or C % 2 == 0:
    print(0)
else:
    min(A*B, B*C, C*A)

Failing test case input:
3 1 13

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
A, B, C = map(int, input().split())
if A % 2 == 0 or B % 2 == 0 or C % 2 == 0:
    print(0)
else:
    print(min(A*B, B*C, C*A))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=sorted(list(map(int,input().split())))
if (a[0]*a[1]*a[2])%2==0:
    print('0')
else:
    print(a[0]+a[1])

Failing test case input:
3 1 7

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
a=sorted(list(map(int,input().split())))
if (a[0]*a[1]*a[2])%2==0:
    print('0')
else:
    print(a[0]*a[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = map(int, input().split())

if c % 2 == 0:
    print(0)
else:
    print(((a * b) * (int(c/2)+1)) - ((a * b) * int(c/2)))


Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


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

if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
    print(0)
else:
    print(min(c * b, c * a, a * b))

Problem: p04005
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
A, B, C = map(int, input().split())

if A % 2 == 0 or B % 2 == 0 or C % 2 ==0:
    print(0)




ans = min(B*C, C*A, A*B)
print(ans)

Failing test case input:
0 2 6

Expected output:
0


Actual output:
0
0


Fixed submission (verdict: Accepted):
import sys
A, B, C = map(int, input().split())

if A % 2 == 0 or B % 2 == 0 or C % 2 ==0:
    print(0)
    sys.exit(0)

ans = min(B*C, C*A, A*B)
print(ans)

Problem: p04005
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
A,B,C=map(int,input().split())
l=[A,B,C]
l2=[A*B,A*C,B*C]
l2.sort()
c=0
for i in range(3):
    if l[i]%2==0:
        c=c+1
if c<2:
    print(l2[0])
else:
    print("0")

Failing test case input:
5 1 10

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
A,B,C=map(int,input().split())
l=[A,B,C]
l2=[A*B,A*C,B*C]
l2.sort()
c=0
for i in range(3):
    if l[i]%2==0:
        c=c+1
if c<1:
    print(l2[0])
else:
    print("0")

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b,c=map(int,input().split())
print(min([a*b,b*c,c*a]))

Failing test case input:
1 3 10

Expected output:
0


Actual output:
3


Fixed submission (verdict: Accepted):
a,b,c=map(int,input().split())
print(min([a*b*(c%2),b*c*(a%2),c*a*(b%2)]))
Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = [int(s) for s in input().split()]

if all([n % 2 == 0 for n in s]):
    print(0)
else:
    s[s.index(max(s))] = 1
    print(s[0] * s[1] * s[2])

Failing test case input:
-1 2 10

Expected output:
0


Actual output:
-2


Fixed submission (verdict: Accepted):
s = [int(s) for s in input().split()]

if any([n % 2 == 0 for n in s]):
    print(0)
else:
    s[s.index(max(s))] = 1
    print(s[0] * s[1] * s[2])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = [int(i) for i in input().split()]
print(min(a*b, a*c, b*c))


Failing test case input:
1 3 10

Expected output:
0


Actual output:
3


Fixed submission (verdict: Accepted):
a, b, c = [int(i) for i in input().split()]
if a*b*c %2==0:
  print(0)
else:
  print(min(a*b, a*c, b*c))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a, b, c = map(int, input().split())

if a*b==c or b*c==a or c*a==b:
    print(0)
else:
    print(min(a*b,b*c,c*a))

Failing test case input:
5 3 10

Expected output:
0


Actual output:
15


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

print(0 if a%2==0 or b%2==0 or c%2==0 else min(a*b,b*c,c*a))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())
list = [A,B,C]
P = max(list)
list.remove(P)
C = list[0]*list[1]
print(C)

Failing test case input:
-1 2 6

Expected output:
0


Actual output:
-2


Fixed submission (verdict: Accepted):
A, B, C = map(int, input().split())
list = [A,B,C]
P = max(list)
list.remove(P)
P = P%2
C = list[0]*list[1]
if not P:
    print(0)
else:
    print(C)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

a, b, c = (int(_) for _ in input().split())
total = a*b*c
if total % 2 == 0:
    print(int(0))
else:
    print(a*b)

Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):

a, b, c = (int(_) for _ in input().split())
total = a*b*c
if total % 2 == 0:
    print(int(0))
else:
    print(min(a*b, a*c, b*c))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,C=map(int,input().split())
ans = A*B*C/max(A,B,C)
if ans%2==0:
    print(0)
else:
    print(ans)

Failing test case input:
19 5 5

Expected output:
25


Actual output:
25.0


Fixed submission (verdict: Accepted):
A,B,C=map(int,input().split())
if any(map(lambda x: x%2==0,[A,B,C])):
    print(0)
else:
    print(min(A*B,B*C,C*A))

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
A,B,C = map(int, input().split())

if A%2==B%2==C%2==0:
  print(0)
else:
  print(min([A*B,B*C,C*A]))

Failing test case input:
-1 2 10

Expected output:
0


Actual output:
-10


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

if A%2==0 or B%2==0 or C%2==0:
  print(0)
else:
  print(min(A*B,B*C,C*A))
Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

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

x=min(a,b,c)
z=max(a,b,c)
if a==x and b==z:
  y=c
if a==x and c==z:
  y=b
if b==x and a==z:
  y=c
if b==x and c==z:
  y=a
if c==x and a==z:
  y=b
if c==x and b==z:
  y=a

print(0 if z%2==0 else a*b)

Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


Fixed submission (verdict: Accepted):

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

x=min(a,b,c)
z=max(a,b,c)
if a==x and b==z:
  y=c
if a==x and c==z:
  y=b
if b==x and a==z:
  y=c
if b==x and c==z:
  y=a
if c==x and a==z:
  y=b
if c==x and b==z:
  y=a

print(0 if z%2==0 else x*y)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)

n = [a,b,c]

n.reverse()

x = n[1] * n[2]

for i in range(3):
    if n[i] % 2 == 0:
        x = 0

print(x)


Failing test case input:
19 5 5

Expected output:
25


Actual output:
95


Fixed submission (verdict: Accepted):



a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)

n = [a,b,c]

n.sort(reverse=True)

x = n[1] * n[2]

for i in range(3):
    if n[i] % 2 == 0:
        x = 0

print(x)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = [int(x) for x in input().split()]

l.sort(reverse=True)


if len([x for x in l if x % 2 != 0]) == 0:
    print(0)
else:
    ans = min(l[1]*l[2], l[0]*l[1], l[0]*l[2])
    print(ans)

Failing test case input:
4 1 4

Expected output:
0


Actual output:
4


Fixed submission (verdict: Accepted):
l = [int(x) for x in input().split()]

l.sort(reverse=True)


if len([x for x in l if x % 2 == 0]) > 0:
    print(0)
else:
    ans = min(l[1]*l[2], l[0]*l[1], l[0]*l[2])
    print(ans)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A, B, C = map(int, input().split())

print(min(B * C if A % 2 else 0, C * A if B % 2 else 0, A * C if B % 2 else 0))


Failing test case input:
1 3 10

Expected output:
0


Actual output:
10


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

print(min(B * C if A % 2 else 0, C * A if B % 2 else 0, A * B if C % 2 else 0))

Problem: p04005
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys

input = sys.stdin.readline

def main():
    ans = 0
    A,B,C = map(int, input().split())
    if A*B*C%2 == 1:
        ans = A*B
    print(ans)

if __name__ == '__main__':
    main()

Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


Fixed submission (verdict: Accepted):
import sys

input = sys.stdin.readline

def main():
    ans = 0
    A,B,C = map(int, input().split())
    if A*B*C%2 == 1:
        ans = min(A,B,C)*(A+B+C-(min(A,B,C)+max(A,B,C)))
    print(ans)

if __name__ == '__main__':
    main()
Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


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

ret = -1
if sum(map(lambda x: x % 2, arr)) == 0:
    ret = 0
else:
    arr_sorted = sorted(arr)
    ret = arr[0] * arr[1]
print(ret)

Failing test case input:
19 9 5

Expected output:
45


Actual output:
171


Fixed submission (verdict: Accepted):


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

ret = -1
if 0 in list(map(lambda x: x % 2, arr)):
    ret = 0
else:
    arr_sorted = sorted(arr)
    ret = arr_sorted[0] * arr_sorted[1]
print(ret)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int,input().split()))
a.sort()
print((a[0]%2==1)*(a[1]%2==1)*(a[2]%2==1)*a[1]*a[2])

Failing test case input:
3 1 7

Expected output:
3


Actual output:
21


Fixed submission (verdict: Accepted):
a = list(map(int,input().split()))
a.sort()
print((a[0]%2==1)*(a[1]%2==1)*(a[2]%2==1)*a[0]*a[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A,B,C=map(int,input().split())
ans = A*B*C/max(A,B,C)
if ans%2==0:
    print(0)
else:
    print(int(ans))

Failing test case input:
6 5 5

Expected output:
0


Actual output:
25


Fixed submission (verdict: Accepted):
A,B,C=map(int,input().split())
if any(map(lambda x: x%2==0,[A,B,C])):
    print(0)
else:
    print(min(A*B,B*C,C*A))

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math
A, B, C = map(int, input().split())
l = [A,B,C]

max_index = l.index(max(l))
if max_index == 0:
    large = A * B * math.floor(C/2)
elif max_index == 1:
    large = B * C * math.floor(A/2)
else:
    large = C * A * math.floor(B/2)
ans = (A*B*C - large) - large

print(ans)




Failing test case input:
5 3 10

Expected output:
0


Actual output:
50


Fixed submission (verdict: Accepted):
import math
A, B, C = map(int, input().split())
l = [A,B,C]

max_index = l.index(max(l))
if max_index == 0:
    large = B * C * math.floor(A/2)
elif max_index == 1:
    large = C * A * math.floor(B/2)
else:
    large = A * B * math.floor(C/2)
ans = (A*B*C - large) - large

print(ans)

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



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

if all([v % 2 == 0 for v in nums]):
    print(0)
else:
    sorted_nums = sorted(nums)
    print(sorted_nums[0] * sorted_nums[1])

Failing test case input:
5 1 10

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):



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

if any([v % 2 == 0 for v in nums]):
    print(0)
else:
    sorted_nums = sorted(nums)
    print(sorted_nums[0] * sorted_nums[1])

Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)

n = [a, b, c]

n.reverse()

if n[0] % 2 == 0:
    print(0)
else :
    print(n[1] * n[2])


Failing test case input:
6 5 5

Expected output:
0


Actual output:
30


Fixed submission (verdict: Accepted):



a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)

n = [a,b,c]

n.sort(reverse=True)

x = n[1] * n[2]

for i in range(3):
    if n[i] % 2 == 0:
        x = 0

print(x)
Problem: p04005
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


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

ret = -1
if sum(map(lambda x: x % 2, arr)) == 0:
    ret = 0
else:
    arr_sorted = sorted(arr)
    ret = arr_sorted[0] * arr_sorted[1]
print(ret)

Failing test case input:
-1 2 6

Expected output:
0


Actual output:
-2


Fixed submission (verdict: Accepted):


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

ret = -1
if 0 in list(map(lambda x: x % 2, arr)):
    ret = 0
else:
    arr_sorted = sorted(arr)
    ret = arr_sorted[0] * arr_sorted[1]
print(ret)
Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
t = set()
m = int(input())
for i in range(m):
    cmd, key = input().split()
    if cmd == "insert":
        t.add(key)
    else:
        if key in t:
            print("yes")
        else:
            print("no")

print(t)

Failing test case input:
13
insert AAA
insert AAC
insert AGA
insert AHF
insert TTT
find AAA
find DCC
find CCC
insert CCC
find CCC
insert T
find TTT
find T

Expected output:
yes
no
no
yes
yes
yes


Actual output:
yes
no
no
yes
yes
yes
{'AGA', 'AHF', 'AAA', 'AAC', 'TTT', 'T', 'CCC'}


Fixed submission (verdict: Accepted):
t = set()
m = int(input())
for i in range(m):
    cmd, key = input().split()
    if cmd == "insert":
        t.add(key)
    else:
        if key in t:
            print("yes")
        else:
            print("no")

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):


if __name__ == "__main__":
    n_line = int(input())
    input_list = [tuple(input().split()) for i in range(n_line)]
    l = []
    for c, s in input_list:
        if c == "insert":
            l.append(s)
        else:
            if s in c:
                print("yes")
            else:
                print("no")

Failing test case input:
13
insert AAA
insert ABC
insert AFA
insert GGA
insert TTT
find AAA
find CCC
find CCC
insert CCC
find CCB
insert T
find TTT
find T

Expected output:
yes
no
no
no
yes
yes


Actual output:
no
no
no
no
no
no


Fixed submission (verdict: Accepted):


if __name__ == "__main__":
    n_line = int(input())
    input_list = [tuple(input().split()) for i in range(n_line)]
    l = set([])
    for c, s in input_list:
        if c == "insert":
            l.add(s)
        else:
            if s in l:
                print("yes")
            else:
                print("no")

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())
dic = {}

for i in range(n):
    com = input().split()
    c = com[0]

    if com[1] in dic:
        if c[0] == 'f': print("yes")
        else: pass

    else:
        if c[0] == 'i': dic[ c[1] ] = i
        else: print("no")


Failing test case input:
5
insert A
insert T
insert C
find I
find C

Expected output:
no
yes


Actual output:
no
no


Fixed submission (verdict: Accepted):
n = int(input())
dic = {}
ans = []

for i in range(n):
    com = input().split()
    c = com[0]

    if com[1] in dic:
        if c[0] == 'f': ans.append("yes")
        else: pass

    else:
        if c[0] == 'i': dic[ com[1] ] = i
        else: ans.append("no")


for i in ans: print(i)
Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())
dict = []
for i in range(n):
    order = input().split()
    if order[0] == "insert":
        dict.append(order[1])
    else:
        if order[1] in dict:
            print("Yes")

Failing test case input:
5
insert @
insert T
insert C
find G
find A

Expected output:
no
no


Actual output:

Fixed submission (verdict: Accepted):
from collections import deque

n = int(input())
dict = {}
for i in range(n):
    order = input().split()
    if order[0] == "insert":
        dict[order[1]] = i
    else:
        if order[1] in dict:
            print("yes")
        else:
            print("no")

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())
dict = []
for i in range(n):
    order = input().split()
    if order[0] == "insert":
        dict.append(order[1])
    else:
        if order[1] in dict:
            print("Yes")
        else:
            print("No")

Failing test case input:
5
insert A
insert T
insert C
find G
find A

Expected output:
no
yes

Actual output:
No
Yes


Fixed submission (verdict: Accepted):
from collections import deque

n = int(input())
dict = {}
for i in range(n):
    order = input().split()
    if order[0] == "insert":
        dict[order[1]] = i
    else:
        if order[1] in dict:
            print("yes")
        else:
            print("no")

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())

strs = []

for i in range(n):
    s = input().split()
    print(s)
    if(s[0] == 'insert'):
        if(s[1] not in strs):
            strs.append(s[1])
    else:
        if(s[1] in strs):
            print('yes')
        else:
            print('no')
print (strs)


Failing test case input:
13
insert AAA
insert AAC
insert AGA
insert AGG
insert TTT
find AAA
find CCC
find CCC
insert CCC
find BCC
insert T
find TTT
find T

Expected output:
yes
no
no
no
yes
yes


Actual output:
['insert', 'AAA']
['insert', 'AAC']
['insert', 'AGA']
['insert', 'AGG']
['insert', 'TTT']
['find', 'AAA']
yes
['find', 'CCC']
no
['find', 'CCC']
no
['insert', 'CCC']
['find', 'BCC']
no
['insert', 'T']
['find', 'TTT']
yes
['find', 'T']
yes
['AAA', 'AAC', 'AGA', 'AGG', 'TTT', 'CCC', 'T']


Fixed submission (verdict: Accepted):
n = int(input())

strs = {}

for i in range(n):
    s = input().split()
    if(s[0] == 'insert'):
        if(s[1] not in strs):
            strs[s[1]] = ''
    else:
        if(s[1] in strs):
            print('yes')
        else:
            print('no')
Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
from collections import deque

D = deque()
N = int(input())

for i in range(N):
	c, s = input().split()
	if c == "insert":
		D.append(s)
	elif c == "find":
		if (s in D):
			print("Yes")
		else:
			print("No")

Failing test case input:
13
insert AAA
insert ABC
insert AGA
insert GGA
insert TTT
find AAA
find BCC
find CBC
insert CCC
find BCC
insert T
find TTT
find T

Expected output:
yes
no
no
no
yes
yes


Actual output:
Yes
No
No
No
Yes
Yes


Fixed submission (verdict: Accepted):
from collections import deque

D = set()
N = int(input())

for i in range(N):
	c, s = input().split()
	if c == "insert":
		D.add(s)
	elif c == "find":
		if (s in D):
			print("yes")
		else:
			print("no")

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())
d = {}
for i in range(n):
    print(d)
    cmd = input()
    if cmd[0] == 'i':
        d[cmd[7:]] = 0
    else:
        print('yes' if cmd[5:] in d else 'no')

Failing test case input:
13
insert @AA
insert ABC
insert AGA
insert GGA
insert TTT
find AAA
find BCC
find CBC
insert CCC
find CCB
insert T
find STT
find T

Expected output:
no
no
no
no
no
yes


Actual output:
{}
{'@AA': 0}
{'@AA': 0, 'ABC': 0}
{'@AA': 0, 'ABC': 0, 'AGA': 0}
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0}
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0}
no
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0}
no
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0}
no
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0}
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0, 'CCC': 0}
no
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0, 'CCC': 0}
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0, 'CCC': 0, 'T': 0}
no
{'@AA': 0, 'ABC': 0, 'AGA': 0, 'GGA': 0, 'TTT': 0, 'CCC': 0, 'T': 0}
yes


Fixed submission (verdict: Accepted):
n = int(input())
d = {}
for i in range(n):
    cmd = input()
    if cmd[0] == 'i':
        d[cmd[7:]] = 0
    else:
        print('yes' if cmd[5:] in d else 'no')

Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
from collections import deque
n = int(input())
l = deque()

for i in range(n):
    cmd = input().split()
    if cmd[0] == 'insert':
        l.append(cmd[1])
    if cmd[0] == 'find':
        if l.count(cmd[1]) == 1:
         print('yes')
        else:
         print('no')

Failing test case input:
5
insert B
insert V
insert B
find G
find B

Expected output:
no
yes


Actual output:
no
no


Fixed submission (verdict: Accepted):
n = int(input())
l = set()

for i in range(n):
    cmd = input().split()
    if cmd[0] == 'insert':
        l.add(cmd[1])
    if cmd[0] == 'find':
        if cmd[1] in l:
        	print('yes')
        else:
        	print('no')
Problem: p02269
Buggy submission (Python3, verdict: Wrong Answer):
def main():
    n = int(input())

    repo = []
    for i in range(n):
        line = input()
        if line[0] == 'i':
            if line[7:10] not in repo:
                repo.append(line.split()[1])
        elif line[0] == 'f':
            if line[5:8] in repo:
                print('Yes')
            else:
                print('No')
    return


main()


Failing test case input:
13
insert @AA
insert ABC
insert AGA
insert GGA
insert TTT
find AAA
find BCC
find CBC
insert CCC
find CCB
insert T
find TTT
find T

Expected output:
no
no
no
no
yes
yes


Actual output:
No
No
No
No
Yes
Yes


Fixed submission (verdict: Accepted):
import sys

def main():
    lines = sys.stdin.readlines()
    n = int(lines[0])

    repo = {}
    for i in range(1, n + 1):
        command, acgt = lines[i].split()
        if command[0] == 'i':
            if acgt not in repo:
                repo[acgt] = 0
        elif command[0] == 'f':
            if acgt in repo:
                print('yes')
            else:
                print('no')
    return


main()
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import copy

N = int(input())
T = [int(i) for i in input().split()]
M = int(input())

P = []
X = []
for _ in range(M):
    p, x = [int(i) for i in input().split()]
    P.append(p)
    X.append(x)

print(P)
print(X)
for i in range(M):
    a = copy.deepcopy(T)
    a[P[i] - 1] = X[i]
    print(a)
    print(sum(a))

Failing test case input:
5
7 2 1 10 0
3
3 2
1 7
4 20

Expected output:
21
20
30


Actual output:
[3, 1, 4]
[2, 7, 20]
[7, 2, 2, 10, 0]
21
[7, 2, 1, 10, 0]
20
[7, 2, 1, 20, 0]
30


Fixed submission (verdict: Accepted):
import copy

N = int(input())
T = [int(i) for i in input().split()]
M = int(input())

P = []
X = []
for _ in range(M):
    p, x = [int(i) for i in input().split()]
    P.append(p)
    X.append(x)

for i in range(M):
    a = copy.deepcopy(T)
    a[P[i] - 1] = X[i]
    print(sum(a))

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    print(sum(T) - (T[P-1] - X) + X)

Failing test case input:
5
7 5 1 19 5
3
3 2
1 7
3 7

Expected output:
38
37
43


Actual output:
40
44
50


Fixed submission (verdict: Accepted):
N = int(input())
T = list(map(int, input().split()))
M = int(input())
for i in range(M):
    P, X = map(int, input().split())
    print(sum(T) - (T[P-1] - X))

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
T=list(map(int,input().split()))
m=int(input())
for i in range(m):
    p,k=map(int,input().split())
    T[p-1]=k
    print(sum(T))            

Failing test case input:
5
7 0 0 6 6
3
4 3
1 19
3 7

Expected output:
16
31
26


Actual output:
16
28
35


Fixed submission (verdict: Accepted):
n=int(input())
T=list(map(int,input().split()))
m=int(input())
for i in range(m):
    p,k=map(int,input().split())
    tmp=T[p-1]
    T[p-1]=k
    print(sum(T))
    T[p-1]=tmp

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
t_list = list(map(int,input().split()))
m = int(input())

splt_list = t_list[m:n+1]
for _ in range(m):
    p,x = map(int,input().split())
    print(p+x+sum(splt_list))

Failing test case input:
3
2 0 4
2
1 0
0 3

Expected output:
4
5


Actual output:
5
7


Fixed submission (verdict: Accepted):
n = int(input())
t_list = list(map(int,input().split()))
m = int(input())

for _ in range(m):
    temp_list = list(t_list)
    p,x = map(int,input().split())

    temp_list[p-1] = x
    print(sum(temp_list))
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = solve_times
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


print(main())


Failing test case input:
5
7 5 1 10 5
3
4 3
2 11
3 12

Expected output:
21
34
39


Actual output:
21
27
38
None


Fixed submission (verdict: Accepted):

from copy import deepcopy


def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = deepcopy(solve_times)
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


main()

Problem: p03845
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
p = []
x = []
for i in range(m):
    a,b = map(int,input().split())
    p.append(a)
    x.append(b)

for i in range(m):
    print(t)
    s = list(t)
    j = p[i] - 1
    s[j] = x[i]
    print(sum(s))

Failing test case input:
3
1 1 0
2
1 1
0 8

Expected output:
2
10


Actual output:
[1, 1, 0]
2
[1, 1, 0]
10


Fixed submission (verdict: Accepted):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
p = []
x = []
for i in range(m):
    a,b = map(int,input().split())
    p.append(a)
    x.append(b)

for i in range(m):
    s = list(t)
    j = p[i] - 1
    s[j] = x[i]
    print(sum(s))

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
T=list(map(int,input().split()))
M=int(input())
Ans=sum(T)
for i in range(M):
  p,x=map(int,input().split())
  xx=Ans+x-T[p-1]
  print(x)


Failing test case input:
5
7 2 4 6 5
3
4 0
1 7
4 13

Expected output:
18
24
31


Actual output:
0
7
13


Fixed submission (verdict: Accepted):
N=int(input())
T=list(map(int,input().split()))
M=int(input())
Ans=sum(T)
for i in range(M):
  p,x=map(int,input().split())
  xx=Ans+x-T[p-1]
  print(xx)

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

N = int(input())
T = list(map(int, input().split()))
M = int(input())
P = [list(map(int, input().split())) for _ in range(M)]

for i in range(M):
    temp = T[P[i][0] - 1]
    T[P[i][0] - 1] = P[i][1]
    print(sum(T))
    T[P[i][0] - 1] += temp

Failing test case input:
5
7 0 0 10 6
3
4 3
1 11
3 7

Expected output:
16
27
30


Actual output:
16
30
44


Fixed submission (verdict: Accepted):

N = int(input())
T = list(map(int, input().split()))
M = int(input())
P = [list(map(int, input().split())) for _ in range(M)]

for i in range(M):
    temp = T[P[i][0] - 1]
    T[P[i][0] - 1] = P[i][1]
    print(sum(T))
    T[P[i][0] - 1] = temp
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
time = list(map(int,input().split()))
M = int(input())
time_2 = time
for i in range(M):
    p, x = list(map(int,input().split()))
    time_2[p-1] = x
    ans = sum(time)
    print(ans)
    time_2[p-1] = time[p-1]


Failing test case input:
5
7 0 3 10 5
3
4 2
2 7
4 20

Expected output:
17
32
35


Actual output:
17
24
42


Fixed submission (verdict: Accepted):
N = int(input())
time = tuple(map(int,input().split()))
M = int(input())
time_2 = list(time)

for i in range(M):
    p, x = list(map(int,input().split()))
    time_2[p-1] = x
    ans = sum(time_2)
    print(ans)
    time_2[p-1] = time[p-1]

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
A=list(map(int,input().split()))
B=A
m=int(input())
for i in range(m):
  a,b=map(int,input().split())
  B[a-1]=b
  print(sum(B))
  B=A

Failing test case input:
5
7 5 1 10 5
3
4 3
1 11
3 12

Expected output:
21
32
39


Actual output:
21
25
36


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

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
t=list(map(int,input().split()))
m=int(input())
px = [list(map(int, input().split())) for _ in range(m)]

for i in range(m):
    t[px[i][0]-1]=px[i][1]
    print(sum(t))

Failing test case input:
5
1 4 1 10 6
3
4 0
1 11
3 7

Expected output:
12
32
28


Actual output:
12
22
28


Fixed submission (verdict: Accepted):
n=int(input())
t=list(map(int,input().split()))
sumt=sum(t)
m=int(input())
px = [list(map(int, input().split())) for _ in range(m)]
for i in range(m):   
    a=t[px[i][0]-1]
    b=px[i][1]
    print(sumt-a+b)

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
test = list(map(int,input().split()))
M = int(input()) 
  
for _ in range(M):
  a,b = map(int,input().split())
  test[a-1] = b
  print(sum(test))

Failing test case input:
5
7 0 0 6 6
3
4 0
1 12
3 8

Expected output:
13
24
27


Actual output:
13
18
26


Fixed submission (verdict: Accepted):
N = int(input())
test = list(map(int,input().split()))
M = int(input()) 
  
for _ in range(M):
  a,b = map(int,input().split())
  print(sum(test) - test[a-1] + b)

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
t=list(map(int,input().split()))
m=int(input())
drink=[]
all=sum(t)
for i in range(m):
  drink.append(list(map(int,input().split())))
for j in range(n):
  if j<m:
    print(all-t[j]+drink[j][1])
  else:
    print(all)

Failing test case input:
5
7 5 1 10 5
3
4 3
1 11
3 7

Expected output:
21
32
34


Actual output:
24
34
34
28
28


Fixed submission (verdict: Accepted):
n=int(input())
t=list(map(int,input().split()))
m=int(input())
drink=[]
all=sum(t)
for i in range(m):
  drink.append(list(map(int,input().split())))
for j in range(m):
  if drink[j][0]<=n:
    print(all-t[drink[j][0]-1]+drink[j][1])
  else:
    print(all)
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times[problem_idx] = solve_time
        print(sum(solve_times))


print(main())


Failing test case input:
5
7 5 1 10 5
3
4 3
2 11
3 12

Expected output:
21
34
39


Actual output:
21
27
38
None


Fixed submission (verdict: Accepted):

from copy import deepcopy


def main():
    problems = int(input())
    solve_times = [int(e) for e in input().split()]
    drinks = int(input())

    for i in range(drinks):
        solve_times_copy = deepcopy(solve_times)
        problem_idx, solve_time = [int(e) for e in input().split()]
        problem_idx -= 1
        solve_times_copy[problem_idx] = solve_time
        print(sum(solve_times_copy))


main()

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N = int(input())
T = list(map(int,input().split()))
M = int(input())
PX = [input() for _ in range(M)]
print(PX)

for _ in range(M):
    PX[_] = list(map(int, PX[_].split()))
print(PX)

lst = []
for i in range(M):
    lst.append(sum(T) - T[PX[i][0]-1] + PX[i][1])
print(lst)

for j in range(M):
    print(lst[j])

Failing test case input:
5
7 0 0 7 6
3
4 3
1 19
3 8

Expected output:
16
32
28


Actual output:
['4 3', '1 19', '3 8']
[[4, 3], [1, 19], [3, 8]]
[16, 32, 28]
16
32
28


Fixed submission (verdict: Accepted):


N = int(input())
T = list(map(int,input().split()))
M = int(input())
PX = [input() for _ in range(M)]

for _ in range(M):
    PX[_] = list(map(int, PX[_].split()))

lst = []
for i in range(M):
    lst.append(sum(T) - T[PX[i][0]-1] + PX[i][1])

for j in range(M):
    print(lst[j])

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
question_num = int(input())
question_resolve_time = list(map(int, input().split()))
drink_num = int(input())

drink_data = []
try:
    for i in range(0, question_num):
        a = list(map(int, input().split()))
        drink_data.append(a)
except EOFError:
    pass

not_drinking_time = sum(question_resolve_time)

for drink in drink_data:
    result_time = not_drinking_time - question_resolve_time[drink[0] - 1] + drink[1]
    print(result_time)


Failing test case input:
3
2 1 -1
1
1 0
0 8

Expected output:
0


Actual output:
0
11


Fixed submission (verdict: Accepted):
question_num = int(input())
question_resolve_time = list(map(int, input().split()))
drink_num = int(input())

drink_data = []
for i in range(0, drink_num):
    a = list(map(int, input().split()))
    drink_data.append(a)

not_drinking_time = sum(question_resolve_time)

for drink in drink_data:
    result_time = not_drinking_time - question_resolve_time[drink[0] - 1] + drink[1]
    print(result_time)
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
T=list(map(int,input().split()))
M=int(input())
for i in range (M):
    P=list(map(int,input().split()))
    print(sum(P)+sum(T[len(P):]))

Failing test case input:
5
7 8 1 10 6
3
4 3
0 11
3 7

Expected output:
25
37
38


Actual output:
24
28
27


Fixed submission (verdict: Accepted):
from copy import copy

N=int(input())
T=list(map(int,input().split()))
M=int(input())
for i in range (M):
    P, X =map(int,input().split())
    data=copy(T)
    data[P-1]=X
    print(sum(data))

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
num = int(input())
time = list(map(int, input().split()))
drink = int(input())
eff = [list(map(int, input().split())) for i in range(drink)]

baseT = sum(time)
print(baseT)
for i in range(drink):
    print(baseT - time[eff[i][0]-1] + eff[i][1])

Failing test case input:
3
2 1 4
2
1 1
2 3

Expected output:
6
9

Actual output:
7
6
9


Fixed submission (verdict: Accepted):
num = int(input())
time = list(map(int, input().split()))
drink = int(input())
eff = [list(map(int, input().split())) for i in range(drink)]

baseT = sum(time)
for i in range(drink):
    print(baseT - time[eff[i][0]-1] + eff[i][1])

Problem: p03845
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
t=list(map(int,input().split()))
m=int(input())
for i in range(m):
    a,b=map(int,input().split())
    total=t
    total[a-1]=b
    print(sum(total))

Failing test case input:
5
7 0 3 10 5
3
4 2
2 7
4 20

Expected output:
17
32
35


Actual output:
17
24
42


Fixed submission (verdict: Accepted):
import copy
n=int(input())
t=list(map(int,input().split()))
m=int(input())
for i in range(m):
    a,b=map(int,input().split())
    total=copy.copy(t)
    total[a-1]=b
    print(sum(total))

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
origin,ans = [],[]

for i in range(m):
	p,x = map(int,input().split())
	origin.append(t[p-1])
	t[p-1] = x
	ans.append(sum(t))
	t[p-1] = origin[0]
	origin = []
	
print(ans)

Failing test case input:
5
7 8 1 10 11
3
4 3
0 11
3 7

Expected output:
30
37
43


Actual output:
[30, 37, 43]


Fixed submission (verdict: Accepted):
n = int(input())
t = list(map(int,input().split()))
m = int(input())
origin,ans = [],[]

for _ in range(m):
	p,x = map(int,input().split())
	origin.append(t[p-1])
	t[p-1] = x
	ans.append(sum(t))
	t[p-1] = origin[0]
	origin = []

for i in range(m):
	print(ans[i])

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
t = list(map(int, input().split()))
m = int(input())
drink = []
for i in range(m):
    drink = list(map(int, input().split()))
    gap = abs(len(drink) - len(t))*-1
    print(sum(drink + t[gap:]))


Failing test case input:
3
2 1 4
2
1 1
0 3

Expected output:
6
6


Actual output:
6
7


Fixed submission (verdict: Accepted):
n = int(input())
t = list(map(int,input().split()))
m = int(input())

for i in range(m):
    p, x = map(int, input().split())
    total = sum(t) - t[p-1] + x
    print(total)
Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import copy
n = int(input())
times = [int(i) for i in input().split()]
m = int(input())
px = [input().split() for _ in range(m)]
n_times = copy.copy(times)
for p,x in px:
    n_times[int(p)-1] = int(x)
    print(sum(n_times))
    n_times = times

Failing test case input:
5
11 4 0 10 5
3
4 2
1 7
3 7

Expected output:
22
26
37


Actual output:
22
26
33


Fixed submission (verdict: Accepted):
import copy
n = int(input())
times = [int(i) for i in input().split()]
m = int(input())
px = [input().split() for _ in range(m)]
n_times = copy.copy(times)
for p,x in px:
    n_times[int(p)-1] = int(x)
    print(sum(n_times))
    n_times = copy.copy(times)

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
Tlist = [int(N) for N in input().split()]
M = int(input())
PXlist = [[int(i) for i in input().split()]for j in range(M)]
def time_sum():
    s = 0
    for i in range(0,N):
        s = s+Tlist[i]
    return s
def time_cal():
    empty = []
    for i in range(0,M):
        empty.append(time_sum() - Tlist[PXlist[i][0]-1] + PXlist[i][1])
    return empty
print(time_sum)
for i in time_cal():
    print(i)

Failing test case input:
3
2 0 4
2
0 0
0 3

Expected output:
2
5


Actual output:
<function time_sum at 0x7f06abe5c4a0>
2
5


Fixed submission (verdict: Accepted):
N = int(input())
Tlist = [int(N) for N in input().split()]
M = int(input())
PXlist = [[int(i) for i in input().split()]for j in range(M)]
def time_sum():
    s = 0
    for i in range(0,N):
        s = s+Tlist[i]
    return s
def time_cal():
    empty = []
    for i in range(0,M):
        empty.append(time_sum() - Tlist[PXlist[i][0]-1] + PXlist[i][1])
    return empty
for i in time_cal():
    print(i)

Problem: p03845
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
p = list(map(int, input().split()))
k = int(input())
for i in range(k):
  a, b = map(int, input().split())
  p[a - 1] = b
  print(sum(p))


Failing test case input:
3
1 1 -1
2
1 0
0 2

Expected output:
0
4


Actual output:
0
3


Fixed submission (verdict: Accepted):
n = int(input())
p = list(map(int, input().split()))
k = int(input())
for i in range(k):
  a, b = map(int, input().split())
  c = p[a-1]
  p[a-1] = b
  print(sum(p))
  p[a-1] = c

Problem: p03845
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import copy
t=input()
qlist = list(map(int,input().split()))
hmd = int(input())
for i in range(hmd):
    drk=list(map(int,input().split()))
    alist = copy.copy(qlist)
    alist[drk[0]-1]=drk[1]
    print(alist)
    print(sum(alist))


Failing test case input:
5
7 8 1 10 11
3
4 3
0 11
3 7

Expected output:
30
37
43


Actual output:
[7, 8, 1, 3, 11]
30
[7, 8, 1, 10, 11]
37
[7, 8, 7, 10, 11]
43


Fixed submission (verdict: Accepted):
import copy
t=input()
qlist = list(map(int,input().split()))
hmd = int(input())
for i in range(hmd):
    drk=list(map(int,input().split()))
    alist = copy.copy(qlist)
    alist[drk[0]-1]=drk[1]
    print(sum(alist))