Advent Of Code

1248 readers

1 users here now

An unofficial home for the advent of code community on programming.dev! Other challenges are also welcome!

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.

Everybody Codes is another collection of programming puzzles with seasonal events.

AoC 2025

Solution Threads

M	T	W	T	F	S	S
1	2	3	4	5	6	7
8	9	10	11	12

Visualisations Megathread

Rules/Guidelines

Follow the programming.dev instance rules
Keep all content related to advent of code in some way
If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts

Relevant Communities

Relevant Links

Advent of Code Homepage

Credits

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

console.log('Hello World')

founded 3 years ago

MODERATORS

Ategon@programming.dev

Sigmatics@lemmy.ca

CameronDev@programming.dev

hades@programming.dev

🤶 - 2025 DAY 8 SOLUTIONS - 🤶 (programming.dev)

submitted 9 months ago by CameronDev@programming.dev to c/advent_of_code@programming.dev

29 comments fedilink hide all child comments

Day 8: Playground

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

What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
Where do I participate?: https://adventofcode.com/
Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465

you are viewing a single comment's thread
view the rest of the comments

[–] mykl@lemmy.world 0 points 9 months ago* (last edited 9 months ago) (1 children)

Just a messy part1 so far. Plus a moment of pure rage when I realised the trap. (I have no idea what algorithm Lemmy uses to highlight Uiua code, but it's always a surprise.)

"162,817,812\n57,618,57\n906,360,560\n592,479,940\n352,342,300\n466,668,158\n542,29,236\n431,825,988\n739,650,466\n52,470,668\n216,146,977\n819,987,18\n117,168,530\n805,96,715\n346,949,466\n970,615,88\n941,993,340\n862,61,35\n984,92,344\n425,690,689"
# &fras"AOC2025day08.txt"◌
Row ← (
  ⊙(⊃⊢↘₁)
  ⊚◡≡⌟◇(/+˜∊)
  ⨬(⊂⊙□◌                     # Not found: new circuit
  | ⍜⊡(⍜°□(◴⊂))⊢             # One found: add
  | ▽>₀⊸≡◇⧻⍜(⊏|⊂{[]}{∘}◴/◇⊂) # Connect two
  )⊸⧻◴
)
⍆↯∞_3◇⋕⊜□⊸∊+@0⇡10
⊏⍏/+ⁿ2/-⊸⍉⊸⧅>2
≡⌟₁˜⨂
{[°⊟]}°⊂
Part₁ ← /×↙3⇌⍆≡◇⧻⍥Row9 # MANUAL CHANGE TO 999 for live
⊙◌Part₁

[–] strlcpy@lemmy.sdf.org 0 points 9 months ago

the trap

Re. what connections to process or not? That seems to be like one of those that's either completely obvious when you implement your solution one way, and a nasty pitfall when you do it another. In this case, pre-computing the list of pairs to process vs. finding the next one when you need it.