|
|
back to boardIdea. Please, give me some hints and idea. I write bruteForce but i see no hints. Only random 0 and 1. Re: Idea. Length of the answer is 2^n + n - 1, it can be constructed with brute-force Re: Idea. Thank you. Please, give me more hints. =) Re: Idea. Above hint is more than enough to solve it. The only possible latest hint: during BF, when construct a sequence, think how to check in O(1) that the new suffix of length n didn't occur in the sequence before. Re: Idea. Posted by QProgS 28 Jan 2014 19:32 |
|
|