Problem:


Score : 200 points

Problem Statement

We have a bingo card with a 3\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.

The MC will choose N numbers, b_1, b_2, \cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.

Determine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.

Constraints

All values in input are integers.

1 \leq A_{i, j} \leq 100

A_{i_1, j_1} \neq A_{i_2, j_2} ((i_1, j_1) \neq (i_2, j_2))

1 \leq N \leq 10

1 \leq b_i \leq 100

b_i \neq b_j (i \neq j)

Input

Input is given from Standard Input in the following format:

A_{1, 1} A_{1, 2} A_{1, 3}
A_{2, 1} A_{2, 2} A_{2, 3}
A_{3, 1} A_{3, 2} A_{3, 3}
N
b_1
\vdots
b_N

Output

If we will have a bingo, print Yes; otherwise, print No.

Sample Input 1

84 97 66
79 89 11
61 59 7
7
89
7
87
79
24
84
30

Sample Output 1

Yes

We will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.

Sample Input 2

41 7 46
26 89 2
78 92 8
5
6
45
16
57
17

Sample Output 2

No

We will mark nothing.

Sample Input 3

60 88 34
92 41 43
65 73 48
10
60
43
88
11
48
73
65
41
92
34

Sample Output 3

Yes

We will mark all the squares.



Sample input:
84 97 66
79 89 11
61 59 7
7
89
7
87
79
24
84
30


Sample output:
Yes

Submission status: Accepted

Solution code:
a = []
for i in range(3):
    a.append(map(int,raw_input().split()))
n = input()
for j in range(n):
    b = input()
    for j in range(3):
        for k in range(3):
            if a[j][k] == b:
                a[j][k] = 0

diag1 = [a[0][0],a[1][1],a[2][2]]
diag2 = [a[0][2],a[1][1],a[2][0]]
res = 'No'
if sum(diag1) ==0 or sum(diag2) ==0:
    res ='Yes'

rowsum = [sum(a[i]) for i in range(3) ]
if 0 in rowsum:
    res = 'Yes'

colSum = [sum([a[j][i] for j in range(3)]) for i in range(3)]
if 0 in colSum:
    res = 'Yes'

print res

Submission status: Accepted

Solution code:
A1=list(map(int,input().split()))
A2=list(map(int,input().split()))
A3=list(map(int,input().split()))
N=int(input())

i = 0
for i in range(N):
    b = int(input())
    j = 0
    while j<3:
        if A1[j]==b:
            A1[j]=-1
        j+=1
    j = 0
    while j<3:
        if A2[j]==b:
            A2[j]=-1
        j+=1
    j = 0
    while j<3:
        if A3[j]==b:
            A3[j]=-1
        j+=1


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

Submission status: Accepted

Solution code:
A= []
for i in range(3):
    array = list(map(int, input().strip().split()))
    A.append(array)
n=int(input())
b = []
for _ in range(n):
    b.append(int(input()))
ans="No"
for i in range(3):
    count=0
    for j in range(3):
        for k in range(n):
            if A[i][j]==b[k]:
                count=count+1
    if count==3:
        ans='Yes'
    
for i in range(3):
    count=0
    for j in range(3):
        for k in range(n):
            if A[j][i]==b[k]:
                count=count+1
    if count==3:
        ans='Yes'

count=0
for i in range(3):
        for k in range(n):
            if A[i][i]==b[k]:
               count=count+1
if count==3:
    ans='Yes'
count=0
for i in range(3):
        for k in range(n):
            if A[i][2-i]==b[k]:
                count=count+1
if count==3:
    ans='Yes'
print(ans)

Submission status: Accepted

Solution code:
A=[list(map(int,input().split())) for _ in range(3)]
N=int(input())
B=[int(input()) for _ in range(N)]

c=[[0]*3 for _ in range(3)]
for b in B:
  for i in range(3):
    for j in range(3):
      if A[i][j]==b:
        c[i][j]=1

for i in range(3):
  if c[i][0] and c[i][1] and c[i][2]:
    print('Yes')
    exit()
  if c[0][i] and c[1][i] and c[2][i]:
    print('Yes')
    exit()
    
    
if c[0][0] and c[1][1] and c[2][2]:
  print('Yes')
  exit()
if c[0][2] and c[1][1] and c[2][0]:
  print('Yes')
  exit()

print('No')

Submission status: Accepted

