Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
from copy import*
from collections import*
from numpy import*
from itertools import*
a,b=map(int,input().split())
*c,=map(int,input().split())
c1=deepcopy(c)
c2=deepcopy(c)

for i in range(1,a):
    c1[i]=min(c1[i-1],c1[i])
for i in range(a-1,0,-1):
    c2[i-1]=max(c2[i],c2[i-1])

#print(c1,c2)
d=array([k for k,v in groupby(c2)])-array([k for k,v in groupby(c1)])
#print(d)
#print(list(d).count(max(d)))

Fixed submission:
from copy import*
from numpy import*
a,b=map(int,input().split())
*c,=map(int,input().split())
c1=deepcopy(c)
c2=deepcopy(c)

for i in range(1,a):
    c1[i]=min(c1[i-1],c1[i])
for i in range(a-1,0,-1):
    c2[i-1]=max(c2[i],c2[i-1])

#print(c1,c2)
d=array(c2)-array(c1)
d2=array(c)-array(c1)
print(list(d2).count(max(d)))

Buggy python submission (verdict: Runtime Error):
from copy import*
from collections import*
from numpy import*
from itertools import*
a,b=map(int,input().split())
*c,=map(int,input().split())
c1=deepcopy(c)
c2=deepcopy(c)

for i in range(1,a):
    c1[i]=min(c1[i-1],c1[i])
for i in range(a-1,0,-1):
    c2[i-1]=max(c2[i],c2[i-1])

#print(c1,c2)
d=array([k for k,v in groupby(c2)])-array([k for k,v in groupby(c1)])
#print(d)
print(list(d).count(max(d)))

Fixed submission:
from copy import*
from numpy import*
a,b=map(int,input().split())
*c,=map(int,input().split())
c1=deepcopy(c)
c2=deepcopy(c)

for i in range(1,a):
    c1[i]=min(c1[i-1],c1[i])
for i in range(a-1,0,-1):
    c2[i-1]=max(c2[i],c2[i-1])

#print(c1,c2)
d=array(c2)-array(c1)
d2=array(c)-array(c1)
print(list(d2).count(max(d)))
Buggy python submission (verdict: Runtime Error):
input();s=input();t=input();print(2*len(s)-max([i for i in range(n+1)if s[-i:]==t[:i]]or[0]))

Fixed submission:
n=int(input())
s=input()
t=input()
l=0
m=max([i for i in range(n+1)if s[-i:]==t[:i]]or[0])
print(2*n-m)
Buggy python submission (verdict: Time Limit Exceeded):
s=input()
while True:
  if s.count("ST")==0:break
  s=s.replace("ST","")
print(len(s))


Fixed submission:
ans=0
stack=[]
for s in input():
    if len(stack)>0 and s=="T":
        if stack[-1]=="S":
            del stack[-1]
        else:
            stack.append(s)
    else:
        stack.append(s)
print(len(stack))
Buggy python submission (verdict: Runtime Error):
n=int(input());s=list(input());print(n-len(set(tuple(sorted((i+1,int(s[i*2]))))for i in range(n))))


Fixed submission:
n=int(input());s=input().split();print(n-len(set(tuple(sorted([i+1,int(s[i])]))for i in range(n))))
Buggy python submission (verdict: Runtime Error):
d={c:list(input()) for c in "abc"}
s="a"
while d[s]:
  s=d[s].pop(0)
print(s.upper())

Fixed submission:
import collections
a=list(input())
d=collections.defaultdict(str)
for s in a:
    if s not in d:
        d[s]=1
    else:
        d[s]+=1
c=0
for t in dict(d).values():
    if t%2!=0:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Runtime Error):
import collections as c
n,a=map(int,input().split())
X=[int(x)-a for x in input().split()]
C=c.Counter([0])
for x in X:
  itiji=Counter()
  for i,c in C.items():
    itiji[i+x]+=c
  C+=itiji
print(C[0]-1)

Fixed submission:
import collections as co
n,a=map(int,input().split())
X=[int(x)-a for x in input().split()]
C=co.Counter([0])
for x in X:
  itiji=co.Counter()
  for i,c in C.items():
    itiji[i+x]+=c
  C+=itiji
print(C[0]-1)
Buggy python submission (verdict: Runtime Error):
s=set(input())
if len(s)%2==0:
  if s==set("SN") or s==set("WE"):
    print("Yes")
else:
    print("No")
else:
  print("No")

Fixed submission:
s=set(input())
if len(s)%2==0:
  if s==set("SN") or s==set("WE") or s==set("SENW"):
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix

from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！

def main():
    n,*a=map(int,open(0).read().split())
#    print(a)
    while 1:
        flag=0
        for i in range(n-2):
            if a[i]>a[i+2]:
                a[i],a[i+2]=a[i+2],a[i]
                flag=1
        if not flag:
            break
