|Welcome to the Monastery|
challenging the dictionaryby Discipulus (Abbot)
|on Apr 27, 2004 at 11:12 UTC||Need Help??|
Discipulus has asked for the wisdom of the Perl Monks concerning the following question:
Hi wise monks !
I had a idea but I need some suggestion to start it correctly.
The question is: given a dictionary file I want to find out the minimal number of words that use all the letters of a given alphabet
It sounds mad ?? please can u address me ??
cheers from sunny roma