Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
#ABC134 C

N = int(input())
A = []
for i in range(N):
    a = int(input())
    A.append(a)

for i in range(N):
    if A[i] != max(A):
        print(max(A))
    else:
        p = A[i]
        A[i] = 0
        print(max(A))
        A[i] = p

Fixed submission:
#ABC134 C (再考察)

N = int(input())
A = []
for i in range(N):
    a = int(input())
    A.append(a)
    
AA = sorted(A,reverse = True)
for i in range(N):
    if A[i] != AA[0]:
        print(AA[0])
    else:
        print(AA[1])
Buggy python submission (verdict: Runtime Error):
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
elif 2 <= R - L and R - L <= 2019:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)
    print(min(A))
elif R - L = 1:
    print((R*L)%2019)

Fixed submission:
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
elif 2 <= R - L and R - L <= 2019:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)
    print(min(A))
elif R - L == 1:
    print((R*L)%2019)

Buggy python submission (verdict: Runtime Error):
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
elif 2 <= R - L and R - L <= 2019:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)
            print(min(A))
elif R - L = 1:
    print((R*L)%2019)

Fixed submission:
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
elif 2 <= R - L and R - L <= 2019:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)
    print(min(A))
elif R - L == 1:
    print((R*L)%2019)

Buggy python submission (verdict: Runtime Error):
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
else:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)

print(min(A))

Fixed submission:
#ABC133 C

L,R = map(int,input().split())
A = []
if R - L > 2019:
    print(0)
elif 2 <= R - L and R - L <= 2019:
    for i in range(L,R):
        for j in range(i+1,R+1):
            A.append((i*j)%2019)
    print(min(A))
elif R - L == 1:
    print((R*L)%2019)
Buggy python submission (verdict: Runtime Error):
#ABC132 B

n = int(input())
K = 0
for i in range(n-2):
    if (P[i]<P[i+1] and P[i+1] < P[i+2]) or (P[i+2]<P[i+1] and P[i+1]<P[i]):
        K += 1
        
print(K)

Fixed submission:
#ABC132 A

S = str(input())
T = [S[0],S[1],S[2],S[3]]
T.sort()
if T[0] == T[1] and T[2] == T[3] and T[1] != T[2]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
#ABC132 A

S = str(input())
T = [S[0],S[1],S[2],S[3]]
T.sort()
if T[0] == T[1] and T[2] == T[3] and T[1] != T[2]
    print("Yes")
else:
    print("No")

Fixed submission:
#ABC132 A

S = str(input())
T = [S[0],S[1],S[2],S[3]]
T.sort()
if T[0] == T[1] and T[2] == T[3] and T[1] != T[2]:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
#ABC132 A

S = str(input())
S.sort()
if S[0] = S[1] and S[2] = S[3]:
    print("Yes")
else:
    print("No")

Fixed submission:
#ABC132 A

