This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
assert(isequal(newFibo(1),1))
|
| 2 | Pass |
assert(isequal(newFibo(2),1))
|
| 3 | Pass |
assert(isequal(newFibo(3),1))
|
| 4 | Pass |
assert(isequal(newFibo(4),2))
|
| 5 | Pass |
assert(isequal(newFibo(5),5))
|
| 6 | Pass |
assert(isequal(newFibo(6),21))
|
| 7 | Pass |
assert(isequal(newFibo(8),10946))
|
| 8 | Pass |
assert(isequal(newFibo(9),5702887))
|
Return the 3n+1 sequence for n
4919 Solvers
2045 Solvers
Find best placement for ordered dominoes (harder)
188 Solvers
518 Solvers
find the maximum element of the matrix
238 Solvers