Обсуждение @ 1603. Эрудит @ Timus Online Judge

WA #3 Again!

Послано Nurbek_[KTMU MANAS] 6 мар 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!

Послано Alexander (201 - P TNU) 7 мар 2008 10:21

test 3 contains "\n" strings

Re: WA #3 Again!

Послано Nurbek_[KTMU MANAS] 7 мар 2008 13:47

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

Re: WA #3 Again!

Послано TheDreamCatcher 30 ноя 2010 07:51

Alexander (201 - P TNU) писал(a) 7 марта 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

Обсуждение задачи 1603. Эрудит