Problem 42340. Fibonacci Decomposition
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
Dang Quang Ha
on 16 May 2022
quá ghê gớm, và đây là Folontilo
Le
on 6 Dec 2024
=)))
Solution Comments
Show commentsProblem Recent Solvers758
Suggested Problems
-
13590 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15632 Solvers
-
4421 Solvers
-
Determine Whether an array is empty
784 Solvers
-
Find x rows where the sum of the numbers is the maximum
459 Solvers
More from this Author50
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!