|
|
вернуться в форумI use a recursive algorithm, but get TIME LIMIT EXCED. I think this problem is very easy :) U don't need to find out the sequence of cells of each word if a[x] is the number of letter x on the grid b[x] is the number of letter x in all the words then the number of letter x in the hidden word is a[x] - b[x] Thanks a lot, it helps me to solve this problem without my stupid idea... |
|
|