this post was submitted on 07 Dec 2024
0 points (NaN% liked)

Advent Of Code

981 readers
21 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2024

Solution Threads

M T W T F S S
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

Rules/Guidelines

Relevant Communities

Relevant Links

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago
MODERATORS
 

Day 7: Bridge Repair

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

you are viewing a single comment's thread
view the rest of the comments
[โ€“] [email protected] 0 points 2 weeks ago (1 children)

python

45s on my machine for first shot, trying to break my will to brute force ๐Ÿ˜…. I'll try improving on it in a bit after I smoke another bowl and grab another drink.

solution

from itertools import product
import re
import aoc

def ltr(e):
    r = int(e[0])
    for i in range(1, len(e), 2):
        o = e[i]
        n = int(e[i + 1])
        if o == '+':
            r += n
        elif o == '*':
            r *= n
        elif o == '||':
            r = int(f"{r}{n}")
    return r

def one():
    lines = aoc.get_lines(7)
    rs = []
    for l in lines:
        d = [int(x) for x in re.findall(r'\d+', l)]
        t = d[0]
        ns = d[1:]
        ops = list(product(['+', '*'], repeat=len(ns) - 1))
        for o in ops:
            e = str(ns[0])
            for i, op in enumerate(o):
                e += f" {op} {ns[i + 1]}"
            r = ltr(e.split())
            if r == t:
                rs.append(t)
                break
    print(sum(rs))

def two():
    lines = aoc.get_lines(7)
    rs = []
    for l in lines:
        d = [int(x) for x in re.findall(r'\d+', l)]
        t = d[0]
        ns = d[1:]
        ops = list(product(['+', '*', '||'], repeat=len(ns) - 1))
        for o in ops:
            e = str(ns[0])
            for i, op in enumerate(o):
                e += f" {op} {ns[i + 1]}"
            r = ltr(e.split())
            if r == t:
                rs.append(t)
                break
    print(sum(rs))

one()
two()

[โ€“] [email protected] 0 points 2 weeks ago (2 children)

What a horrible way to name variables

[โ€“] [email protected] 0 points 2 weeks ago* (last edited 2 weeks ago)

It's not a long lived project, it's a puzzle, and once solved never needs to run again. My objective here is to get the correct answer, not win a style contest.

Can you provide a link to your solution? I'd like to check it out.

[โ€“] [email protected] 0 points 2 weeks ago

a e o, Killer Tofu. That's all I can think of reading this code.