Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
N = int(input())

for i in range(N):
    b = int(input())
    for t in range(3):
        if A1[t] == b:
            A1[t] = -1
        elif A2[t] == b:
            A2[t] = -1
        elif A3[t] == b:
            A3[t] = -1

if A1 == A2 == A3 == [-1, -1, -1] or A1[1] == A2[1] == A3[1] == -1 or A1[2] == A2[2] == A3[2] == -1　or A1[0] == A2[0] == A3[0] == -1 or A1[0] == A2[1] == A3[2] == -1 or A1[2] == A2[1] == A3[0] == -1:
    print('Yes')
else:
    print('No')


Fixed submission:
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
N = int(input())

for i in range(N):
    b = int(input())
    for t in range(3):
        if A1[t] == b:
            A1[t] = -1
        elif A2[t] == b:
            A2[t] = -1
        elif A3[t] == b:
            A3[t] = -1

if A1 == [-1, -1, -1] \
        or A2 == [-1, -1, -1] \
        or A3 == [-1, -1, -1] \
        or A1[1] == A2[1] == A3[1] == -1 \
        or A1[2] == A2[2] == A3[2] == -1 \
        or A1[0] == A2[0] == A3[0] == -1 \
        or A1[0] == A2[1] == A3[2] == -1 \
        or A1[2] == A2[1] == A3[0] == -1 \
        or A1[0] == A2[0] == A3[0] == -1 \
        or A1[1] == A2[1] == A3[1] == -1 \
        or A1[2] == A2[2] == A3[2] == -1:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = list(str(input()))

p = []
for i in range(N/2):
    if S[i] != S[N/2+i]:
        print('No')
print('Yes')

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

if N %2 == 1:
    print('No')
    exit()
