Cody

Problem 42340. Fibonacci Decomposition

Created by Ned Gulley in Community

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

60.61% Correct | 39.39% Incorrect
Last solution submitted on May 23, 2019

Problem Comments