|
|
|
| Perl: the Markov chain saw | |
| PerlMonks |
Re^8: Challenge: 8 Letters, Most Wordsby choroba (Cardinal) |
| on Oct 05, 2013 at 11:28 UTC ( [id://1057023]=note: print w/replies, xml ) | Need Help?? |
|
Another idea: preprocess the input, adding all the combinations of the shorter words. Then run the original code without postprocessing. I will try to test it later, not much time at the moment...
لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||||||