ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1603. Erudite

WA #3 Again!
Posted by Nurbek_[KTMU MANAS] 6 Mar 2008 16:19
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!
Posted by Alexander (201 - P TNU) 7 Mar 2008 10:21
test 3 contains "\n" strings
Re: WA #3 Again!
Posted by Nurbek_[KTMU MANAS] 7 Mar 2008 13:47
How? I can't understand. Please explain better.
Re: WA #3 Again!
Posted by TheDreamCatcher 30 Nov 2010 07:51
Alexander (201 - P TNU) wrote 7 March 2008 10:21
test 3 contains "\n" strings

This is impossible. In the next N strings follow N words with length between 1 and 16