#    print(a)
    ans=0
    while 1:
        flag=0
        for i in range(n-1):
            if a[i]>a[i+1]:
                a[i],a[i+1]=a[i+1],a[i]
                flag=1
                ans+=1
        if not flag:
            break
#    print(a)
    print(ans)
    
if __name__ == '__main__':
    main()

Fixed submission:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix

from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！

def main():
    n,*a=map(int,open(0).read().split())
    b=set(a[::2])
    c=set(sorted(a)[::2])
    print(len(b^c)//2)
if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
print(sum(range(int(input()+1))))

Fixed submission:
N=int(input())
k=0
for s in range(1,N+1):
    k+=s
print(k)
Buggy python submission (verdict: Time Limit Exceeded):
import operator as o
import functools as f
a,b=map(int,input().split())
c=f.reduce(o.mul,range(a,b+1))
if c>0:
  print("Positive")
elif c<0:
  print("Negative")
else:
  print("Zero")

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

if a>0:
  print("Positive")
elif 0 in range(a,b+1):
  print("Zero")
else:
  if (b-a)%2==0:
    print("Negative")
  else:
    print("Positive")
Buggy python submission (verdict: Runtime Error):
n,_=input().split();s={*input()};n=int(n);print(n+[len(s&set(str(b)))for b in range(n,99999)].index(0))

Fixed submission:
s=set(range(10))
n,k,*a=map(int,open(0).read().split())
a=s-set(a) #使っていい数字
for t in range(n,100000):
    if set(list(map(int,list(str(t)))))<=a:
        print(t)
        break
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
A=[]
B=list(map(int,input().split()))
for t in range(10):
     if t not in B:
         A.append(t)
A=set(list(map(str,A)))
for s in range(n,10001):
    if set(list(str(s)))<=A:
        print(s)
        exit()

Fixed submission:
n,m=map(int,input().split())
A=sorted([input() for s in range(n)])
print("".join(A))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
A = list(map(int, input().split()))

sum = 0
for i in m:
  sum += A[i]

ans = n - sum
if ans >= 0:
  print(ans)
else:
  print(-1)

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

sum = 0
for i in range(m):
  sum += A[i]

ans = n - sum
if ans >= 0:
  print(ans)
else:
  print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = list(map(int, input().split()))
for i in range(1,n+1):
  x = A.count(i)
  i += x
  print(x)


Fixed submission:
import collections

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

c = collections.Counter(A)

for i in range(1,n+1):
  print(c[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:
import collections

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

c = collections.Counter(A)

for i in range(1,n+1):
  print(c[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:
import collections

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

c = collections.Counter(A)

for i in range(1,n+1):
  print(c[i])

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(int, input().sprit()))
for i in range(1,n):
  print(A.count(i))

Fixed submission:
import collections

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

c = collections.Counter(A)

for i in range(1,n+1):
  print(c[i])
Buggy python submission (verdict: Runtime Error):
import math

def lcm(x, y):
    return (x*y)//math.gcd(x,y)

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

print(lcm(A,B))


Fixed submission:
from fractions import gcd

def lcm(x, y):
    return (x*y)//gcd(x,y)

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

print(lcm(A,B))
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

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

cnt = 0
n = 1
i = 0

while(True):
    if a[i] != n:
        a.pop(i)
        cnt += 1
    else:
        n += 1
        i += 1

    if len(a) == 0:
        print(-1)
        exit()

    if i >= len(a):
        break

print(cnt)


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

cnt = 0
n = 1

for i in range(N):
    if a[i] == n:
        n += 1
    else:
        cnt += 1

if cnt == N:
    print(-1)
    exit()

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

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

cnt = 0
n = 1
i = 0

while(True):
    if a[i] != n:
        a.pop(i)
        cnt += 1
    else:
        n += 1
        i += 1

    if len(a) == 0:
        print(-1)
        exit()

    if i >= len(a):
        break

print(cnt)


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

cnt = 0
n = 1

for i in range(N):
    if a[i] == n:
        n += 1
    else:
        cnt += 1

if cnt == N:
    print(-1)
    exit()

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a*b // gcd(a,b)

def divisor(n):
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

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

g = divisor(gcd(A,B))
#g.sort()

cnt = 0
for i in g:
    if len(divisor(i)) <= 2:
        cnt += 1

print(cnt)


Fixed submission:
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

def lcm(a, b):
    return a*b // gcd(a,b)

def divisor(n):
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

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

g = divisor(gcd(A,B))
#g.sort()

cnt = 0
for i in g:
    if len(divisor(i)) <= 2:
        cnt += 1

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

if N <= 1:
    print("0")
    exit()

cnt = 0
for i in range(2,N+1):
    cnt += (i-1)

print(cnt)


Fixed submission:
N = int(input())
print((N-1)*(N)//2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

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

for i in range(n):
    t = a.pop(i)
    print(max(a))
    a.insert(i, t)
    



Fixed submission:
n = int(input())

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

max_value = max(a)
max_value_index = a.index(max(a))

a.pop(max_value_index)
second_max_value = max(a)
a.insert(max_value_index,max_value)

#print("======")
#print(max_value)
#print(max_value_index)
#print(second_max_value)
#print("======")

for i in a:
    if i != max_value:
        print(max_value)
    else:
        print(second_max_value)

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

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

for i in range(n):
    t = a.pop(i)
    print(max(a))
    a.insert(i, t)
    



Fixed submission:
n = int(input())

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

max_value = max(a)
max_value_index = a.index(max(a))

a.pop(max_value_index)
second_max_value = max(a)
a.insert(max_value_index,max_value)

#print("======")
#print(max_value)
#print(max_value_index)
#print(second_max_value)
#print("======")

for i in a:
    if i != max_value:
        print(max_value)
    else:
        print(second_max_value)
Buggy python submission (verdict: Time Limit Exceeded):
l,r = map(int,input().split())

a = []
#r = min(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))
        


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))

Buggy python submission (verdict: Time Limit Exceeded):
l,r = map(int,input().split())

a = []
for i in range(l,r):
    for j in range(i+1,r+1):
        a.append(i*j%2019)

print(min(a))
        


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))

Buggy python submission (verdict: Runtime Error):
from itertools import combinations
l,r = map(int,input().split())

sc = list(combinations(range(l%2019,(r+1)%2019),2))

print(min([s[0]*s[1] for s in sc]))


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))