Solution code:
l=[list(input().split()) for i in range(3)]
n=int(input())
li=[input() for i in range(n)]
if l[0][0] in li and l[0][1] in li and l[0][2] in li:
    print('Yes')
elif l[1][0] in li and l[1][1] in li and l[1][2] in li:
    print('Yes')
elif l[2][0] in li and l[2][1] in li and l[2][2] in li:
    print('Yes')
elif l[0][0] in li and l[1][0] in li and l[2][0] in li:
    print('Yes')
elif l[0][1] in li and l[1][1] in li and l[2][1] in li:
    print('Yes')
elif l[0][2] in li and l[1][2] in li and l[2][2] in li:
    print('Yes')
elif l[0][0] in li and l[1][1] in li and l[2][2] in li:
    print('Yes')
elif l[0][2] in li and l[1][1] in li and l[2][0] in li:
    print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for i in range(N)]

for i in range(N):
  for j in range(3):
    for k in range(3):
      if A[j][k]==b[i]:
        A[j][k] = 0

if A[1][1]==0 and A[0][0]==0 and A[2][2]==0 or A[1][1]==0 and A[2][0]==0 and A[0][2]==0 or A[1][1]==0 and A[0][1]==0 and A[2][1]==0 or A[1][1]==0 and A[1][0]==0 and A[1][2]==0 or A[0][0]==0 and A[0][1]==0 and A[0][2]==0 or A[0][0]==0 and A[1][0]==0 and A[2][0]==0 or A[2][2]==0 and A[0][2]==0 and A[1][2]==0 or A[2][2]==0 and A[2][0]==0 and A[2][1]==0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

#B = list(map(int,input().split()))
A=[]
for i in range(3):
    a=list(map(int,input().split()))
    A.append(a)
N = int(input())
b=[]
for i in range(N):
    B=int(input())
    b.append(B)

Sheet=[[0,0,0],[0,0,0],[0,0,0]]

for i in range(3):
    for j in range(3):
        if A[i][j] in b:
            Sheet[i][j]+=1

if Sheet[0][0]==Sheet[1][0]==Sheet[2][0]==1 or Sheet[0][1]==Sheet[1][1]==Sheet[2][1]==1 or Sheet[0][2]==Sheet[1][2]==Sheet[2][2]==1 or Sheet[0][0]==Sheet[0][1]==Sheet[0][2]==1 or  Sheet[1][0]==Sheet[1][1]==Sheet[1][2]==1 or  Sheet[2][0]==Sheet[2][1]==Sheet[2][2]==1 or  Sheet[0][0]==Sheet[1][1]==Sheet[2][2]==1 or  Sheet[0][2]==Sheet[1][1]==Sheet[2][0]==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
  for j in range(3):
    for k in range(n):
      if a[i][j] == b[k]:
        a[i][j] = 0
ans = 'No'
for i in range(3):
  if a[i][0]+a[i][1]+a[i][2] == 0:
    ans = 'Yes'
  if a[0][i]+a[1][i]+a[2][i] == 0:
    ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
  ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
a = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in range(3):
    for j in range(3):
      for k in range(n):
        if a[i][j] == b[k]:
            a[i][j] = 0
ans = 'No'
for i in range(3):
    if a[i][0]+a[i][1]+a[i][2] == 0:
        ans = 'Yes'
    if a[0][i]+a[1][i]+a[2][i] == 0:
        ans = 'Yes'
if a[0][0]+a[1][1]+a[2][2] == 0 or a[2][0]+a[1][1]+a[0][2] == 0:
    ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
import numpy as np

A = np.array(list(list(map(int, input().split())) for l in range(3)))
N = int(input())
b = np.array(list(int(input()) for l in range(N)))
bingo = np.zeros((3, 3))
bingo = bingo == 1

for b_i in b:
    hantei = A == b_i
    bingo = np.logical_or(bingo, hantei)

for i in range(3):
    if all(bingo[i]) or all(bingo[:,i]):
        print('Yes')
        exit()

if (bingo[0,0] and bingo[1,1] and bingo[2,2]) or (bingo[0,2] and bingo[1,1] and bingo[2,0]):
    print('Yes')
    exit()

print('No')

Submission status: Accepted

Solution code:
a11, a12, a13 = map(int, input().split())
a21, a22, a23 = map(int, input().split())
a31, a32, a33 = map(int, input().split())
n = int(input())
b = []
for i in range(n):
    b.append(int(input()))

