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 Solvers950
Suggested Problems
-
Find state names that start with the letter N
1489 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2898 Solvers
-
Reverse the elements of an array
1131 Solvers
-
850 Solvers
-
1066 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
=)))