Buggy python submission (verdict: Runtime Error):
import itertools
l,r = map(int,input().split())

sc = list(itertools.combinations(range(l%2019,(r+1)%2019),2))

print(min([s[0]*s[1] for s in sc]))


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
l,r = map(int,input().split())

sc = list(itertools.combinations(range(l,r+1),2))

print(min([s[0]*s[1]%2019 for s in sc]))


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))

Buggy python submission (verdict: Runtime Error):
import itertools
l,r = map(int,input().split())

sc = list(itertools.combinations(range(l,r+1),2))

print(min([s[0]*s[1]%2019 for s in sc]))


Fixed submission:
l,r = map(int,input().split())

a = []
r = min(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))
Buggy python submission (verdict: Runtime Error):
w,h,x,y = map(int,input().split())

if w//2 == x and h//y == 2:
    print(w*h/2,"1")
else:
    print(w*h/2,"0")



Fixed submission:
w,h,x,y = map(int,input().split())

if w/2 == x and h/y == 2:
    print(w*h/2,"1")
else:
    print(w*h/2,"0")
Buggy python submission (verdict: Runtime Error):
s = list(input())

cnt = []
c = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i =="T":
        c += 1
    else:
        cnt.append(c)
        c = 0

print(max(cnt))


Fixed submission:
s = list(input())

cnt = []
c = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        c += 1
    else:
        cnt.append(c)
        c = 0
cnt.append(c)

print(max(cnt))

Buggy python submission (verdict: Runtime Error):
s = list(input())

cnt = []
c = 0
for i in s:
    print(i)
    if i == "A" or i == "C" or i == "G" or i =="T":
        c += 1
    else:
        cnt.append(c)
        c = 0

print(max(cnt))


Fixed submission:
s = list(input())

cnt = []
c = 0
for i in s:
    if i == "A" or i == "C" or i == "G" or i == "T":
        c += 1
    else:
        cnt.append(c)
        c = 0
cnt.append(c)

print(max(cnt))
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

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

y = [0] * N
for i in range(N):
    y[i] = abs(X-x[i])

print(gcd_list(y))


Fixed submission:
import fractions

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

y = [0] * N
for i in range(N):
    y[i] = abs(X-x[i])

ans = y[0]
for i in range(1,N):
    ans = fractions.gcd(ans,y[i])
print(ans)
Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce

def lcm_base(x, y):
    return (x * y) // math.gcd(x,y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

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

j = lcm_list(a)

cnt = 0
for i in a:
    cnt += (j-1)%i

print(cnt)


Fixed submission:
import fractions

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

ans = a[0]
for i in range(1,N):
    ans = ans * a[i] // fractions.gcd(ans, a[i])

cnt = 0
for i in a:
    cnt += (ans-1)%i

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())

cnt = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x+y+z == s:
                cnt += 1

print(cnt)


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

cnt = 0
for x in range(k+1):
    for y in range(k+1):
        if 0 <= s-x-y <=k:
            cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
a, b, c, d = map(int,input().split())
    while True:
    c -= b
    if c <= 0:
        print("Yes")
        break

    a -= d
    if a <= 0:
        print("No")
        break