ans = [[a11, a12, a13], [a21, a22, a23], [a31, a32, a33],
       [a11, a21, a31], [a12, a22, a32], [a13, a23, a33],
       [a11, a22, a33], [a13, a22, a31]]

for a in ans:
    if (a[0] in b) and (a[1] in b) and (a[2] in b):
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
A=[[int(x) for x in input().split()]for i in range(3)]
N = int(input())
b = []
for i in range(N):
    b.append(int(input()))
 
for i in range(3):
    if A[i][0] in b and A[i][1] in b and A[i][2] in b:
        print('Yes')
        exit()
for i in range(3):
    if A[0][i] in b and A[1][i] in b and A[2][i] in b:
        print('Yes')
        exit()
if A[0][0] in b and A[1][1] in b and A[2][2] in b:
    print('Yes')
    exit()
if A[2][0] in b and A[1][1] in b and A[0][2] in b:
    print('Yes')
    exit() 
print('No')

Submission status: Accepted

Solution code:
import sys

A = [[0] * 3 for i in range(3)]

A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))

N = int(input())
for _ in range(N):
    b = int(input())
    if b in A1:
        for a in [i for i, x in enumerate(A1) if x == b]:
            A[0][a] = 1
    if b in A2:
        for a in [i for i, x in enumerate(A2) if x == b]:
            A[1][a] = 1
    if b in A3:
        for a in [i for i, x in enumerate(A3) if x == b]:
            A[2][a] = 1

for i in range(3):
    if sum(A[i][:]) == 3:
        print('Yes')
        sys.exit()

if A[0][0] == 1 and A[1][0] == 1 and A[2][0] == 1:
    print('Yes')
    sys.exit()
if A[0][1] == 1 and A[1][1] == 1 and A[2][1] == 1:
    print('Yes')
    sys.exit()
if A[0][2] == 1 and A[1][2] == 1 and A[2][2] == 1:
    print('Yes')
    sys.exit()

if A[0][0] == 1 and A[1][1] == 1 and A[2][2] == 1:
    print('Yes')
    sys.exit()

if A[0][2] == 1 and A[1][1] == 1 and A[2][0] == 1:
    print('Yes')
    sys.exit()

print('No')

Submission status: Accepted

Solution code:
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))

al = a1+a2+a3
n =int(input())

for i in range(n):
    b = int(input())
    if b in al:
        al[al.index(b)] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or al[0] + al[3] + al[6] == 0 or al[1] + al[4] + al[7] == 0 or al[2] + al[5] + al[8] == 0 or al[0] + al[4] + al[8] == 0 or al[2] + al[4] + al[6] == 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys

def check(x):
  if(x[0] == 0 and x[1] == 0 and x[2] == 0):
    return 1
  else:
    return 0

def main():
  a1 = list(map(int, input().split()))
  a2 = list(map(int, input().split()))
  a3 = list(map(int, input().split()))
  num = int(input())
  a9 = a1 + a2 + a3
  x = 0
  z = [int(input()) for i in range(num)]
  for i in z:
    for k, name in enumerate(a9):
      if(i == name):
        a9[k] = 0
  a1 = []
  a2 = []
  a3 = []
  a4 = []
  a5 = []
  a6 = []
  a7 = []
  a8 = []  
  a1.extend([a9[0],a9[1],a9[2]])
  a2.extend([a9[3],a9[4],a9[5]])
  a3.extend([a9[6],a9[7],a9[8]])
  a4.extend([a9[0],a9[3],a9[6]])
  a5.extend([a9[1],a9[4],a9[7]])
  a6.extend([a9[2],a9[5],a9[8]])
  a7.extend([a9[0],a9[4],a9[8]])
  a8.extend([a9[2],a9[4],a9[6]])

  check_list = []
  check_list.append(check(a1))
  check_list.append(check(a2))
  check_list.append(check(a3))
  check_list.append(check(a4))
  check_list.append(check(a5))
  check_list.append(check(a6))
  check_list.append(check(a7))
  check_list.append(check(a8))

  for i in check_list:
    if(i == 1):
      print('Yes')
      x = 1
      sys.exit()
   
  if(x == 0):
    print('No')

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

bingo = []
for i in range(3):
	bingo.append(rl())
N = ri()
B = []
for i in range(N):
	B.append(ri())

