Commits

Author Commit Message Labels Comments Date
Shlomi Fish
More optimisation to 149.
Shlomi Fish
More optimisation.
Shlomi Fish
More optimisation.
Shlomi Fish
Optimisation for 149-opt1.pl.
Shlomi Fish
Add 149.pl - it generates the right results.
Shlomi Fish
Add more to problem #75.
Shlomi Fish
Now actually added the modifications.
Shlomi Fish
Add take 3. The $new_layer_count calculation is now O(1) instead of O(X*Y*Z). Still too slow though.
Shlomi Fish
Take 2 for #126 optimised the algorithm. Now we don't hold the entire layered cuboids in RAM and instead calculate the number of squares in the layer based on their distance from the cuboid. The next step is to find a formula to calculate new_layer_count from depth right away.
Shlomi Fish
Now No. 126 appears to yield the right results. However, the naive approach appears to be too slow.
Shlomi Fish
Fix more bugs, but $new_layer_count is always zero.
Shlomi Fish
Fix a bug or two.
Shlomi Fish
No. 126 should work now. Not sure it will - I have not run it yet.
Shlomi Fish
Add Euler #126. It is still the start.
Shlomi Fish
Add the wrong Euler #127 solution. It doesn't find all the abc hits for c < 1000.
Shlomi Fish
Add the solution to Euler #106.
Shlomi Fish
Solved #122 with take5.
Shlomi Fish
Add the take4.
Shlomi Fish
Add more to the planning.
Shlomi Fish
Add the wrong take3.
Shlomi Fish
Add more to the planning.
Shlomi Fish
Add the #122 planning document.
Shlomi Fish
Add a new version that does not check for containments. It consumes a lot of RAM though.
Shlomi Fish
Optimised Euler #122. It still takes too long for its own good.
Shlomi Fish
Merged.
Shlomi Fish
Some bug fixes.
Shlomi Fish
Changed to a faster (but faulty) algorithm. Euler 122.
Shlomi Fish
Add the first version.
Shlomi Fish
Add the solution to 125.
Shlomi Fish
Add a working solution to Euler-119. Fun problem that. This take3 takes a different approach which is much more efficient.
  1. Prev
  2. Next