Problem: 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.

Submission attempts (in order):
def judge(board):
    for i in range(0, 3):
        if board[i][0] == board[i][1] == board[i][2] == 0 :
            return True
        if board[0][i] == board[1][i] == board[2][i] == 0:
            return True
    
    if board[0][0] == board[1][1] == board[2][2] == 0:
        return True
    if board[0][2] == board[1][1] == borad[2][0] == 0:
        return True
    
    return False


upper  = list(map(int, input().split(" ")))
middle = list(map(int, input().split(" ")))
lower  = list(map(int, input().split(" ")))

board = (upper,middle,lower)

N = int(input())
bingos = list()

for i in range(0, N):
    bingos.append(int(input()))

for i in range(0, 3):
    for j in range(0, 3):
        if upper[j] == bingos[i]:
            board[0][j] = 0
            break
        elif middle[j] == bingos[i]:
            board[1][j] = 0
            break
        elif lower[j] == bingos[i]:
            board[2][j] = 0
            break
        else:
            pass

if judge(board):
    print('Yes')
else:
    print('No')


def judge(board):
    for i in range(0, 3):
        if board[i][0] == board[i][1] == board[i][2] == 0 :
            return True
        if board[0][i] == board[1][i] == board[2][i] == 0:
            return True
    
    if board[0][0] == board[1][1] == board[2][2] == 0:
        return True
    if board[0][2] == board[1][1] == borad[2][0] == 0:
        return True
    
    return False


upper  = list(map(int, input().split(" ")))
middle = list(map(int, input().split(" ")))
lower  = list(map(int, input().split(" ")))

board = (upper,middle,lower)

N = int(input())
bingos = [input() for i in range(N)]

for i in range(0, len(bingos)):
    for j in range(0, 3):
        if upper[j] == bingos[i]:
            board[0][j] = 0
            break
        elif middle[j] == bingos[i]:
            board[1][j] = 0
            break
        elif lower[j] == bingos[i]:
            board[2][j] = 0
            break
        else:
            pass

if judge(board):
    print('Yes')
else:
    print('No')


def judge(board):
    for i in range(0, 3):
        if board[i][0] == board[i][1] == board[i][2] == 0 :
            return True
        if board[0][i] == board[1][i] == board[2][i] == 0:
            return True
    
    if board[0][0] == board[1][1] == board[2][2] == 0:
        return True
    if board[0][2] == board[1][1] == board[2][0] == 0:
        return True
    
    return False


upper  = list(map(int, input().split(" ")))
middle = list(map(int, input().split(" ")))
lower  = list(map(int, input().split(" ")))

board = (upper,middle,lower)

N = int(input())
bingos = list()

for i in range(0, N):
    bingos.append(int(input()))


"""
print(upper)
print(middle)
print(lower)
print(bingos)

for i in range(3):
    for j in range(3):
        print(f'board[', i, '][', j, '] =', board[i][j])
"""

for i in range(0, len(bingos)):
    for j in range(0, 3):
#        print('bingos[i] : j = ', bingos[i], j)
        if upper[j] == bingos[i]:
            board[0][j] = 0
#            print('find in upper')
            break
        elif middle[j] == bingos[i]:
            board[1][j] = 0
#            print('find in middle')
            break
        elif lower[j] == bingos[i]:
            board[2][j] = 0
#            print('find in lower')
            break
        else:
            pass
#    print('')

if judge(board):
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Wrong Answer

Accepted