h = {}
for i in range(3):
	for j in range(3):
		n = bingo[i][j]
		h[n] = (i,j)
for b in B:
	if b not in h:
		continue
	i, j = h[b]
	bingo[i][j] = 0

def check(b):
	for i in range(3):
		bs = [1 for j in range(3) if b[i][j] == 0]
		if len(bs) == 3:
			return True
	for j in range(3):
		bs = [1 for i in range(3) if b[i][j] == 0]
		if len(bs) == 3:
			return True
	bs = [b[0][0],b[1][1],b[2][2]]
	bs = [1 for v in bs if v == 0]
	if len(bs) == 3:
		return True
	bs = [b[0][2],b[1][1],b[2][0]]
	bs = [1 for v in bs if v == 0]
	if len(bs) == 3:
		return True
	return False

if check(bingo):
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
A=[]
for _ in range(3):
    x=list(int(i) for i in input().split())
    A.append(x)
M=[[0 for i in range(3)]for j in range(3)]
n=int(input())

for _ in range(n):
    p=int(input())
    for i in range(3):
        for j in range(3):
            if A[i][j]==p:
                M[i][j]=1
                break
bool=False
for i in range(3):
    if bool is False:
        sum=0
        for j in range(3):
            sum+=M[i][j]
        if sum==3:
            bool=True
for i in range(3):
    if bool is False:
        sum=0
        for j in range(3):
            sum+=M[j][i]
        if sum==3:
            bool=True
if (M[0][0]+M[1][1]+M[2][2])==3:
    bool=True
if (M[0][2]+M[1][1]+M[2][0])==3:
    bool =True
if bool:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
p1=list(map(int,input().split()))
p2=list(map(int,input().split()))
p3=list(map(int,input().split()))
p=p1+p2+p3
n=int(input())
for _ in range(n):
    b=int(input())
    if b in p:
        p[p.index(b)]=0
if p[0]+p[1]+p[2]==0 or p[3]+p[4]+p[5]==0 or p[6]+p[7]+p[8]==0 or p[0]+p[3]+p[6]==0 or p[1]+p[4]+p[7]==0 or p[2]+p[5]+p[8]==0 or p[0]+p[4]+p[8]==0 or p[2]+p[4]+p[6]==0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(list(map(int,input().split())) for i in range(3))
n = int(input())
b = [int(input()) for x in range(n)]
d = [[0 for i in range(3)] for j in range(3)]
ans = "No"
for x in range(n):
    for i in range(3):
        for j in range(3):
            if a[i][j] == b[x]:
                d[i][j] = 1
for i in range(3):
    c = 0
    for j in range(3):
        c+=d[i][j]
    if c == 3:
        ans = "Yes"
for i in range(3):
    c = 0
    for j in range(3):
        c+=d[j][i]
    if c == 3:
        ans = "Yes"
c = 0
for j in range(3):
    c+=d[j][j]
if c == 3:
    ans = "Yes"
c = 0
for j in range(3):
    c+=d[j][2-j]
if c == 3:
    ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
a = list(list(map(int,input().split())) for i in range(3))
n = int(input())
b = [int(input()) for x in range(n)]
d = [[0 for i in range(3)] for j in range(3)]
ans = "No"
for x in range(n):
    for i in range(3):
        for j in range(3):
            if a[i][j] == b[x]:
                d[i][j] = 1
for i in range(3):
    c = 0
    for j in range(3):
        c+=d[i][j]
    if c == 3:
        ans = "Yes"
for i in range(3):
    c = 0
    for j in range(3):
        c+=d[j][i]
    if c == 3:
        ans = "Yes"
c = 0
for j in range(3):
    c+=d[j][j]
    if c == 3:
        ans = "Yes"
        c = 0
for j in range(3):
    c+=d[j][2-j]
    if c == 3:
        ans = "Yes"
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import math

sht = [[0,0,0] for _ in range(3)]

a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())

for i in range(n):
    b=int(input())
    for j in range(3):
        if a[j].count(b)>0:
            sht[j][a[j].index(b)]=1

ans="No"

for i in range(3):
    if sht[i][0]==sht[i][1]==sht[i][2]==1:
        ans="Yes"
    elif sht[0][i]==sht[1][i]==sht[2][i]==1:
        ans="Yes"
if sht[0][0]==sht[1][1]==sht[2][2]==1:
    ans="Yes"
