AdventofCode2021/Day4.py at master · Bulkje/AdventofCode2021 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
def OctopusBingo():
    f = open("input day 4.txt", "r")
    lines = f.readlines()
    numbers = lines[0]
    numbers = numbers.split(',')
    numbers[-1] = numbers[-1][:-1]
    print(numbers)

    bingocards = []
    newcard = []
    i = 1
    while i < len(lines):
        if lines[i] == '\n':
            if newcard != []:
                bingocards.append(newcard)
            newcard = []
        else:
            newcard.append(lines[i][0:-1].split(' '))
        i += 1
    newcard[-1] = lines[i - 1].split(' ')
    bingocards.append(newcard)
    for card in bingocards:
        for line in card:
            for number in line:
                if number == '':
                    del line[line.index(number)]
    originalcards = bingocards.copy()

    result = bingofinder(bingocards, numbers)
    totalunmarked = 0
    for row in result[0]:
        for item in row:
            if item != 'X':
                totalunmarked += int(item)
    print('part 1')
    print(totalunmarked * int(numbers[result[1]]))

    print('part 2')
    while len(originalcards) > 0:
        result = bingofinder(originalcards, numbers)
        # returns [card, numbers.index(number), cards.index(card)]
        # winning card, index of winning number, index of winning card
        del originalcards[result[2]]
    print(result)

    totalunmarked = 0
    for row in result[0]:
        for item in row:
            if item != 'X':
                totalunmarked += int(item)
    print(totalunmarked * int(numbers[result[1]]))

def bingofinder(cards, numbers): # returns winning card, index of winning number, index of winning card
    bingoturns = []
    for number in numbers: # voor elk getal dat getrokken wordt
        for card in cards: #voor elke bingo kaart
            winningturn = len(numbers) # winning turn is heel ver weg
            y = 0
            while y < len(card[0]): #card[0] is het aantal rijen en kolommen, want een kaart is vierkant
                for getal in card[y]: #voor getal in rij
                    if getal == number:
                        card[y][card[y].index(getal)] = 'X' #kruis getal af
                        if card[y] == ['X', 'X', 'X', 'X', 'X']: #kijk of rij bingo geeft
                            if numbers.index(number) < winningturn:
                                winningturn = numbers.index(number) #maak winningturn kleiner
                        x = 0
                        while x < len(card[0]): #aantal kolommen
                            #als kolom bingo geeft
                            if card[0][x] == 'X' and card[1][x] == 'X' and card[2][x] == 'X' and card[3][x] == 'X' and card[4][x] == 'X':
                                if numbers.index(number) < winningturn:
                                    winningturn = numbers.index(number)
                            x += 1
                #                        if card[0][0] == card[1][1] == card[2][2] == card[3][3] == card[4][4] == 'X':
                #                            if numbers.index(number) < winningturn:
                #                                winningturn = numbers.index(number)
                #                        if card[0][4] == card[1][3] == card[2][2] == card[3][1] == card[4][0] == 'X':
                #                            if numbers.index(number) < winningturn:
                #                                winningturn = numbers.index(number)
                #no diagonal bingo lol
                y += 1
            if winningturn < len(numbers):
                bingoturns.append(winningturn)
                #print(cards.index(card))
                return [card, numbers.index(number), cards.index(card)]
                # winning card, index of winning number, index of winning card