APL Hacking: Project Euler Daily (#15)
This was a problem to find all of the forward searching paths in a 20 by 20
grid. This is
APL Hacking: Project Euler Daily (#14)
This problem was interesting in all different ways. It asks for Collatz Sequence
counts. First, I tried to do the
APL Hacking: Project Euler Daily (#13)
So, this is actually my post for Friday, but since I was traveling, I was not
able to post anything
APL Hacking: Project Euler Daily (#12)
This was the first problem that I had to deal with that didn't work right or
quickly if
APL Hacking: Project Euler Daily (#11)
I really liked doing this one. I had no idea how to approach this idea at first.
I couldn'
What I love about Ruby
Here is something that I find really entertaining about Ruby:
d/ruby-1.9.1_p430-x86_64-2.txz: Rebuilt.
[note, the
APL Hacking: Project Euler Daily (#10)
This was a bit of a fun one, since I had trouble trying to get the result into a
32-bit
X Windows, AltGr, and Mode_switch
I have an application that detects and uses the AltGr key by assuming that mod2
is assigned to the AltGr
APL Hacking: Project Euler Daily (#9)
Finally, we get an interesting one. In this problem, I struggled with a desire
to express the solution simply, and
APL Hacking: Project Euler Daily (#8)
Again, this problem was just too easy. I wonder why this one was even given
actually, because in something like