Cody

Solution 677907

Submitted on 30 May 2015 by Jean-Marie Sainthillier
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% n = 1; f_correct = 1; assert(isequal(fib_decomposition(n),f_correct))

2   Pass
%% n = 4; f_correct = [1 3]; assert(isequal(fib_decomposition(n),f_correct))

3   Pass
%% n = 6; f_correct = [1 5]; assert(isequal(fib_decomposition(n),f_correct))

4   Pass
%% n = 2010; f_correct = [2 34 377 1597]; assert(isequal(fib_decomposition(n),f_correct))

5   Pass
%% n = 35601; f_correct = [1 34 144 6765 28657]; assert(isequal(fib_decomposition(n),f_correct))

6   Pass
%% n = 9227467; f_correct = [2 9227465]; assert(isequal(fib_decomposition(n),f_correct))

7   Pass
%% n = 2015; f_correct = [2 5 34 377 1597]; assert(isequal(fib_decomposition(n),f_correct))