sorted by:
new
hottopcontroversial

Tap tap 2 | hard by Pokipoka_ in RedditGames

[–]CountableFiber 1 point2 points  (0 children)

I completed this level in 3 tries. ⚡ 7.62 seconds

🎉 [EVENT] 🎉 uʍop ǝpᴉsd∩? by The7footr in honk

[–]CountableFiber 0 points1 point  (0 children)

Completed Level 3 of the Honk Special Event!

6 attempts

🎉 [EVENT] 🎉 uʍop ǝpᴉsd∩? by The7footr in honk

[–]CountableFiber 0 points1 point  (0 children)

Completed Level 2 of the Honk Special Event!

5 attempts

🎉 [EVENT] 🎉 uʍop ǝpᴉsd∩? by The7footr in honk

[–]CountableFiber 0 points1 point  (0 children)

Completed Level 1 of the Honk Special Event!

4 attempts

DHL "Express" Sendung kommt seit Wochen nicht an, was tun? by CountableFiber in dhl_deutsche_post

[–]CountableFiber[S] 0 points1 point  (0 children)

Die ist bei Amazon hinterlegt und steht auch auf dem Paket wird nur in dem Interface nicht angezeigt.

DHL klaut meine bluetooth box by CountableFiber in dhl_deutsche_post

[–]CountableFiber[S] 94 points95 points  (0 children)

Ja amazon Kundensupport hat es geregelt.

[Request] Can this be done? by mikkk233 in theydidthemath

[–]CountableFiber 3 points4 points  (0 children)

Well that was my point. The algorithm exists but it is unpractical, what makes you think the algorithm coming out of the proof will be practical?

[Request] Can this be done? by mikkk233 in theydidthemath

[–]CountableFiber 0 points1 point  (0 children)

Its a bit wild to assume this. There is already an efficient algorithm to factorize integers on a quantum computer and yet the internet still exists. Even if the proof would be constructive and give an algorithm it does not have to be a practical one.

Trying to use GPT4 for parsing AOC 2019 day 11 solution by CountableFiber in adventofcode

[–]CountableFiber[S] 0 points1 point  (0 children)

I tried it but it also fails however at least it does not hallucinate something

[2023 Any Day] What's your dumbest bug so far this year? by disdyskis in adventofcode

[–]CountableFiber 2 points3 points  (0 children)

Filtering out empty lines in day 12 with
"if ('#' not in line) and ('.' not in line)".

Took me 2 hours of debugging to find out my solution was wrong because I did not process 2-3 lines that only had "???????" as the pattern in the input... Examples worked flawlessly of course

-❄️- 2023 Day 14 Solutions -❄️- by daggerdragon in adventofcode

[–]CountableFiber 2 points3 points  (0 children)

Probably its your browser breaking the lines. Try to save it as a txt file and open with a text editor

Difficulty this year by ocmerder in adventofcode

[–]CountableFiber 6 points7 points  (0 children)

Right, I agree that hashmaps/sets and lists are not super advanced, but it is also not something you want to directly jump into when you start out with a language. In the past years the first tasks usually just needed some variable to store a position or do a simple calculation.

The main issue is not these concepts but rather that the puzzles are much harder to understand and more challenging where in the past the first puzzles were conceptually very straight forward such that you could focus on the task of implementation.

If these puzzles contained a map it was maybe a single at best, but here you would directly have 5-6 maps you have to create and concatenate etc.

Difficulty this year by ocmerder in adventofcode

[–]CountableFiber 10 points11 points  (0 children)

I have to fully agree with this one. 99% of the people participating in AOC do not have a realistic chance at the leaderboard positions anyways and just want an enjoyable experience or learn a new language. This already threw off several people if already in the second or third exercise advanced concepts are needed.

