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))
|
Select every other element of a vector
16251 Solvers
Maximum running product for a string of numbers
817 Solvers
Sum of diagonal of a square matrix
1159 Solvers
Return unique values without sorting
488 Solvers
229 Solvers