blob: 7a3090045584d9b3a8b88ee5ede363471998504f (
plain)
1
2
3
4
5
6
7
8
9
|
Solution by Ruben Westerberg
ch-1.pl and ch-1.p6
===
Simply run the program to generate the Van Eck’s sequence. If no argument is provided the first 10 items are printed.
ch-2.pl and ch-2.p6
===
Run the program to find the longest English word possible from US state abbreviations. Uses words_alpha.txt as valid word list. An external word list can be used by providing its path as a single argument.
|
