This solution doesn't work after n=23.
It's still one hell of a hack! :)
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
f = 1;
assert(isequal(fib(n),f))
|
2 | Pass |
%%
n = 6;
f = 8;
assert(isequal(fib(n),f))
|
3 | Pass |
%%
n = 10;
f = 55;
assert(isequal(fib(n),f))
|
4 | Pass |
%%
n = 20;
f = 6765;
assert(isequal(fib(n),f))
|
2726 Solvers
337 Solvers
Return unique values without sorting
488 Solvers
Set the array elements whose value is 13 to 0
752 Solvers
The sum of the numbers in the vector
341 Solvers