Cody

Solution 1831131

Submitted on 30 May 2019 by Margaret Hoeller
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))

f = 1

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

fp = 3 1 rem = 0 f = 1 3

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

fp = 5 1 rem = 0 f = 1 5

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

fp = 1597 377 rem = 36 fp = 1597 377 34 rem = 2 fp = 1597 377 34 2 rem = 0 f = 2 34 377 1597

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

fp = 28657 6765 rem = 179 fp = 28657 6765 144 rem = 35 fp = 28657 6765 144 34 rem = 1 fp = 28657 6765 144 34 1 rem = 0 f = 1 34 144 6765 28657

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

fp = 9227465 2 rem = 0 f = 2 9227465

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

fp = 1597 377 rem = 41 fp = 1597 377 34 rem = 7 fp = 1597 377 34 5 rem = 2 fp = 1597 377 34 5 2 rem = 0 f = 2 5 34 377 1597

Suggested Problems

More from this Author49