Cody

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/

Solve

Solution Stats

35.49% Correct | 64.51% Incorrect
Last Solution submitted on Nov 18, 2019

Problem Comments

Problem Recent Solvers76

Suggested Problems

More from this Author63

Problem Tags

fibonacci