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/
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers950
Suggested Problems
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
Find the maximum number of decimal places in a set of numbers
3548 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
692 Solvers
-
Sum of odd numbers in a matrix
620 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2211 Solvers
More from this Author54
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
quá ghê gớm, và đây là Folontilo
=)))