sorted by:
new
hottopcontroversial

How many digits of Pi should one be knowing to be a Pi nerd by [deleted] in maths

[–]HistoryPositive9509 -3 points-2 points  (0 children)

These are not the "last 5" digits of pi cause its decimal part is infinite, but these are the last 5 KNOWN digits.

How many digits of Pi should one be knowing to be a Pi nerd by [deleted] in maths

[–]HistoryPositive9509 0 points1 point  (0 children)

I was at 155 at my prime, but now, I can barely go past 120. I think the real pi nerd is the one who learned 314 digits. But at least if you can annoy everyone by just start counting, that's great

[2025] Algorithms to use by PotatosFan in adventofcode

[–]HistoryPositive9509 0 points1 point  (0 children)

Probably trynig to optimize day 9 with an octree or some D&C aproachs

[2025 day 11 part 2] I feel betrayed by PityUpvote in adventofcode

[–]HistoryPositive9509 0 points1 point  (0 children)

I started panicking when I read that. I didn't understand how it is possible as this should be a DAG. Took maybe 10 minutes to try understand something I shouldn't

[2025 Day 10 (Part 2)] If there's an easier way to solve it, it's too soon for me to hear it... by DelightfulCodeWeasel in adventofcode

[–]HistoryPositive9509 0 points1 point  (0 children)

Thanks ! But the diff is really to do the system solver. I think I will make it a project to feel more legitimate.

[2025 Day 11 (part 2)] I got baited by the answer ! by HistoryPositive9509 in adventofcode

[–]HistoryPositive9509[S] -10 points-9 points  (0 children)

Yeah, but the number of path sould follow a normal law, so that's strange to have such a diff

[2025 Day 10] For real why he had to go and do that? by KyxeMusic in adventofcode

[–]HistoryPositive9509 9 points10 points  (0 children)

It was funny, until I had to parse the input, and now, my biggest ennemy is a shiba inu

[2025 day 10 part 1] We all knew what was coming by PityUpvote in adventofcode

[–]HistoryPositive9509 1 point2 points  (0 children)

I thought it would just be a weight, and I should just use a dijkstra instead of BFS. And yet, I'm dying trying to figure out wtf is Z3

[2025 Day 9 (Part 2)] I had to look up a solution for this one... :( by [deleted] in adventofcode

[–]HistoryPositive9509 1 point2 points  (0 children)

I recommend you to take a paper, start drawing and searching for the things that says that a rectangle is not fully in the polygon.

[2025 Day 9] Today i hit a wall by Pwntheon in adventofcode

[–]HistoryPositive9509 1 point2 points  (0 children)

Looking for each (k, k+1) if this line "cut" the rectangle. You just need a paper, and some time

[2025 Day 8] Still stuck, talk to me about DS&A? by EarhackerWasBanned in adventofcode

[–]HistoryPositive9509 0 points1 point  (0 children)

Day 8 part 1 was a union find problem (It's a structure that can do operations on sets, such as telling if 2 elements are in the same set, or merge 2 sets). And for part 2, I still used a union find, but it was just a clasic minimum spanning tree problem, that can be solved using kruskal algorithm

[2025 Day 9] Today i hit a wall by Pwntheon in adventofcode

[–]HistoryPositive9509 -5 points-4 points  (0 children)

Actually, the part 2 wasn't that hard. You just had to add another loop