S = str(input())
T = [S[0],S[1],S[2],S[3]]
T.sort()
if T[0] == T[1] and T[2] == T[3] and T[1] != T[2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
#ABC132 B

n = int(input())
K = 0
for i in range(n-2):
    if (P[i]<P[i+1] and P[i+1] < P[i+2]) or (P[i+2]<P[i+1] and P[i+1]<P[i]):
        K += 1
        
print(K)

Fixed submission:
#ABC132 B

n = int(input())
P = list(map(int,input().split()))
K = 0
for i in range(n-2):
    if (P[i] < P[i+1] and P[i+1] < P[i+2]) or (P[i+2] < P[i+1] and P[i+1] < P[i]):
        K += 1
        
print(K)

Buggy python submission (verdict: Runtime Error):
n = int(input())
K = 0
for i in range(n-2):
    if P[i]<P[i+1]<P[i+2] or P[i+2]<P[i+1]<P[i]:
        K += 1
        
print(K)

Fixed submission:
#ABC132 B

n = int(input())
P = list(map(int,input().split()))
K = 0
for i in range(n-2):
    if (P[i] < P[i+1] and P[i+1] < P[i+2]) or (P[i+2] < P[i+1] and P[i+1] < P[i]):
        K += 1
        
print(K)
Buggy python submission (verdict: Time Limit Exceeded):
#ABC132 C

N = int(input())
D = list(map(int,input().split()))
count = 0
for K in range(max(D) + 1):
    A = []
    B = []
    for i in range(N):
        if D[i] >= K:
            A.append(D[i])
        else:
            B.append(D[i])
        
    if len(A) == len(B):
        count += 1
        
    
    
print(count)

Fixed submission:
#ABC132 C

N = int(input())
D = list(map(int,input().split()))
D.sort()
A = list(range(D[int(N/2)-1]+1,D[int(N/2)]+1))

print(len(A))

Buggy python submission (verdict: Runtime Error):
#ABC132 C

N = int(input())
D = list(map(int,input().split()))
count = 0
for K in range(N):
    A = []
    B = []
    if D[i] >= K:
        A.append(D[i])
    else:
        B.append(D[i])
    if len(A) == len(B):
        count += 1
    
print(count)

Fixed submission:
#ABC132 C

N = int(input())
D = list(map(int,input().split()))
D.sort()
A = list(range(D[int(N/2)-1]+1,D[int(N/2)]+1))

print(len(A))
Buggy python submission (verdict: Runtime Error):
#ABC130 B

N,X = map(int,input().split())
L = list(map(int,input().split()))
D = [0,L[0]]
count = 0
for i in range(2,N+2):
    D.append(D[i-1]+L[i-2])
for i in range(0,N+2):
    if D[i]<= X:
        count += 1

print(count)

Fixed submission:
#ABC130 A

X,A = map(int,input().split())
if X < A:
    print(0)
else:
    print(10)
Buggy python submission (verdict: Runtime Error):
W,H,x,y = map(int,input().split())
if y == H*x/W or y == H - H*x/W:
    print(W*H,1.split())
else:
    print(W*H,0.split())

Fixed submission:
W,H,x,y = map(int,input().split())
if x == W/2 and y == H/2:
    a = 1
else:
    a = 0
print(W*H/2,a)

Buggy python submission (verdict: Runtime Error):
W,H,x,y = map(int,input().split())
if y == H*x/W or y == H - H*x/W:
    print(W*H 1)
else:
    print(W*H 0)

Fixed submission:
W,H,x,y = map(int,input().split())
if x == W/2 and y == H/2:
    a = 1
else:
    a = 0
print(W*H/2,a)
Buggy python submission (verdict: Runtime Error):
#ABC127 A

A, B = map(int,input(),split())
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B/2)
elif A <= 5:
    print(0)

Fixed submission:
A, B = map(int,input().split())
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B//2)
elif A <= 5:
    print(0)
Buggy python submission (verdict: Runtime Error):
#ABC126 B

S = list(map(int,input()))
if 1 <= S[0]*10 + S[1] <= 12 and 1 <= S[2]*10 + S[3] <= 12:
    print("AMBIGUOUS")
elif 1 <= S[0]*10 + S[1] <= 12 and (S[2]*10 + S[3] > 12 or S[2]*10 + S[3] == 0):
    print("MMYY")
elif (S[0]*10 + S[1] > 12 or S[0]*10 + S[1] == 0)  and  1 <= S[2]*10 + S[3] <= 12:
    print("YYMM")
elif (S[0]*10 + S[1] > 12 or S[0]*10 + S[1] == 0) and (S[2]*10 + S[3] > 12 or S[2]*10 + S[3] == 0):
    print("NA")

Fixed submission:
N,K = map(int,input().split())
S = str(input())
T = list(map(str,S))

for i in range(N):
    if i == K-1:
        T[i] = str.lower(T[i])

print("".join(T))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)

print(sum(l[0::2])-sum(l[1::2]))

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

print(sum(A[0::2])-sum(A[1::2]))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a*b%2 = 0:
  print("Even")
else:
  print("Odd")
  

Fixed submission:
a,b = map(int,input().split())
if a*b%2==0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = sorted[input() for _ in range(N)]
print(len(set(A)))


Fixed submission:
N = int(input())
A = sorted([input() for _ in range(N)])
print(len(set(A)))
Buggy python submission (verdict: Runtime Error):
N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
  for y in range(N+1-x):
    if N-x-y >=0 and 10000*x + 5000*y + 1000*z == Y:
      res = (x,y,N-x-y)
print(res[0],res[1],res[2])


Fixed submission:
N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
  for y in range(N+1-x):
    if N-x-y >=0 and 10000*x + 5000*y + 1000*(N-x-y) == Y:
      res = (x,y,N-x-y)
print(res[0],res[1],res[2])

Buggy python submission (verdict: Runtime Error):
N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
  for y in range(N+1-x):
    if N-x-y >=0 and 10000*x + 5000*y + 1000*z = Y:
      res = (x,y,N-x-y)
print(res[0],res[1],res[2])