elif sht[0][2]==sht[1][1]==sht[2][0]==1:
    ans="Yes"

print(ans)

Submission status: Accepted

Solution code:
Bingo=[]
Bingo.append(list(map(int, input().split())))
Bingo.append(list(map(int, input().split())))
Bingo.append(list(map(int, input().split())))
N=int(input())
Num=[]
for i in range(N):
    Num.append(int(input()))
    
ans="No"
for i in range(3):
    if Bingo[i][0] in Num and Bingo[i][1] in Num and Bingo[i][2] in Num:
        ans="Yes"
for i in range(3):
    if Bingo[0][i] in Num and Bingo[1][i] in Num and Bingo[2][i] in Num:
        ans="Yes"

if Bingo[1][0] in Num and Bingo[1][1] in Num and Bingo[2][2] in Num:
    ans="Yes"
    
if Bingo[0][2] in Num and Bingo[1][1] in Num and Bingo[2][0] in Num:
    ans="Yes"

print(ans)

Submission status: Accepted

Solution code:
card=[] 
for i in range(3):
  card+=list(map(int,input().split()))
n=int(input())
bingo=[0]*9
for i in range(n):
  s=int(input())
  if s in card:
    bingo[card.index(s)]=1
if bingo[0] == 1:
  if (bingo[1] == 1 and bingo[2] == 1) or (bingo[3] == 1 and bingo[6] == 1) or (bingo[4] == 1 and bingo[8] == 1):
    print("Yes")
    exit()
if bingo[2] == 1:
  if (bingo[4] == 1 and bingo[6] == 1) or (bingo[5] == 1 and bingo[8] == 1):
    print("Yes")
    exit()
if (bingo[1] == 1 and bingo[4] == 1 and bingo[7] == 1) or (bingo[3] == 1 and bingo[4] == 1 and bingo[5] == 1) or (bingo[6] == 1 and bingo[7] == 1 and bingo[8] == 1):
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
K=[['x','x','x'],
   ['x','x','x'],
   ['x','x','x']]
a,b,c=map(int,input().split())
d,e,f=map(int,input().split())
g,h,j=map(int,input().split())
N=int(input())
B=[]
for _ in range(N):
    B.append(int(input()))

for i in range(N):
  if B[i]==a:
    K[0][0]='o'
  if B[i]==b:
    K[0][1]='o'
  if B[i]==c:
    K[0][2]='o'
  if B[i]==d:
    K[1][0]='o'
  if B[i]==e:
    K[1][1]='o'
  if B[i]==f:
    K[1][2]='o'
  if B[i]==g:
    K[2][0]='o'
  if B[i]==h:
    K[2][1]='o'
  if B[i]==j:
    K[2][2]='o'

if K[0][0]==K[0][1]==K[0][2]=='o' or K[1][0]==K[1][1]==K[1][2]=='o' or K[2][0]==K[2][1]==K[2][2]=='o' or K[1][0]==K[2][0]==K[0][0]=='o' or K[0][1]==K[1][1]==K[2][1]=='o' or K[0][2]==K[1][2]==K[2][2]=='o' or K[0][0]==K[1][1]==K[2][2]=='o' or K[2][0]==K[1][1]==K[0][2]=='o' :
    print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
ll = []
for i in range(3):
    l = list(map(int, input().split()))
    ll.append(l)

n = int(input())

for i in range(n):
    nn = int(input())
    for j in range(3):
        for k in range(3):
            if ll[j][k] == nn:
                ll[j][k] = "#"

flag = False
for i in range(3):
    if ll[i][0] == "#" and ll[i][1] == "#" and ll[i][2] == "#":
        flag = True
        break
    elif ll[0][i] == "#" and ll[1][i] == "#" and ll[2][i] == "#":
        flag = True
        break
if ll[0][0] == "#" and ll[1][1] == "#" and ll[2][2] == "#":
    flag = True
elif ll[0][2] == "#" and ll[1][1] == "#" and ll[2][0] == "#":
    flag = True

if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a1 = input().split()
a2 = input().split()
a3 = input().split()
n = int(input())
ans = "No"
x = [0] * 9
for i in range(n):
    b = input()
    if b in a1:
        x[a1.index(b)] = 1
    if b in a2:
        x[a2.index(b)+3] = 1
    if b in a3:
        x[a3.index(b)+6] = 1

