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 I used
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't think
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
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
APL Hacking: Project Euler Daily (#7)
Nothing much to say about this one. I use the basic prime sieve on this one. I
am still playing
APL Hacking: Project Euler Daily (#6)
This one was too easy, I probably am doing it wrong.
R←PESIX;⎕IO
⎕IO←1
⍝ Difference between the sum
APL Hacking: Project Euler Daily (#5)
I really do not like my solution here, but it was the simplest at the time. I
think that there
APL Hacking: Project Euler Daily (#4)
When I first did this problem, I encoded the numbers, did a 1st axis rotate, and
then decoded both vectors