Look and Say Binary 179
Back to Problem Solutions forum
Hi!
Excuse me for such simple question, but i can not understand the second part of this task: "and how many other sequences produce the given one on the first step (i.e. how many "parents" it have)"
1110100011000011001001001111011110000100111000101110111100 for this input we have as answer =536870912. It is example case from the problem.
So, just explane me what is does this mean.
Thanks a lot!
For the input
11
the output is
1 2
because it takes one move to reach 10 and there are two parents, or ways of getting to 11 (10 & 111).
So "and how many other sequences produce the given one on the first step (i.e. how many "parents" it have)" - means that we 536870912 ways or parents of getiing to 1110100011000011001001001111011110000100111000101110111100 ?
If there is someone alive out there, I don't understand why 11 only has two parents, technically it doesn't have 3. That is, 000, 111, 10. Why is 000 ignored?
By the way, I called admin by mistake, sorry
Plenty of alive people here. :)
000 is not a look-and-say binary sequence. Here's the most important sentence of the problem:
any binary value starts with 1, so first sequence always consists of 1-s;
This is a great problem, by the way. Requires one blinding flash of insight and that's pretty much it.
oh thank you very much for the help