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
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers925
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6696 Solvers
-
Extract leading non-zero digit
2246 Solvers
-
Matlab Basics - Convert a row vector to a column vector
679 Solvers
-
4520 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2147 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
=)))