APL Hacking: Project Euler (#30)
I figure it's about time I posted another Project Euler.
Problem #30 [http://projecteuler.net/index.php?section=
Revisiting Send + More = Money
In my last post [http://my.opera.com/arcfide/blog/send-more-money] I attempted
to solve the Send + More = Money Cryptarithmetic
Send + More = Money
After talking with Prof. Friedman, he gave me an interesting constraint problem.
This is a well known example of a
APL Hacking: Project Euler (#29)
Problem #29 [http://projecteuler.net/index.php?section=problems&id=29]:
∇Z←PETWENTYNINE;⎕IO
⎕IO←1
⍝ Compute the cardinality
APL Hacking: Project Euler (#28)
Problem #28 [http://projecteuler.net/index.php?section=problems&id=28]:
Z←PETWENTYEIGHT
⍝ Sum of the diagonals of a
APL Hacking; Project Euler (#27)
Problem #27 [http://projecteuler.net/index.php?section=problems&id=27]:
∇Z←PETWENTYSEVEN;A;B;X;P
⍝ Find the
APL Hacking: Project Euler (#26)
Problem #26 [http://projecteuler.net/index.php?section=problems&id=26]:
∇Z←CYCLE∆LENGTH N;A;I;R
⍝ Find
APL Hacking: Project Euler (#25)
Problem #25 [http://projecteuler.net/index.php?section=problems&id=25]:
∇R←PETWENTYFIVE;I;A;X;⎕IO;B;D
APL Hacking: Project Euler (#24)
Problem #24 [http://projecteuler.net/index.php?section=problems&id=24]:
∇R←PETWENTYFOUR;N;A;I
⍝ Compute the 1,
APL Hacking: Project Euler (#23)
Problem #23 [http://projecteuler.net/index.php?section=problems&id=23]:
∇R←PETWENTYTHREE;ABDP;N;X
⍝ Find the sum