Fixed submission:
a, b, c, d = map(int,input().split())
while True:
    c -= b
    if c <= 0:
        print("Yes")
        break

    a -= d
    if a <= 0:
        print("No")
        break

Buggy python submission (verdict: Runtime Error):
a,b,c,d == map(int,input().split())
if a % d = 0:
    e = a / d
else:
    e = a / d + 1

if c % d == 0:
    f = c / b
else:
    f = a / d + 1
    
if e > f:
    print("Yes")
elif e == f:
    print("Yes")
else:
    print("No")

Fixed submission:
a, b, c, d = map(int,input().split())
while True:
    c -= b
    if c <= 0:
        print("Yes")
        break

    a -= d
    if a <= 0:
        print("No")
        break
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = []
cnt = 0
append = A.append
for i in range(n):
    m = input()
    if m in A:
        pass
    else:
        append(m)
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)

Buggy python submission (verdict: Runtime Error):
n = int(input())
A = []
cnt = 0
for i in xrange(n):
    m = input()
    if m not in A:
        A.append(m)
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = []
cnt = 0
for i in range(n):
    m = input()
    if m not in A:
        A.append(m)
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = []
cnt = 0
for i in range(n):
    m = input()
    if m not in A:
        A.append(m)
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
A = []
cnt = 0
for i in range(n):
    m = input()
    if m in A:
        pass
    else:
        A.append(m)
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = list(input())	
[print(li.count(str(i + 1))) for i in range(n)]

Fixed submission:
import collections

N = int(input())
A = list(map(int,input().split()))
c = collections.Counter(A)

for i in range(1, N + 1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = list(input())	
[print(li.count(str(i + 1))) for i in range(n)]

Fixed submission:
import collections

N = int(input())
A = list(map(int,input().split()))
c = collections.Counter(A)

for i in range(1, N + 1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
li = list(map(int,input().split()))	
for i in range(n):
    print(li.count(i + 1))

Fixed submission:
import collections

N = int(input())
A = list(map(int,input().split()))
c = collections.Counter(A)

for i in range(1, N + 1):
  print(c[i])

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(input())
for i in range(1,n+1):
    print(s.count(str(i)))

Fixed submission:
import collections

N = int(input())
A = list(map(int,input().split()))
c = collections.Counter(A)

for i in range(1, N + 1):
  print(c[i])
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
li = list(map(int,input().split()))	
cnt = 0
for i in range(len(li)):
    if li[i] >= sum(li) / (4*y)):
        cnt += 1
else:
    pass

if cnt >= y:
    print("Yes")
else:
    print("No")    
        

Fixed submission:
x,y = map(int,input().split())
li = list(map(int,input().split()))	
cnt = 0
for i in range(len(li)):
    if li[i] >= sum(li) / (4*y):
        cnt += 1
else:
    pass

if cnt >= y:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
li = [list(map(int,input().split())) for i in range(3)]
n = int(input())
cnt = 0
for i in range(2):
    for j in range(2):
        for k in int(input()):
            if li[i][j] == k:
                li[i][j] == -1
            else:
                pass

for a in range(2):
    if li[a][0] == li[a][1] == li[a][2] == -1:
        print("Yes")
        sys.exit()
    else:
        pass
for b in range(2):
    if li[0][[b] == li[1][[b] == li[2][[b] == -1:
        print("Yes")
        sys.exit()
    else:
        pass
if li[0][[0] == li[1][[1] == li[2][[2] == -1:
    print("Yes")
    sys.exit()
else:
    pass
if li[0][[2] == li[1][[1] == li[2][[0] == -1:
    print("Yes")
    sys.exit()
else:
    print("No")

Fixed submission:
import sys
li = [list(map(int,input().split())) for i in range(3)]
n = int(input())
k = [int(input()) for i in range(n)]
cnt = 0
for i in range(3):
    for j in range(3):
        if li[i][j] in k:
            li[i][j] = -1
        else:
            pass
for a in range(3):
    if li[a][0] == li[a][1] == li[a][2] == -1:
        print("Yes")
        exit()
    else:
        pass
for b in range(3):
    if li[0][b] == li[1][b] == li[2][b] == -1:
        print("Yes")
        exit()
    else:
        pass
if li[0][0] == li[1][1] == li[2][2] == -1:
    print("Yes")
    exit()

elif li[0][2] == li[1][1] == li[2][0] == -1:
    print("Yes")
    exit()
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
lie = input()
li = list(lie)
cnt = 0
for i in range(len(li)):
    if li[i] == "A" and li[i+1] == "B" and li[i+2] == "C":
        cnt += 1
    else:
        pass
print(cnt)

Fixed submission:
n = int(input())
lie = input()
li = list(lie)
cnt = 0
for i in range(len(li) - 2):
    if li[i] == "A" and li[i+1] == "B" and li[i+2] == "C":
        cnt += 1
    else:
        pass
print(cnt)