Fixed submission:
N,Y = map(int,input().split())
res = (-1,-1,-1)
for x in range(N+1):
  for y in range(N+1-x):
    if N-x-y >=0 and 10000*x + 5000*y + 1000*(N-x-y) == Y:
      res = (x,y,N-x-y)
print(res[0],res[1],res[2])
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())
S = sum(i for i in range(1,N+1) if A <= sum(list(map(int,str(i))) <= B)
print(S)



Fixed submission:
N,A,B = map(int,input().split())
K = 0
for i in range(1,N+1):
  if A <= sum(map(int,str(i))) <= B:
    K += i
print(K)
Buggy python submission (verdict: Runtime Error):
def d(n):
  while n%2 == 0:
    n /= 2
    ans += 1
  return ans

n = int(input())
a = map(int,input().split())
t = min(list(map(d,a)))

print(t)
    


Fixed submission:
n = input()
result = sum(list(map(int,str(n))))
print(result)

Buggy python submission (verdict: Runtime Error):
def d(n):
  while n%2 == 0:
    n /= 2
    ans += 1
  return ans

n = int(input())
a = map(int,input().split())
ans = min(list(map(d,a)))

print(ans)
    


Fixed submission:
n = input()
result = sum(list(map(int,str(n))))
print(result)

Buggy python submission (verdict: Runtime Error):
n = input()
def sum(n):
  s = str(n)
  a = list(map(int, s))
  return sum(a)

print(sum(n))


Fixed submission:
n = input()
result = sum(list(map(int,str(n))))
print(result)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int.input())
print(a+b+c)

Fixed submission:
n = input()
result = sum(list(map(int,str(n))))
print(result)
Buggy python submission (verdict: Runtime Error):
def d(n):
  while n%2 == 0:
    n /= 2
    ans += 1
  return ans

n = int(input())
a = map(int,input().split())
t = min(list(map(d,a)))

print(t)
    


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

K = 0
while all(a%2 == 0 for a in A):
  A = [a/2 for a in A]
  K += 1
  
print(K)

Buggy python submission (verdict: Runtime Error):
def d(n):
  while n%2 == 0:
    n/= 2
    ans+= 1
  return ans

n = int(input())
a = map(int,input().split())
ans = min(map(d,a))

print(ans)
    


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

K = 0
while all(a%2 == 0 for a in A):
  A = [a/2 for a in A]
  K += 1
  
print(K)

Buggy python submission (verdict: Runtime Error):
def d(n):
  while n%2 == 0:
    n /= 2
    ans += 1
  return ans

n = int(input())
a = map(int,input().split())
ans = min(list(map(d,a)))

print(ans)
    

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

K = 0
while all(a%2 == 0 for a in A):
  A = [a/2 for a in A]
  K += 1
  
print(K)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
b = []
val = 0
for i in range(0, n):
    b.append(a[i] * sum(a[:i])) 
val = sum(b)
print(val % (10 ** 9 + 7))

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
b = []
val = 0
sum_val= 0
for i in range(0, n):
    b.append(a[i] * sum_val) 
    sum_val+= a[i] 
val = sum(b)
print(val % (10 ** 9 + 7))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
val = 0
for i in range(n - 1):
    for j in range(i + 1, n):
        val += a[i] * a[j]
print(val % (10**9 + 7))

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
b = []
val = 0
sum_val= 0
for i in range(0, n):
    b.append(a[i] * sum_val) 
    sum_val+= a[i] 
val = sum(b)
print(val % (10 ** 9 + 7))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
b = a.copy()
max_index = a.index(max(a))
count = 0
last_index = len(a)
while(last_index > 0):
    b[max_index: last_index] = [a[max_index]] * (last_index - max_index)
    last_index = max_index
    
    if last_index == 0 or len(set(a[:last_index])) <= 1:
        break
    max_index = a.index(max(a[:last_index]))

for i in range(len(a)):
    count += b[i] - a[i]
print(count)

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
    if max >  a[i]:
        if a[i - 1] > max:
            max = a[i - 1]
        count += max - a[i]
    else:
        max = a[i]
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
b = a.copy()
max_index = a.index(max(a))
count = 0
last_index = len(a)
while(last_index > 0):
    b[max_index: last_index] = [a[max_index]] * (last_index - max_index)
    last_index = max_index
    if last_index == 0:
        break
    max_index = a.index(max(a[:last_index]))

for i in range(len(a)):
    count += b[i] - a[i]
