APL Hacking: Project Euler (#22)
Problem 22 [http://projecteuler.net/index.php?section=problems&id=22]:
∇R←PETWENTYTWO NAMES;X
⍝ Receiving a 1×N
APL Hacking: Project Euler (#21)
Problem #21 [http://projecteuler.net/index.php?section=problems&id=21]:
∇R←PETWENTYONE;X;Y;Z
⍝ Compute the sum
APL Hacking: Project Euler (#20)
I was avoiding this one for a while simply because I wanted to have a better
carry algorithm in mind.
APL Hacking: Project Euler (#19)
I didn't really have a good idea of how to solve this one until I started
playing around
Histograms in APL/Scheme
Eric gave a talk today about the Connection Machines and CM Lisp. One of the
examples was of a way
APL Hacking: Project Euler (#18)
You notice that these are not daily anymore. :)
For this one, I took advantage of the ability to rotate vectors
APL Hacking: Project Euler Daily (#17)
This one I did the old fashioned way at first, with a loop and a lot of cases
and branching.
APL Hacking: Project Euler Daily (#16)
For this problem, I could have reused my CARRY function from before, but it
seemed like it would only make
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