Cody

Solution 1792339

Submitted on 18 Apr 2019 by Nicolas
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))

fib = 1 1 f = 1

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

fib = 5 3 2 1 1 f = 1 3

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

fib = 8 5 3 2 1 1 f = 1 5

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

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

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

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

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

fib = Columns 1 through 15 14930352 9227465 5702887 3524578 2178309 1346269 832040 514229 317811 196418 121393 75025 46368 28657 17711 Columns 16 through 30 10946 6765 4181 2584 1597 987 610 377 233 144 89 55 34 21 13 Columns 31 through 36 8 5 3 2 1 1 f = 2 9227465

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

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