Discussion @ 1603. Erudite @ Timus Online Judge

Nurbek_[KTMU MANAS] WA #3 Again! [3] // Problem 1603. Erudite 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

-AlexandeR- (TNU) Re: WA #3 Again! [2] // Problem 1603. Erudite 7 Mar 2008 10:21

test 3 contains "\n" strings

Nurbek_[KTMU MANAS] Re: WA #3 Again! // Problem 1603. Erudite 7 Mar 2008 13:47

How? I can't understand. Please explain better.

TheDreamCatcher Re: WA #3 Again! // Problem 1603. Erudite 30 Nov 2010 07:51

-AlexandeR- (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

Discussion of Problem 1603. Erudite