print(count)

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
    if max >  a[i]:
        if a[i - 1] > max:
            max = a[i - 1]
        count += max - a[i]
    else:
        max = a[i]
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
max_index = a.index(max(a))
count = 0
last_index = len(a)
while(last_index > 0):
    for i in range(max_index,last_index):
        count += a[max_index] - a[i]
    last_index = max_index
    if last_index == 0:
        break
    max_index = a.index(max(a[:last_index]))

print(count)

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
    if max >  a[i]:
        if a[i - 1] > max:
            max = a[i - 1]
        count += max - a[i]
    else:
        max = a[i]
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
b = a.copy()
max_index = a.index(max(a))
last_index = len(a)
while(last_index > 0):
    for i in range(max_index,last_index):
        b[i] = b[max_index]
    last_index = max_index
    if last_index == 0:
        break
    max_index = b.index(max(a[:last_index]))

count = 0
for i in range(len(a)):
    count += b[i] - a[i]
print(count)

Fixed submission:
n = int(input())
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
    if max >  a[i]:
        if a[i - 1] > max:
            max = a[i - 1]
        count += max - a[i]
    else:
        max = a[i]
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
import functools
import operator

n, k = map(int, input().split())
a = [int(s) for s in input().split()]
vals = []
for i in range(k - 1, n):
    vals.append(functools.reduce(operator.mul, a[i - k + 1:i + 1]))

for i in range(n - k):
    if vals[i + 1] > vals[i]:
        print('Yes')
    else:
        print('No') 

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

for i in range(k, n):
    if a[i] > a[i - k]:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
n, k = map(int, input().split())
a = [int(s) for s in input().split()]

last_val = 1
for i in range(k - 1, n):
    val = 1
    for j in range(k):
        val *= a[i - j]
    if i >= k:
        if i >= k and val > last_val:
            print('Yes')
        else:
            print('No')
    last_val = val

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

for i in range(k, n):
    if a[i] > a[i - k]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Time Limit Exceeded):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = 'NO'
for i in range(t):
    if a < b:
        a += v
        b += w
    else:
        a -= v
        b -= w
    if a == b:
        ans = 'YES'
        break
print(ans)


Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a - b) <= (v -w) * t:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Time Limit Exceeded):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = 'NO'
for i in range(t):
    if a < b:
        a += v
        b += w
    else:
        a -= v
        b -= w
    if a == b:
        ans = 'YES'
        break
print(ans)

Fixed submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a - b) <= (v -w) * t:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(s) for s in input().split()]
ans = 1
for i in a:
    ans *= i
print(ans) if ans <= (10 ** 18) else print(-1)

Fixed submission:
def main():
    n = int(input())
    a = [int(s) for s in input().split()]
    ans = 1
    if 0 in a:
        print(0)
        return
    for i in a:
        ans *= i
        if ans > (10 ** 18):
            ans = -1
            break
    print(ans)
main()
Buggy python submission (verdict: Runtime Error):
r = int(input())

ans = 2 * math.pi * r
print(ans)

Fixed submission:
import math

r = int(input())

ans = 2 * math.pi * r
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
A, B, M = map(int, input().split())
a = [int(s) for s in input().split()]
b = [int(s) for s in input().split()]
m = []
for n in range(M):
    m.append([int(s) for s in input().split()])

min = a[0] + b[0]
for i in range( len(a)):
    for j in range(len(b)):
        price = a[i] + b[j]
        discountPrice = price
        for k in range(M):
            if i + 1 in m[k] and j + 1 in m[k]:
                discountPrice = price - m[k][2]
            if min > discountPrice:
                min = discountPrice


print(min)


Fixed submission:
A, B, M = map(int, input().split())
a = [int(s) for s in input().split()]
b = [int(s) for s in input().split()]
m = []


for n in range(M):
    m.append([int(s) for s in input().split()])

minValue = min(a) + min(b)

for i in range(M):
    discountPrice = a[m[i][0] - 1] + b[m[i][1] - 1] - m[i][2]
    if discountPrice  < minValue:
        minValue = discountPrice

print(minValue)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = 'No'
index = s.find(s[0], 1)
if index >= 1:
    s = s.replace(s[0], '')
    if (len(s) >= 2) & (s[0] == s[1]):
        ans ='Yes'
    
print(ans)

Fixed submission:
s = input()
ans = 'No'
index = s.find(s[0], 1)
if index >= 1:
    s = s.replace(s[0], '')
    if (len(s) == 2):
        if (s[0] == s[1]):
            ans ='Yes'
    
print(ans)
Buggy python submission (verdict: Runtime Error):
n, x = map(int, input().split())
l = [int(s) for s in input().split()]

