aoc-d4-p2

file = open('data.txt','r')
data = file.readlines()
file.close()

boards = [] # empty arr
order = data[0].split(',') # first line of numbers
order[-1] = order[-1].strip('\n') # get right of \n from first line

for i in range(len(data)): # for every other line
    # if there is a \n on its own there is a board after it
    if data[i] == '\n': boards.append([data[i+j].split() for j in range(1,6)])

def win(board):
    total = 0
    for i in range(5):
        for j in range(5):
            if board[i][j] != None: total += int(board[i][j])
    return total

def check_win(board):
    for i in range(5):
        n = 0
        c = 0
        for j in range(5):
            if board[i][j] == None: n += 1
            if board[j][i] == None: c += 1
        if n == 5 or c == 5: return win(board)

last = 0
end = False
for n in order:
    for i in range(len(boards)):
        for j in range(5):
            for k in range(5):
                if boards[i][j][k] == n:
                    boards[i][j][k] = None
        total = check_win(boards[i])
        if total is not None:
            last = total*int(n)
            boards[i] = None
            pass
    while None in boards:
        for p in range(len(boards)):
            if boards[p] == None:
                boards.pop(p)
                break
print(last)