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/
Project Euler: Problem 3, Largest prime factor
124 Solvers
Similar Triangles - find the height of the tree
130 Solvers
128 Solvers
289 Solvers
554 Solvers