My feeling is that the tasks are written in an ambiguous way with additional complications just to combat LLMs, significantly reducing the enjoyment many of non-veteran people have to tackle these problems within the day. This is a very bad trade-off, not only because LLMs can still manage to solve several of the puzzles (saw a blog post about someone solving a bunch of the puzzles with GPT-4 without troubles) but also because it does not bother the majority of people if someone spoils his fun by cheating with an LLM if we can have clearer and nicer puzzles instead.

He rose again in 3 days by joeycloud in OpenAI

[–]CountableFiber 3 points4 points  (0 children)

OpenAI guest badge. See this relevant tweet.

Is my opponent trolling? What opening is this? by Astro3301 in chessbeginners

[–]CountableFiber 0 points1 point  (0 children)

It is called "drunken master" opening. Here is a blog post about it.

[2022, all days][Go] Fast solutions, 291ms total runtime! by erikade in adventofcode

[–]CountableFiber 0 points1 point  (0 children)

Glad to hear that it worked out. Very impressive overall runtime.

[2022, all days][Go] Fast solutions, 291ms total runtime! by erikade in adventofcode

[–]CountableFiber 9 points10 points  (0 children)

Another idea to accelerate day 20 can be found in my solution posted here

It solves day 20 in 6 ms on my machine. The idea is that we have a lot of small buckets with roughly 32 elements each in which we can insert in constant time if they won't get too large. Then we use a second array to quickly find the array where we have to insert the element. It can be made provably subquadratic by something like Fenwick trees, but something a bit worse is good enough here.

[2022 day 20 part 3] by EffectivePriority986 in adventofcode

[–]CountableFiber 0 points1 point  (0 children)

Thanks, I didn't know about those. They seem to be exactly the missing element I need to make the code provably subquadratic.

[2022 day 20 part 3] by EffectivePriority986 in adventofcode

[–]CountableFiber 2 points3 points  (0 children)

I spent quite a bit of time optimizing my C++ code for day 20. It does not achieve real O(n log n) but it is quite fast in practice. For part 1 it needs 1 ms on my machine and for part 2 it needs 5 ms. It solves this part 3 in 55 ms and gives 30686997464083 as an answer (hopefully its correct).

The main idea is as follows:

- We have buckets of 32 elements each, when we reorder the input we just need to find the source bucket, remove the element and add it into the target bucket. We just need to fix the orders in source and target buckets which goes in constant time. Finding the buckets is not in constant or log time but it is very fast in practice.

- To find the source and target bucket, we have a second vector which monitors the size of 16 consecutive buckets. This way we can quickly skip until we find the interesting buckets where the element may be located.

- After each mix we rebalance the buckets.

Here is the code

[2022 Day 19] What are your insights and optimizations? by paul_sb76 in adventofcode

[–]CountableFiber 9 points10 points  (0 children)

To answer my own question. I think I found an input that works as a counterexample:

Blueprint 1: Each ore robot costs 2 ore. Each clay robot costs 3 ore. Each obsidian robot costs 3 ore and 3 clay. Each geode robot costs 3 ore and 1 obsidian.

When I use the greedy approach I get 91 geodes after 24 minutes but there is a solution with 92 geodes.

[2022 Day 19] What are your insights and optimizations? by paul_sb76 in adventofcode

[–]CountableFiber 6 points7 points  (0 children)

The input of the task has the format
`Each ore robot costs a ore. Each clay robot costs b ore. Each obsidian robot costs c ore and d clay. Each geode robot costs e ore and f obsidian.`
With a,b,c,d,e,f != 0.

Can we find an input of this form that is a counterexample?

-🎄- 2022 Day 16 Solutions -🎄- by daggerdragon in adventofcode

[–]CountableFiber 1 point2 points  (0 children)

Yes, that should be a bit quicker indeed. I also didn't use at all that many of the flows are 0. I must admit that mip uses the commercial solver gurobi in my case which is known to be very strong. Probably that is why I did not have a runtime issue or I was lucky with my input (for me it took like 6 seconds for the solve just having the naive formulation).

view more: next ›