programming

Mar
15

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

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

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

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