if x[0]+x[1]+x[2]==3 or x[3]+x[4]+x[5]==3 or x[6]+x[7]+x[8]==3 or x[0]+x[3]+x[6]==3 or x[1]+x[4]+x[7]==3 or x[2]+x[5]+x[8]==3 or x[0] + x[4] + x[8] == 3 or x[2]+x[4]+x[6]==3:
    ans = "Yes"
    
print(ans)

Submission status: Accepted

Solution code:
a = [list(map(int, input().split())) for _ in range(3)]
a = a[0] + a[1] + a[2]
c = [
        a[0:3], a[3:6], a[6:9], a[::3], a[1::3], a[2::3],
        [a[0], a[4], a[8]], [a[2], a[4], a[6]]
    ]
n = int(input())
b = [int(input()) for _ in range(n)]


same = set(a) & set(b)

for d in c:
    cnt = 0
    for n in same:
        if n in d:
            cnt += 1
    if cnt == 3:
        print("Yes")
        exit()
else:
    print("No")

Submission status: Accepted

Solution code:
card = [list(map(int, input().split())) for i in range(3)]
n = int(input())
chk = [[0] * 3 for i in range(3)]

for i in range(n):
    num = int(input())
    for j in range(3):
        for k in range(3):
            if num == card[j][k]:
                chk[j][k] = 1

if any([all([chk[0][0], chk[0][1], chk[0][2]]),
        all([chk[1][0], chk[1][1], chk[1][2]]),
        all([chk[2][0], chk[2][1], chk[2][2]]),
        all([chk[0][0], chk[1][0], chk[2][0]]),
        all([chk[0][1], chk[1][1], chk[2][1]]),
        all([chk[0][2], chk[1][2], chk[2][2]]),
        all([chk[0][0], chk[1][1], chk[2][2]]),
        all([chk[0][2], chk[1][1], chk[2][0]])
        ]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

def main():
    bingo = []
    for i in range(3):
        bingo.append(list(map(int, input().split())))

    n = int(input())
    exsit = [int(input()) for i in range(n)]
    for e in exsit:
        for b in bingo:
            if b.count(e) == 1:
                b[b.index(e)] = 0
    naname = [0, 0]
    for i in range(len(bingo)):
        if bingo[i].count(0) == 3:
            print('Yes')
            exit()
        elif [bingo[j][i] for j in range(3)].count(0) == 3:
            print('Yes')
            exit()
        naname[0] += 1 if bingo[i][i] == 0 else 0
        naname[1] += 1 if bingo[i][2 - i] == 0 else 0

    if naname[0] == 3 or naname[1] == 3:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]

def popcount(n):
    return bin(n).count('1')
ans = False
a = sum(a,[])
abingo = 0
for i in b:
    if i in a:
        abingo |= 256>>(a.index(i))
virtical = 0b100100100
side = 0b111000000
downleft = 0b001010100
downright = 0b100010001
for i in range(3):
    if popcount(abingo & virtical)==3: ans=True
    if popcount(abingo & side)==3: ans=True
    virtical >>= 1
    side >>= 3
if popcount(abingo & downleft)==3: ans=True
if popcount(abingo & downright)==3: ans=True

print('Yes' if ans else 'No')

Submission status: Accepted

Solution code:
card = []

for _ in range(3):
    card.append(list(map(int, input().split())))
n = int(input())
b = []
for _ in range(n):
    b.append(int(input()))

for i in range(3):
    if card[i][0] in b and card[i][1] in b and card[i][2] in b:
        print('Yes')
        exit()
for i in range(3):
    if card[0][i] in b and card[1][i] in b and card[2][i] in b:
        print('Yes')
        exit()
if card[0][0] in b and card[1][1] in b and card[2][2] in b:
    print('Yes')
    exit()
if card[0][2] in b and card[1][1] in b and card[2][0] in b:
    print('Yes')
    exit()


print('No')

Submission status: Accepted

Solution code:
A = []
 
for i in range(3):
    A.append(list(map(int, input().split())))
N = int(input())
b = []
for i in range(N):
    b.append(int(input()))
 
for i in range(3):
    if A[i][0] in b and A[i][1] in b and A[i][2] in b:
        print('Yes')
        exit()
for i in range(3):
    if A[0][i] in b and A[1][i] in b and A[2][i] in b:
        print('Yes')
        exit()
if A[0][0] in b and A[1][1] in b and A[2][2] in b:
    print('Yes')
    exit()
