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))
|
Project Euler: Problem 2, Sum of even Fibonacci
457 Solvers
Create a square matrix of multiples
330 Solvers
435 Solvers
Rotate input square matrix 90 degrees CCW without rot90
304 Solvers
Write c^3 as sum of two squares a^2+b^2
243 Solvers