Cody

Solution 1875662

Submitted on 16 Jul 2019 by Fabrice Yvan Ibrahim Mengoua
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))

f = 1 1 3 f = 1 3

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

f = 1 1 5 f = 1 5

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

f = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 1597 f = 1 1 2 3 5 8 13 21 34 377 1597 f = 1 1 2 34 377 1597 f = 2 34 377 1597

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

f = Columns 1 through 15 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 Columns 16 through 21 987 1597 2584 4181 6765 28657 f = 1 1 2 3 5 8 13 21 34 55 89 144 6765 28657 f = 1 1 2 3 5 8 13 21 34 144 6765 28657 f = 1 1 34 144 6765 28657 f = 1 34 144 6765 28657

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

f = 1 1 2 9227465 f = 2 9227465

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

f = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 1597 f = 1 1 2 3 5 8 13 21 34 377 1597 f = 1 1 2 3 5 34 377 1597 f = 1 1 2 5 34 377 1597 f = 2 5 34 377 1597

Suggested Problems

More from this Author63