for i in range(int(N//2)):
    if S[i] != S[N//2+i]:
        print('No')
        exit()
print('Yes')
Buggy python submission (verdict: Runtime Error):
C:\pycharm\code_atcoder\venv\Scripts\python.exe C:/pycharm/code_atcoder/144C.py
100019
100018

プロセスは終了コード 0 で完了しました


Fixed submission:
import math

N = int(input())
A = []
for i in range(2,int(math.sqrt(N))+1):
    if N%i == 0:
        A.append(i + (N//i) - 2)
if not A:
    print(N-1)
else:
    print(min(A))

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

N = int(input())
A = []
for i in range(2,int(math.sqrt(N))+1):
    if N%i == 0:
        for j in range(1,N//2+1):
            if N == i * j:
                A.append(i + j - 2)
if not A:
    print(N-1)
else:
    print(min(A))

Fixed submission:
import math

N = int(input())
A = []
for i in range(2,int(math.sqrt(N))+1):
    if N%i == 0:
        A.append(i + (N//i) - 2)
if not A:
    print(N-1)
else:
    print(min(A))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = [0]*(N)
for i in range(N):
    B[A[i]] = A[i]
print(B)

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

B = [0]*N
for i in range(N):
    B[A[i]-1] = i+1

print(' '.join(map(str,B)))
Buggy python submission (verdict: Time Limit Exceeded):
N,K,Q = map(int,input().split())
A = []
for i in range(Q):
    A.append(int(input()))
B = []
C = []
for j in range(N):
    B.append(K)
    C.append(-1)

for k in range(Q):
    B[A[k]-1] += 1
    for l in range(N):
        B[l] = B[l]+C[l]

for i in range(N):
    if B[i] >= 1:
        print('Yes')
    else:
        print('No')

Fixed submission:
N,K,Q = map(int,input().split())
A = []
B = []
for j in range(N):
    B.append(K-Q)
for i in range(Q):
    A.append(int(input()))
    B[A[i]-1] += 1
for j in range(N):
    if B[j] >= 1:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
print(a+a**2+a**3)

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

Buggy python submission (verdict: Runtime Error):
print(a+a*+a**)

Fixed submission:
a = int(input())
print(a+a**2+a**3)
Buggy python submission (verdict: Time Limit Exceeded):
import functools
import operator
prod = functools.partial(functools.reduce, operator.mul)
N=int(input())
risuto=list(map(int,input().split()))
ans=prod(risuto)

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

Fixed submission:
import math
N=int(input())
risuto=list(map(int,input().split()))
ans=1
kari=0
if 0 in risuto:
    print(0)
else:
    for j in range(N):
        kari+=math.log10(risuto[j])

    if kari<18:
        for i in range(N):
            ans*=risuto[i]
        print(ans) 
    elif kari==18:
        for i in range(N):
            ans*=risuto[i]
        if ans>10**18:
            print(-1)
        else:
            print(ans)
    else:
        print(-1)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
risuto=list(map(int,input().split()))
ans=1
for i in range(N):
    ans*=risuto[i]
if ans<=(10**18):
    print(ans)
else:
    print(-1)

Fixed submission:
import math
N=int(input())
risuto=list(map(int,input().split()))
ans=1
kari=0
if 0 in risuto:
    print(0)
else:
    for j in range(N):
        kari+=math.log10(risuto[j])

    if kari<18:
        for i in range(N):
            ans*=risuto[i]
        print(ans) 
    elif kari==18:
        for i in range(N):
            ans*=risuto[i]
        if ans>10**18:
            print(-1)
        else:
            print(ans)
    else:
        print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
X=int(input())
ans1=0
ans2=0
for a in range(-(10**10),10**10):
    for b in range(-(10**10),10**10):
        if a**5-b**5==X:
            ans1=a
            ans2=b
            break
print(ans1,ans2)

Fixed submission:
X=int(input())
ans1=0
ans2=0
for a in range(-(10**3),10**3):
    for b in range(-(10**3),10**3):
        if a**5-b**5==X:
            ans1=a
            ans2=b
            break
print(ans1,ans2)
Buggy python submission (verdict: Runtime Error):
import math

A,B,N=map(int,input().split())
ans=[0]*(N+1)
for x in range(0,N+1):
    a=math.floor(A*x/B)
    b=A*math.floor((x/B))
    ans[x]+=a-b
print(max(ans))

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)

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

A,B,N=map(int,input().split())
ans=[0]*(N+1)
for x in range(0,N+1):
    a=math.floor(A*x/B)
    b=A*math.floor((x/B))
    ans[x]+=a-b
print(max(ans))

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)

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

A,B,N=map(int,input().split())
ans=[0]*(N+1)
for x in range(0,N+1):
    a=math.floor(A*x/B)
    b=A*math.floor((x/B))
    ans[x]+=a-b
print(ans)

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)

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

A,B,N=map(int,input().split())
ans=[0]*N
for x in range(0,N+1):
    a=math.floor(A*x/B)
    b=A*math.floor((x/B))
    ans[x-1]+=a-b
print(max(ans))

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)

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

A,B,N=map(int,input().split())
ans=[0]*N
for x in range(0,N+1):
    a=math.floor(((A*x)/B))
    b=A*math.floor((x/B))
    ans[x-1]+=a-b
print(max(ans))

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)

Buggy python submission (verdict: Runtime Error):
A,B,N=map(int,input().split())
ans=[0]*N
for x in range(0,N+1):
    a=int((A*x)/B)
    b=A*int(x/B)
    ans[x-1]+=a-b
print(max(ans))

Fixed submission:
A,B,N=map(int,input().split())
x=min(B-1,N)
print(int(A*x/B)-int(x/B)*A)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=[0]*N

for i in A:
    B[i-1]+=1

for i in B:
    print(i)


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
B=[0]*N

for i in A:
    B[i-1]+=1

for i in B:
    print(i)

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

for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
B=[0]*N

for i in A:
    B[i-1]+=1

for i in B:
    print(i)

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

for i in range(1,N+1):
    print(A.count(i))

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
B=[0]*N

for i in A:
    B[i-1]+=1

for i in B:
    print(i)
Buggy python submission (verdict: Runtime Error):
K=int(input())
ans=0

def gcd2(a,b):
    if b==0:
        return a
    return gcd2(b,a%b)
def gcd3(a,b,c):
    return gcd2(gcd2(a,b),c)

for i in range(1,K+1):
    for j in range(i,K+1):
        for k in range(k,K+1):
            if i==j==k:
                ans+=gcd3(i,j,k)
            elif i==j or j==k:
                ans+=gcd3(i,j,k)*3
            else:
                ans+=gcd3(i,j,k)*6

print(ans)


Fixed submission:
K=int(input())
ans=0

def gcd2(a,b):
    if b==0:
        return a
    return gcd2(b,a%b)
def gcd3(a,b,c):
    return gcd2(gcd2(a,b),c)

for i in range(1,K+1):
    for j in range(i,K+1):
        for k in range(j,K+1):
            if i==j==k:
                ans+=gcd3(i,j,k)
            elif i==j or j==k:
                ans+=gcd3(i,j,k)*3
            else:
                ans+=gcd3(i,j,k)*6

print(ans)
Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
C=int(input())
X=int(input())
count=0
for i in range(A+1):
    for j in range(B+1):
        for K in range(C+1):
            if ((500*i)+(100*j)+(50*k))==0:
                count+=1

print(count)

Fixed submission:
A=int(input())
B=int(input())
C=int(input())
X=int(input())
count=0
for i in range(A+1):
    for j in range(B+1):
        for k in range(C+1):
            if ((500*i)+(100*j)+(50*k))==X:
                count+=1

print(count)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=(a*b)%2
if c==0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a,b=map(int,input().split())
c=(a*b)%2
if c==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=(a*b)%2
if c==0:
    print("Even")
else:
    print("Odd")

Fixed submission:
a,b=map(int,input().split())
c=(a*b)%2
if c==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())

if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

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

for A in a:
    cnt=0
    while A%2==0:
        A=A//2
        cnt=cnt+1

print(cnt)


Fixed submission:
ans=10**9
n=int(input())
a=list(map(int,input().split()))

for A in a:
    cnt=0
    while A % 2==0: 
        A//=2
        cnt+=1
      
    if cnt<ans:
        ans=cnt
print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=input()

for A in a:
    while int(A)%2==0:
        print(A)
        if int(A)%2==1:
            break

Fixed submission:
ans=10**9
n=int(input())
a=list(map(int,input().split()))

for A in a:
    cnt=0
    while A % 2==0: 
        A//=2
        cnt+=1
      
    if cnt<ans:
        ans=cnt
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
K,S=map(int,input().split())
ans=0
for x in range(0,K+1):
    for y in range(0,K+1):
        for z in range(0,K+1):
            if x+y+z==S:
                ans+=1           
print(ans)

Fixed submission:
K,S=map(int,input().split())
ans=0
for x in range(0,K+1):
    for y in range(0,K+1):
        if S-(x+y)>=0 and S-(x+y)<=K:
            ans+=1           
print(ans)
Buggy python submission (verdict: Runtime Error):
input = input().split()
N = int(input[0])
A  = int(input[1])
B  = int(input[2])
arr = []
for index in range(A):
  arr.append('a')
for index in range(B):
  arr.append('b')

for index in range(0,N):
  if arr[index] == 'b':
    print(index)
    break
  elif index + 1 == N:
    print(N)
    break
  

Fixed submission:
str = input()
a = str[0]
b = str[1]
c = str[2]

if a == b ==c:
  print('No')
elif a != b or a != c or b != c:
  print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
l=list(map(int,input().split()))

s=1
r=[1]
for i in range(k):
  s=l[s-1]
  if s not in r:
    r.append(s)
    if i==k-1:
      print(s)
  else:
    x=r.index(s)
    mod=len(r)-x
    t=(k-i-1)%mod
    print(r[x+t])
    break

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

s=1
q=[0]*n
q[0]=1
r=[1]
for i in range(k):
  s=l[s-1]
  if q[s-1]==0:
    q[s-1]+=1
    r.append(s)
    if i==k-1:
      print(s)
  else:
    x=r.index(s)
    mod=len(r)-x
    t=(k-i-1)%mod
    print(r[x+t])
    break
Buggy python submission (verdict: Runtime Error):
s=input()
print('ABC' if s='ARC' else 'ARC')

Fixed submission:
s=input()
print('ABC' if s=='ARC' else 'ARC')
Buggy python submission (verdict: Runtime Error):
x=int(input())
a=[]
for i in range(220):
  a.append[i**5]
for i in range(220):
  y=x-a[i]
  if y in a:
    print(i,a.index(y))
    break
  elif -y in a:
    print(i,-a.index(y))

Fixed submission:
x=int(input())
a=[]
for i in range(220):
  a.append(i**5)
for i in range(220):
  y=a[i]-x
  if y in a:
    print(i,a.index(y))
    break
  elif -y in a:
    print(i,-a.index(-y))
    break
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
l=[]
r=[]
for i in range(n):
  l.append(i+a[i]+1)
  r.append(i-a[i]+1)
ans=0
for x in l:
  ans=ans+r.count(x)
print(ans)

Fixed submission:
import collections
n=int(input())
a=list(map(int,input().split()))
l=[]
r=[]
for i in range(n):
  l.append(i+a[i]+1)
  r.append(i-a[i]+1)
cl=collections.Counter(l)
cr=collections.Counter(r)
ans=0
for k,v in cl.items():
  ans+=v*cr[k]
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
  s=i+a[i]
  for j in range(s+1,n):
    if j-s==a[j]:
      ans=ans+1
print(ans)

Fixed submission:
import collections
n=int(input())
a=list(map(int,input().split()))
l=[]
r=[]
for i in range(n):
  l.append(i+a[i]+1)
  r.append(i-a[i]+1)
cl=collections.Counter(l)
cr=collections.Counter(r)
ans=0
for k,v in cl.items():
  ans+=v*cr[k]
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
  for j in range(i+1,n):
    if j-i==a[i]+a[j]:
      ans=ans+1
print(ans)

Fixed submission:
import collections
n=int(input())
a=list(map(int,input().split()))
l=[]
r=[]
for i in range(n):
  l.append(i+a[i]+1)
  r.append(i-a[i]+1)
cl=collections.Counter(l)
cr=collections.Counter(r)
ans=0
for k,v in cl.items():
  ans+=v*cr[k]
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
list=[]
for i in range(n):
  s=input()
  if s not in list:
    list.append(s)
print(len(list))

Fixed submission:
n=int(input())
s=[input() for i in range(n)]
s.sort()
d=0
for i in range(n-1):
    if s[i+1]==s[i]:
        d=d+1
print(n-d)
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
x=list(s)
y=[int(i) for i in x]
ans=0
for i in range(len(s)-3):
  for j in range(i+4,len(s)+1):
    if sum(y[i:j])%3==0:
      t=int(s[i:j])
      if t%673==0:
        ans=ans+1
print(ans)

Fixed submission:
s=input()
n=len(s)
t=[0]*2019
t[0]=1
d=1
tkk=0
for k in reversed(range(n)):
  tk=tkk+int(s[k])*d
  tk=tk%2019
  t[tk]=t[tk]+1
  tkk=tk
  d=d*10
  d=d%2019
ans=0
for i in t:
  ans=ans+i*(i-1)//2
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s=input()
ans=0
for i in range(len(s)-3):
    for j in range(i+4,len(s)+1):
        x=int(s[i:j])
        if x%2019==0:
            ans=ans+1
print(ans)

Fixed submission:
s=input()
n=len(s)
t=[0]*2019
t[0]=1
d=1
tkk=0
for k in reversed(range(n)):
  tk=tkk+int(s[k])*d
  tk=tk%2019
  t[tk]=t[tk]+1
  tkk=tk
  d=d*10
  d=d%2019
ans=0
for i in t:
  ans=ans+i*(i-1)//2
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
buka=[0]*n
for i in a:
  s[i]=s[i]+1
for i in buka:
  print(i)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
buka=[0]*n
for i in a:
  buka[i-1]=buka[i-1]+1
for i in buka:
  print(i)
Buggy python submission (verdict: Runtime Error):
n=int(input())
if 7 in n:
  print('Yes')
else:
  print('No')

Fixed submission:
n=input()
if "7" in n:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
a=[]
b=[]
for i in range(input()):
    if i%3!=0 and i%5!=0:
        a.append(i)
    else:
        b.append(i)
print(sum(a))

Fixed submission:
a=[]
for i in range(1,int(input())+1):
    if i%3!=0 and i%5!=0:
        a.append(i)
print(sum(a))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
sum=0
box=['RGB','RBG','GRB','GBR','BRG','BGR']
for k in range(n):
    for j in range(k):
        for i in range(j):
            if j-i!=k-j:
                word=s[k]+s[j]+s[i]
                if word in box:
                    sum=sum+1
print(sum)

Fixed submission:
n=int(input())
s=input()
sum=0
r=int(s.count('R'))
g=int(s.count('G'))
b=int(s.count('B'))
for k in range(n):
    for j in range(k):
        i=2*j-k
        if i+1>0:
            if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
                sum=sum+1
print(r*g*b-sum)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
s=input()
sum=0
for k in range(n):
    for j in range(k):
        if s[j]!=s[k]:
            for i in range(j):
                if i!=2*j-k:
                    if s[i]!=s[j] and s[k]!=s[i] and j-i!=k-j:
                        sum=sum+1
print(sum)

Fixed submission:
n=int(input())
s=input()
sum=0
r=int(s.count('R'))
g=int(s.count('G'))
b=int(s.count('B'))
for k in range(n):
    for j in range(k):
        i=2*j-k
        if i+1>0:
            if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
                sum=sum+1
print(r*g*b-sum)

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

Fixed submission:
n=int(input())
s=input()
sum=0
r=int(s.count('R'))
g=int(s.count('G'))
b=int(s.count('B'))
for k in range(n):
    for j in range(k):
        i=2*j-k
        if i+1>0:
            if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
                sum=sum+1
print(r*g*b-sum)

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

Fixed submission:
n=int(input())
s=input()
sum=0
r=int(s.count('R'))
g=int(s.count('G'))
b=int(s.count('B'))
for k in range(n):
    for j in range(k):
        i=2*j-k
        if i+1>0:
            if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
                sum=sum+1
print(r*g*b-sum)
Buggy python submission (verdict: Runtime Error):
s=input()
if s[2]=s[3] and s[4]=s[5]:
  print('Yes')
else:
  print('No')

Fixed submission:
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
s=input()
if s[3]=s[4] and s[5]=s[6]:
  print('Yes')
else:
  print('No')

Fixed submission:
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s=input()
n=len(s)
x=(n-1)//2
while i<x:
  if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:
    print('No')
    break 
  i=i+1
else:
  print('Yes')

Fixed submission:
s=input()
n=len(s)
x=(n-1)//2
v=0
for i in range(x):
  if s[i]==s[n-1-i]==s[x-1-i]:
    v=v+1
if v==x:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
s=input()
n=len(s)
x=(n-1)//2
while i in range(x):
  if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:
    print('No')
    break 
else:
  print('Yes')

Fixed submission:
s=input()
n=len(s)
x=(n-1)//2
v=0
for i in range(x):
  if s[i]==s[n-1-i]==s[x-1-i]:
    v=v+1
if v==x:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
  if d[0][a] and d[1][a] and d[2][a] in num:
    bingo=bingo+1
  elif d[a][0] and d[a][1] and d[a][1] in num:
    bingo=bingo+1
if d[1][1] and d[2][2] and d[3][3] in num:
  bingo=bingo+1
elif d[3][1] and d[2][2] and d[1][3] in num:
  bingo=bingo+1
if bingo>0:
  print('Yes')
else:
  print('No')

Fixed submission:
d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
  if d[0][a] in num and d[1][a] in num and d[2][a] in num:
    bingo=bingo+1
  if d[a][0] in num and d[a][1] in num and d[a][2] in num:
    bingo=bingo+1
if d[1][1] in num and d[2][2] in num and d[0][0] in num:
  bingo=bingo+1
if d[1][1] in num and d[0][2] in num and d[2][0] in num:
  bingo=bingo+1
if bingo>0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
n=int(input())
x=list(map(int,input().split()))
p=round(sum(x)/n)
m=[]
for i in x:
  m.append((i-m)**2)
print(sum(m))

Fixed submission:
n=int(input())
x=list(map(int,input().split()))
p=round(sum(x)/n)
m=[]
for i in x:
  m.append((i-p)**2)
print(sum(m))

Buggy python submission (verdict: Runtime Error):
n=int(input())
x=list(map(int,input().split()))
p=round(sum(x)/n)
m=[]
for i in x:
  m.append((x-m)**2)
print(sum(m))

Fixed submission:
n=int(input())
x=list(map(int,input().split()))
p=round(sum(x)/n)
m=[]
for i in x:
  m.append((i-p)**2)
print(sum(m))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
s=0
for i in a:
  if a%2==0:
    if a%3!=0 and a%5!=0:
      s=s+1
print('DENIED' if s>0 else 'APPROVED')

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
s=0
for i in a:
  if i%2==0:
    if i%3!=0 and i%5!=0:
      s=s+1
print('DENIED' if s>0 else 'APPROVED')
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
print('Yes' if n=m else 'No')

Fixed submission:
n,m=map(int,input().split())
print('Yes' if n==m else 'No')