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 the sum of all the numbers of the input vector
54884 Solvers
-
Project Euler: Problem 7, Nth prime
1773 Solvers
-
Find best placement for ordered dominoes (harder)
352 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
589 Solvers
-
10627 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
=)))