if A[2][0] in b and A[1][1] in b and A[0][2] in b:
    print('Yes')
    exit()
 
 
 
print('No')

Submission status: Accepted

Solution code:
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
a = []
ans = 0
for i in range(n):
    b = int(input()) 
    a.append(b)
for i in range(3):
    if a1[i] in a and a2[i] in a and a3[i] in a:
        ans = 'Yes'
if a1[0] in a and a1[1] in a and a1[2] in a:
    ans = 'Yes'
if a2[0] in a and a2[1] in a and a3[2] in a:
    ans = 'Yes'
if a3[0] in a and a3[1] in a and a3[2] in a:
    ans = 'Yes'
if a1[0] in a and a2[1] in a and a3[2] in a:
    ans = 'Yes'
if a1[2] in a and a2[1] in a and a3[0] in a:
    ans = 'Yes'
if ans == 'Yes':
    print(ans)
else:
    print('No')

Submission status: Accepted

Solution code:
A = []
 
for i in range(3):
    A.append(list(map(int, input().split())))
N = int(input())
b = []
for i in range(N):
    b.append(int(input()))
 
for i in range(3):
    if A[i][0] in b and A[i][1] in b and A[i][2] in b:
        print('Yes')
        exit()
for i in range(3):
    if A[0][i] in b and A[1][i] in b and A[2][i] in b:
        print('Yes')
        exit()
if A[0][0] in b and A[1][1] in b and A[2][2] in b:
    print('Yes')
    exit()
if A[2][0] in b and A[1][1] in b and A[0][2] in b:
    print('Yes')
    exit()
 
 
 
print('No')

Submission status: Accepted

Solution code:
a1, a2, a3 = map(int, input().split())
a4, a5, a6 = map(int, input().split())
a7, a8, a9 = map(int, input().split())

la = list()
la.append(a1)
la.append(a2)
la.append(a3)
la.append(a4)
la.append(a5)
la.append(a6)
la.append(a7)
la.append(a8)
la.append(a9)

N = int(input())

lb = list()
for i in range(N):
    lb.append(int(input()))

for i in range(N):
    for j in range(9):
        if lb[i] == la[j]:
            la[j] = 0

if la[0] + la[1] + la[2] == 0 or la[3] + la[4] + la[5] == 0 or la[6] + la[7] + la[8] == 0 or la[0] + la[3] + la[6] == 0 or la[1] + la[4] + la[7] == 0 or la[2] + la[5] + la[8] == 0 or la[0] + la[4] + la[8] == 0 or la[2] + la[4] + la[6] == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = []
for i in range(3):
    n.extend(list(map(int, input().split())))

m = int(input())
for i in range(m):
    num = int(input())
    if num in n: n[n.index(num)] = 0

check = "No"

for j in range(3):
    if n[j + 0] == 0 and n[j + 3] == 0 and n[j + 6] == 0:
        check = "Yes"
        break
    if n[j * 3] == 0 and n[j * 3 + 1] == 0 and n[j * 3 + 2] == 0:
        check = "Yes"
        break

if n[0] == 0 and n[4] == 0 and n[8] == 0:
        check = "Yes"
if n[2] == 0 and n[4] == 0 and n[6] == 0:
        check = "Yes"

print(check)

Submission status: Accepted

Solution code:
def main():
    A = [[int(a) for a in input().split()] for i in range(3)]
    N = int(input())
    b = [int(input()) for i in range(N)]
    for k in b:
        for i in range(3):
            for j in range(3):
                if A[i][j] == k:
                    A[i][j] = "x"
    bingo = False
    if A[0][0] == A[0][1] == A[0][2] == "x" or \
       A[1][0] == A[1][1] == A[1][2] == "x" or \
       A[2][0] == A[2][1] == A[2][2] == "x" or \
       A[0][0] == A[1][0] == A[2][0] == "x" or \
       A[0][1] == A[1][1] == A[2][1] == "x" or \
       A[0][2] == A[1][2] == A[2][2] == "x" or \
       A[0][0] == A[1][1] == A[2][2] == "x" or \
       A[0][2] == A[1][1] == A[2][0] == "x":
       bingo = True
       
    if bingo:
        print("Yes")
    else:
        print("No")
main()

Submission status: Accepted

Solution code:
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
    B.append(int(input()))
ans='No'

