Re: Fun Test Problem
- Posted by useless May 22, 2010
- 1705 views
And don't you think the count will go up with the 5000 word dictionary?
Kat, I think you are missing an important point in the problem description. The input to the program will always contain the entire dictionary of known words.
So in the example given the we know that there are only five known words in total. The patterns given are to be matched against only those five words, and thus all other possible words are to be ignored.
Actually, the point i was missing was: "where X is the test case number, starting from 1, and K indicates how many words in the alien language match the pattern.", not which words are matched.
David Cuny got me started on a spell checker years ago, and i think the only thing it doesn't do is count how many possible matches there are, tho it does everything else.
useless
