Good M{o,r,n,i,n}ghttp://norman.walsh.name/2004/08/26/goodMorning71532004-08-26T10:28:33-04:00$Date: 2005-09-11 10:27:02 -0400 (Sun, 11 Sep 2005) $NormanWalsh2004Norman WalshA little silliness and a very crude Perl program.It all started innocently enough. GregElin joins
#rdfig and
says “monring”: <GregElin> | monring
<balbinus> | mroinng
<ndw> | morinng
<Talliesin> | mornnigA brief debate ensues about how many possibilities there are. The guesses
range from 25 to 120. The answer is 60:minnorg
minnrog
minonrg
minorng
minrnog
minrong
mionnrg
mionrng
miornng
mirnnog
mirnong
mironng
mninorg
mninrog
mnionrg
mniorng
mnirnog
mnirong
mnniorg
mnnirog
mnnoirg
mnnorig
mnnriog
mnnroig
mnoinrg
mnoirng
mnonirg
mnonrig
mnoring
mnornig
mnrinog
mnriong
mnrniog
mnrnoig
mnroing
mnronig
moinnrg
moinrng
moirnng
moninrg
monirng
monnirg
monnrig
monring
monrnig
morinng
morning
mornnig
mrinnog
mrinong
mrionng
mrninog
mrniong
mrnniog
mrnnoig
mrnoing
mrnonig
mroinng
mroning
mronnigActually, I think the answer is 59. I don’t think “morning” should count.I built that list with a very crude
Perl script:@c1 = ('o', 'r', 'n', 'i', 'n');
my %uniq = (); # the n's are not distinct, use a hash to get rid of "dups"
for my $p1 (0..4) {
for my $p2 (0..4) {
next if $p2 == $p1;
for my $p3 (0..4) {
next if $p3 == $p1 || $p3 == $p2;
for my $p4 (0..4) {
next if $p4 == $p1 || $p4 == $p2 || $p4 == $p3;
for my $p5 (0..4) {
next if $p5 == $p1 || $p5 == $p2 || $p5 == $p3 || $p5 == $p4;
$uniq{"m" . $c1[$p1].$c1[$p2].$c1[$p3].$c1[$p4].$c1[$p5] . "g"} = 1;
}
}
}
}
}
foreach my $word (sort keys %uniq) {
print "$word\n";
}Can anyone think of a better way?Let’s just leave the question of whether or not this exercise was worth
the time unanswered, ok?