+/AoC

advent of code

git clone https://git.julia.blue/+/AoC

Joseph RyanDay 168e04c2f

master
1.6 KiB70 linesraw
1from functools import reduce as fold
2from operator import mul
3
4def tobits(s):
5    temp = bin(int(s, 16))[2:]
6    dif = len(temp) % 4
7    if dif != 0:
8        temp = "0" * (4 - dif) + temp
9    return temp
10
11
12bits = tobits(open("input").read())
13
14def parse(b):
15    version = int(b[:3], 2)
16    type = int(b[3:6], 2)
17    # print("parsing:", version, type, len(b))
18    # print(b)
19    if type == 4:
20        pos = 6
21        num = ""
22        while True:
23            current = b[pos : pos + 5]
24            num += current[1:]
25            pos += 5
26            if current[0] == "0":
27                break
28        # print("val:", int(num, 2))
29        return (version, int(num, 2), pos)
30    msgs = []
31    if b[6] == "1":
32        pos = 18
33        subs = int(b[7:pos], 2)
34        # print("sub messages:", subs)
35        for _ in range(subs):
36            v, n, p = parse(b[pos:])
37            msgs.append(n)
38            version += v
39            pos += p
40    else:
41        pos = 22
42        size = int(b[7:22], 2)
43        while pos - 22 < size:
44            v, n, p = parse(b[pos:])
45            msgs.append(n)
46            version += v
47            pos += p
48    match type:
49        case 0:
50            n = sum(msgs)
51        case 1:
52            n = fold(mul, msgs)
53        case 2:
54            n = min(msgs)
55        case 3:
56            n = max(msgs)
57        case 5:
58            n = msgs[0] > msgs[1]
59        case 6:
60            n = msgs[0] < msgs[1]
61        case 7:
62            n = msgs[0] == msgs[1]
63        case other:
64            n = 0
65            print(f"Error: unknown type ({other})")
66    return (version, int(n), pos)
67
68
69print(parse(bits)[0])
70print(parse(bits)[1])