apl

Mar
09

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'
2 min read
Mar
08

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
Mar
06

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
1 min read
Mar
05

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
1 min read
Mar
05

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
Mar
03

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
Mar
02

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
1 min read
Mar
01

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
Feb
28

APL Hacking: Project Euler Daily (#3)

For this problem, I had originally computed a very slow and annoying algorithm until I realized that computing the prime
2 min read
Feb
27

APL Hacking: Project Euler Daily (#2)

For this one, I could not come up with a solution that did not have a loop in it, but