def judge(A, B):
    for i in range(3): 
        if A[i] in B:
            A[i] = 1
        else:
            A[i] = 0

judge(A1, B)
judge(A2, B)
judge(A3, B)

if sum(A1)==3 or sum(A2)==3 or sum(A3)==3:
    ans = 'Yes' 
for i in range(3):
    if A1[i] + A2[i] + A3[i] == 3:
        ans = 'Yes'
if A1[0] + A2[1] + A3[2] == 3 or A1[2] + A2[1] + A3[0] == 3:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
a_1=list(map(int, input().split()))
a_2=list(map(int, input().split()))
a_3=list(map(int, input().split()))

c=[a_1,a_2,a_3]

N=int(input())

b=[int(input()) for _ in range(N)]

for i in range(3):
    for j in range(3):
        if c[i][j] in b:
            c[i][j]=0
            
            
i=0
if c[0][0]==0 and c[0][1]==0 and c[0][2]==0:
    i+=1
if c[1][0]==0 and c[1][1]==0 and c[1][2]==0:
    i+=1
if c[2][0]==0 and c[2][1]==0 and c[2][2]==0:
    i+=1
if c[0][0]==0 and c[1][0]==0 and c[2][0]==0:
    i+=1
if c[0][1]==0 and c[1][1]==0 and c[2][1]==0:
    i+=1
if c[0][2]==0 and c[1][2]==0 and c[2][2]==0:
    i+=1
if c[0][0]==0 and c[1][1]==0 and c[2][2]==0:
    i+=1
if c[0][2]==0 and c[1][1]==0 and c[2][0]==0:
    i+=1
    
if i>0:
    print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a_list = []
a_result = []
b_list = []
for i in range(3):
    a_list.append(list(map(int,input().split())))
    a_result.append([0,0,0])
n = int(input())
for i in range(n):
    b_list.append(int(input()))

for i in range(3):
    for j in range(3):
        for k in range(n):
            if a_list[i][j] == b_list[k]:
                a_result[i][j] = 1
                break

judge = 'No'
for i in range(3):
    if a_result[i][0]*a_result[i][1]*a_result[i][2] == 1:
        judge = 'Yes'
for j in range(3):
    if a_result[0][j]*a_result[1][j]*a_result[2][j] == 1:
        judge = 'Yes'
if a_result[0][0]*a_result[1][1]*a_result[2][2] == 1:
    judge = 'Yes'
if a_result[0][2]*a_result[1][1]*a_result[2][0] == 1:
    judge = 'Yes'

print(judge)

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])


# エントリーポイント
def main():
    A = input([[int, 3], 3])
    N = input(int)
    B = input([int, N])

    ans = 0
    for x in range(3):
        for y in range(3):
            if A[x][y] not in B:
                break
        else:
            ans += 1
    for y in range(3):
        for x in range(3):
            if A[x][y] not in B:
                break
        else:
            ans += 1
    for z in range(3):
        if A[z][z] not in B:
            break
    else:
        ans += 1
    for z in range(3):
        if A[z][2 - z] not in B:
            break
    else:
        ans += 1
    yesno(not ans == 0)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
a = [list(map(int, input().split()))for _ in range(3)]

n = int(input())

for i in range(n):
    b = int(input())
    for j in range(3):
        for k in range(3):
            if a[j][k] == b: a[j][k] =0
ans = "No"

for i in range(3):
  if a[i][0]==a[i][1]==a[i][2]==0:ans="Yes"
  if a[0][i]==a[1][i]==a[2][i]==0:ans="Yes"
if a[0][0]==a[1][1]==a[2][2]==0:ans="Yes"
if a[2][0]==a[1][1]==a[0][2]==0:ans="Yes"
print(ans)

Submission status: Accepted

Solution code:
a=[list(map(int,input().split()))for _ in range(3)]
N = int(input())
for i in range(N):
  b=int(input())
  for j in range(3):
    for k in range(3):
      if a[j][k]==b:
          a[j][k]=0
ans="No"
for i in range(3):
  if a[i][0]==a[i][1]==a[i][2]==0:
      ans="Yes"
  if a[0][i]==a[1][i]==a[2][i]==0:
      ans="Yes"
if a[0][0]==a[1][1]==a[2][2]==0:
    ans="Yes"
if a[2][0]==a[1][1]==a[0][2]==0:
    ans="Yes"
print(ans)