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
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
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
APL Hacking: Project Euler Daily (#1)
This is the first of a series of posts as I go through Project Euler in APL to
stretch my