|
|
back to boardWA #3 Again! Please explain me where is tricky? If you don't want say tricky, give some tests. I use backtracking. Edited by author 06.03.2008 16:22 Edited by author 06.03.2008 16:23 Re: WA #3 Again! test 3 contains "\n" strings Re: WA #3 Again! How? I can't understand. Please explain better. Re: WA #3 Again! test 3 contains "\n" strings This is impossible. In the next N strings follow N words with length between 1 and 16 |
|
|