# Given a string S of digits, such as S = "123456579", # we can split it into a Fibonacci-like sequence [123, 456, 579]. # and F[i] + F[i+1] = F[i+2] for all 0 <= i < F.length - 2. # Also, note that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results