adventofcode

2025-12-08T14:56:54.987959Z

Question about Day 7 Part 2 (in thread to avoid spoilers)

2025-12-08T14:57:21.699689Z

Is this not basically binomial coefficents / pascals triangle ? Or am I going down the wrong path entirely ?

Logan Turner 2025-12-08T15:03:23.608899Z

Huh, I guess it would be if there were a splitter immediately below every beam. So you can’t use the exact same numbers, but a similar approach to solving it will work.

2025-12-08T05:45:33.201569Z

Day 8 - Solutions

jurjanpaul 2025-12-08T13:39:16.542279Z

That’s what I do, but… still missing some subtlety somewhere so that I don’t get the correct result yet (though I do for the example).

narimiran 2025-12-08T15:51:28.197319Z

Day 8 notebook: https://narimiran.github.io/aoc2025/src/day08/

jurjanpaul 2025-12-08T20:41:02.452949Z

https://jurjanpaul.github.io/ape-cljs-playground/?code=KHJlcXVpcmUgJ1tjbG9qdXJlLnNldCA6YXMgY3NldF0pCgooZGVmIGlucHV0CiAgOzsgdG8gYmUgcmVwbGFjZWQgd2l0aCByZWFsIGlucHV0CiAgIjE2Miw4MTcsODEyCjU3LDYxOCw1Nwo5MDYsMzYwLDU2MAo1OTIsNDc5LDk0MAozNTIsMzQyLDMwMAo0NjYsNjY4LDE1OAo1NDIsMjksMjM2CjQzMSw4MjUsOTg4CjczOSw2NTAsNDY2CjUyLDQ3MCw2NjgKMjE2LDE0Niw5NzcKODE5LDk4NywxOAoxMTcsMTY4LDUzMAo4MDUsOTYsNzE1CjM0Niw5NDksNDY2Cjk3MCw2MTUsODgKOTQxLDk5MywzNDAKODYyLDYxLDM1Cjk4NCw5MiwzNDQKNDI1LDY5MCw2ODkiKQoKKGRlZm4gcGFyc2UKICBbaW5wdXRdCiAgKC0%2BPiAoc3RyaW5nL3NwbGl0LWxpbmVzIGlucHV0KQogICAgICAgKG1hcCAjKC0%2BPiAoc3RyaW5nL3NwbGl0ICUgIyIsIikKICAgICAgICAgICAgICAgICAgKG1hcCBwYXJzZS1sb25nKSkpKSkKCihkZWYgcGFyc2VkCiAgKHBhcnNlIGlucHV0KSkKCihkZWZuIHNxdWFyZSBbeF0KICAoKiB4IHgpKQoKKGRlZm4gcmVwbGFjZS12YWxzCiAgW20gZnJvbSB0b10KICAocmVkdWNlLWt2IChmbiBbbSBrIHZdCiAgICAgICAgICAgICAgIChpZiAoPSBmcm9tIHYpCiAgICAgICAgICAgICAgICAgKGFzc29jIG0gayB0bykKICAgICAgICAgICAgICAgICBtKSkKICAgICAgICAgICAgIG0KICAgICAgICAgICAgIG0pKQoKKGRlZm4gZGlzdGFuY2UzZHNxdWFyZWQKICBbW2ExIGIxIGMxXSBbYTIgYjIgYzJdXQogICgrIChzcXVhcmUgKC0gYTIgYTEpKSAKICAgICAoc3F1YXJlICgtIGIyIGIxKSkKICAgICAoc3F1YXJlICgtIGMyIGMxKSkpKQoKKGRlZiBzb3J0ZWQtcGFpcnMgCiAgKC0%2BPiAoZm9yIFtbcCAmIHJlbWFpbmluZ10gCiAgICAgICAgICAgICAodGFrZS13aGlsZSBzb21lPyAoaXRlcmF0ZSBuZXh0IHBhcnNlZCkpCiAgICAgICAgICAgICBxIChuZXh0IHJlbWFpbmluZykKICAgICAgICAgICAgIDp3aGVuIHFdCiAgICAgICAgIFsoZGlzdGFuY2UzZHNxdWFyZWQgcCBxKSBwIHFdKQogICAgICAgKHNvcnQtYnkgZmlyc3QpCiAgICAgICAobWFwIHJlc3QpKSkKCihkZWZuIGNvbm5lY3QtcGFpcnMKICBbcG9zaXRpb25zIHBhaXJzXQogIChyZWR1Y2UgKGZuIFt7OmtleXMgW2NpcmN1aXRzIHBvc2l0aW9uLT5jaXJjdWl0LWlkXSA6YXMgYWNjfSAKICAgICAgICAgICAgICAgW3AgcV1dCiAgICAgICAgICAgIChsZXQgW1tmcm9tLWNpcmN1aXQtaWQgdG8tY2lyY3VpdC1pZF0gCiAgICAgICAgICAgICAgICAgIChtYXAgcG9zaXRpb24tPmNpcmN1aXQtaWQgW3AgcV0pXQogICAgICAgICAgICAgIChpZiAoPSB0by1jaXJjdWl0LWlkIGZyb20tY2lyY3VpdC1pZCkKICAgICAgICAgICAgICAgIGFjYwogICAgICAgICAgICAgICAgKGxldCBbbmV3LWNpcmN1aXRzCiAgICAgICAgICAgICAgICAgICAgICAoLT4gY2lyY3VpdHMKICAgICAgICAgICAgICAgICAgICAgICAgICAodXBkYXRlIHRvLWNpcmN1aXQtaWQgY3NldC91bmlvbiAoZ2V0IGNpcmN1aXRzIGZyb20tY2lyY3VpdC1pZCkpCiAgICAgICAgICAgICAgICAgICAgICAgICAgKGRpc3NvYyBmcm9tLWNpcmN1aXQtaWQpKV0KICAgICAgICAgICAgICAgICAgKGlmICg9IDEgKGNvdW50IG5ldy1jaXJjdWl0cykpCiAgICAgICAgICAgICAgICAgICAgKHJlZHVjZWQgezpsYXN0LWNvbm5lY3Rpb24gW3AgcV19KQogICAgICAgICAgICAgICAgICAgIHs6Y2lyY3VpdHMgbmV3LWNpcmN1aXRzCiAgICAgICAgICAgICAgICAgICAgIDpwb3NpdGlvbi0%2BY2lyY3VpdC1pZAogICAgICAgICAgICAgICAgICAgICAocmVwbGFjZS12YWxzIHBvc2l0aW9uLT5jaXJjdWl0LWlkCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgZnJvbS1jaXJjdWl0LWlkCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgdG8tY2lyY3VpdC1pZCl9KSkpKSkKICAgICAgICAgIChsZXQgW2luZGV4ZWQgKGludG8ge30gKHppcG1hcCAocmFuZ2UpIHBvc2l0aW9ucykpXSAgICAgICAgIAogICAgICAgICAgICB7OmNpcmN1aXRzIChyZWR1Y2Uta3YgKGZuIFttIGsgdl0gKGFzc29jIG0gayAje3Z9KSkge30gaW5kZXhlZCkKICAgICAgICAgICAgIDpwb3NpdGlvbi0%2BY2lyY3VpdC1pZCAocmVkdWNlLWt2IChmbiBbbSBrIHZdIChhc3NvYyBtIHYgaykpIHt9IGluZGV4ZWQpfSkKICAgICAgICAgIHBhaXJzKSkKCihkZWZuIHBhcnQxIFtdCiAgKC0%2BPiBzb3J0ZWQtcGFpcnMKICAgICAgICh0YWtlIDEwKSA7IDEwMDAgIQogICAgICAgKGNvbm5lY3QtcGFpcnMgcGFyc2VkKQogICAgICAgOmNpcmN1aXRzCiAgICAgICB2YWxzCiAgICAgICAobWFwIGNvdW50KQogICAgICAgKHNvcnQgPikKICAgICAgICh0YWtlIDMpCiAgICAgICAocmVkdWNlICopKSkKCihwcmludGxuICJwYXJ0MToiIChwYXJ0MSkpCgooZGVmbiBwYXJ0MiBbXQogICgtPj4gc29ydGVkLXBhaXJzCiAgICAgICAoY29ubmVjdC1wYWlycyBwYXJzZWQpCiAgICAgICA6bGFzdC1jb25uZWN0aW9uCiAgICAgICAobWFwIGZpcnN0KQogICAgICAgKHJlZHVjZSAqKSkpCgoocHJpbnRsbiAicGFydDI6IiAocGFydDIpKQo%3D&checksum=LTEzMjAyOTk3MDE%3D Debugged 🙂 and refactored some.

2025-12-09T00:13:21.979139Z

Haven't posted any of my solutions this year but I had fun with this one. https://gitlab.com/zamansky/advent2025/-/blob/main/src/day08.clj?ref_type=heads

rjray 2025-12-08T06:21:00.961499Z

https://github.com/rjray/advent-2025-clojure/blob/master/src/advent_of_code/day08.clj I really thought part 2 was scary when I first read it, but it turned out to take less than 1/4 the time part 1 had, and ran faster than part 1 did.

minikomi 2025-12-08T06:57:28.533509Z

extreme brute force engaged https://github.com/minikomi/advent-of-code/tree/4d64ac8343df09410939631effa673c251ec7366/2025/src/day8.clj Getting all the distances, sorting and then building the network

snyssfx 2025-12-09T20:28:52.425179Z

catching up with no refactoring (UPD slightly refactored)

Logan Turner 2025-12-10T01:57:18.983889Z

Had trouble with this one.

Sam Ferrell 2025-12-10T07:40:04.580259Z

https://github.com/samcf/advent-of-code/blob/main/2025-08-playground.clj Uses combinations from combinatorics and an adjacency list expressed with a map of points to sets of connected points. merge-with to update the adjacency list.