|
|
back to boardTo admins: not completely clear Russian problem statement Posted by MVM 30 Jul 2014 20:04 It is said that text contains not more than 1000 words,
but limitations on length of words exist (in statement)
only for dictionary. It means that (technically)
Russian statement does not bound length of text
at all.
So, can you tweak problem statement a bit to make it more clear, please?
Edited by author 30.07.2014 20:05 Re: To admins: not completely clear Russian problem statement +1 I agree, the statement isn't clear. You don't even know how much memory you're supposed to allocate for the text/words in the text. I just had to assume that the words weren't bigger than 1000 symbols.
Anyway, now that I solved it and tested it, I can confirm that length of the words in the text doesn't exceed 8 symbols as well. |
|
|