pos = 0
index = 0
while pos < x:
    pos += l[index]
    index += 1
print(index)

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

pos = 0
count = 1
for i in range(n):
    pos += l[i]
    if pos > x:
        break
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n, x = map(int, input().split())
l = [int(s) for s in input().split()]

pos = 0
index = 0
while pos <= x:
    pos += l[index]
    index += 1
print(index)

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

pos = 0
count = 1
for i in range(n):
    pos += l[i]
    if pos > x:
        break
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = [2, 1]

for i in range(2, n + 1):
        li = l[i - 1] + l[i - 2]
        l.append(li)
print(li)

Fixed submission:
n = int(input())
l = [2, 1]

for i in range(2, n + 1):
        li = l[i - 1] + l[i - 2]
        l.append(li)
print(l[len(l) - 1])
Buggy python submission (verdict: Runtime Error):
n, n = map(int, input().split())

print((n - 1) * (m - 1))

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

print((n - 1) * (m - 1))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=str(input())
b=str(input())

a=a[:n]
b=b[:n]
x=0
for i in a:
	print(a[x],b[x],end='')
	x+=1
print()

Fixed submission:
n=int(input())

a,b=input().split()
a=a[:n]
b=b[:n]
n=0
for i in a:
	print(a[n],end='')
	print(b[n],end='')
	n+=1
print()
Buggy python submission (verdict: Runtime Error):
a = input()
print('ACL'*a)

Fixed submission:
a = int(input())
print('ACL'*a)
Buggy python submission (verdict: Runtime Error):
a = int,input()
b = a+(a**2)+a**3
print('b=',b)

Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = (int,input())
b = (int,sum(a+a**2+a**3))
print(b)


Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = int,input()
print(a+(a**2)+(a**3))


Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = int,input()
print(a+a**2+a**3)

Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = int,input()
print(a+(a*a)+(a*a*a))

Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = int,input()
b = int,sum(a + a^2 + a^3)
print(b)

Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = (int,input())
print(a + a^2 + a^3)


Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)

Buggy python submission (verdict: Runtime Error):
a = int,input()
print(a+a^2+a^3)

Fixed submission:
a = input()
b = int(a)
print(b+b**2+b**3)
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int,input().split())
t = N*A
if t > B:
  print(B)
elif t < B:
  print(t)
elif t = B:
  print(B)


Fixed submission:
N, A, B = map(int,input().split())
t = N*A
if t > B:
  print(B)
else:
  print(t)
Buggy python submission (verdict: Runtime Error):
a,p = map(int,input().split())
a == a*3*p
a + p == int,ap
print(ap)


Fixed submission:
a,p = map(int,input().split())
print((a*3+p)//2)

Buggy python submission (verdict: Runtime Error):
a,p = map(int,input().split())
ap = (int,input())
a == 3*p
a + p == ap
print(ap)

Fixed submission:
a,p = map(int,input().split())
print((a*3+p)//2)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().sprit())
if a >= 13:
  print(b)
elif 6 <= a <= 12:
  print(b//2)
else:
  print(0)

Fixed submission:
a,b = map(int,input().split())
if a >= 13:
  print(b)
elif 6 <= a <= 12:
  print(b//2)
else:
  print(0)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
An=list(map(int,input().split()))
mod=10**9+7
S=0
for i in range(N):
    for j in range(N):
        if i<j:
            S += An[i]*An[j]
print(S%mod)


Fixed submission:
N=int(input())
An=list(map(int,input().split()))
mod=10**9+7
s=sum(An)
S=0
num = 0
for i in range(N):
    num += An[i]
    S += (An[i]*(s-num))
print(S%mod)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
boss_num = list(map(int, input().split()))

for num in range(1, n+1):
	print(boss_num.count(num))

Fixed submission:
n = int(input())
l = [0]*n
boss_num = list(map(int, input().split()))

for num in boss_num:
	l[num-1] += 1	
for m in l: print(m)

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

for i in range(1, n+1):
	print (boss_num.count(str(i)))

Fixed submission:
n = int(input())
l = [0]*n
boss_num = list(map(int, input().split()))

for num in boss_num:
	l[num-1] += 1	
for m in l: print(m)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
boss_num = input().split()

for i in range(1, n+1):
	print (boss_num.count(str(i)))

Fixed submission:
n = int(input())
l = [0]*n
boss_num = list(map(int, input().split()))

for num in boss_num:
	l[num-1] += 1	
for m in l: print(m)