lwhjp

joined 2 years ago
MODERATOR OF
[–] lwhjp 10 points 3 days ago

That's lovely!

[–] lwhjp 3 points 1 week ago (1 children)

Hehe. Nice observation!

Although, isn't this basically Newton's method of square roots? I don't recall how floating point implementations usually do it, but it's not too surprising that the performance is similar to the algebraic approach.

[–] lwhjp 7 points 1 week ago

That's nice to hear. I recognize a lot of what you're saying <3

It feels good to be able to open up to people at last.

[–] lwhjp 4 points 2 weeks ago

Whee! Another time sink! /subscribe

[–] lwhjp 15 points 2 weeks ago (4 children)

I might have spent an unusual amount of time recently reading up on ADHD. Am I going to do anything about it? Ha ha ha.

[–] lwhjp 3 points 1 month ago

Yep, a good lesson about communication here!

I've stolen plenty of content from FMA as DM in my own games, but trying to play an expy of some existing character is unlikely to go well.

[–] lwhjp 5 points 1 month ago
[–] lwhjp 10 points 1 month ago (2 children)

I tried some of this recently. The peach flavor was a bit too sweet for me, but the plain stuff is <3

[–] lwhjp 9 points 1 month ago (1 children)

That sounds lIke fun! What do you do about hills? Do you have power assist?

[–] lwhjp 2 points 1 month ago

I agree with 15: I solved it pretty quickly and I like my solution, but what makes me really happy is that I'm pretty sure I couldn't have solved it a few years ago.

Also day 11 (Plutonian pebbles): it's such a simple problem, and part two is a perfect example of how and why to use dynamic programming. I've been encouraging everyone to try it.

[–] lwhjp 7 points 1 month ago

It was nice to see some of the same faces (as it were) again from last year!

Also great to see more Haskell solutions, and props to those crazy enough to write in J and Uiua.

[–] lwhjp 4 points 1 month ago
 

We all know and love (!) the leaderboard, but how about a different method?

One can solve a problem with a simple, naive method resulting in a short program and long runtime, or put in lots of explicit optimizations for more code and shorter runtime. (Or if you're really good, a short, fast program!)

I propose the line-second.

Take the number of lines in your program (eg, 42 lines) and the runtime (eg 0.096 seconds). Multiply these together to get a score of 4.032 line-seconds.

A smaller score is a shorter, faster program.

Similarly, (for a particular solver), a larger score is a "harder" problem.

 

Tried a little too hard to go with a theme on this one, and some of the clues are a bit contrived. Feel free to suggest alternatives!

4
Puzzle #5 (lwh.jp)
submitted 2 years ago by lwhjp to c/cruciverbalism
 

Here's an old puzzle of mine to get started. One of the clues (at least!) is a little unfair, but the puzzle has been solved by others so it should be possible. Comments much appreciated, and more to come...

view more: next ›