Every positive integer has a unique decomposition into nonconsecutive Fibonacci numbers f1+f2+ ... Given a positive integer n, return these numbers.
Return the vector f = [f1, f2, ...] sorted from smallest to largest. sum(f) = n.
Examples
n = 3 f = 3
n = 32 f = [3 8 21]
Reference: http://www.johndcook.com/blog/2015/05/17/fibonacci-number-system/
Make the vector [1 2 3 4 5 6 7 8 9 10]
29477 Solvers
Make a run-length companion vector
453 Solvers
401 Solvers
Spot the First Occurrence of 5
307 Solvers
85 Solvers