On Mon, Jul 02, 2001 at 12:44:10PM +0100, Greg McCarroll wrote: > * Mark Fowler ([EMAIL PROTECTED]) wrote: > > On Mon, 2 Jul 2001, Greg McCarroll wrote: > > > > > So here is the challenge. You have to write a Perl program that takes > > > two arguments, the first is the start word and the second is the finish > > > word. The Perl program will then use /usr/dict/words to find > > > the shortest word chain between the words. The winning program > > > will be the one that solves the problem the fastest over 3 different > > > tests. There is a limit on the source code size of 10k, to prevent people > > > preconfiguring datasets in the source. Will length($word) == 4 ??
- Proposal : The First Monthly London.pm Programming Challen... Greg McCarroll
- Re: Proposal : The First Monthly London.pm Programmin... Marcel Grunauer
- Re: Proposal : The First Monthly London.pm Progra... Greg McCarroll
- Re: Proposal : The First Monthly London.pm Progra... Roger Horne
- Re: Proposal : The First Monthly London.pm Programmin... Mark Fowler
- Re: Proposal : The First Monthly London.pm Programmin... Greg McCarroll
- Re: Proposal : The First Monthly London.pm Programmin... Steve Keay
- Re: Proposal : The First Monthly London.pm Programmin... Greg McCarroll
- Re: Proposal : The First Monthly London.pm Programmin... Piers Cawley
- Re: Proposal : The First Monthly London.pm Progra... Greg McCarroll