This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Not really my work; the previous leader did this, I simply reduced the size by 2 using the 'ans trick'.
This is not really the correct solution, as for large n it will eventually produce inaccurate results.
True. It can be improved a bit though by using more decimals for phi.
| 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))
|
512 Solvers
347 Solvers
921 Solvers
Find perfect placement of non-rotating dominoes (easier)
222 Solvers
352 Solvers