This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Didn't understand question
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Fail |
n = 1;
area_correct = 25;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 2 | Fail |
n = 2;
area_correct = 41;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 3 | Fail |
n = 3;
area_correct = 66;
tolerance = 1e-12;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
| 4 | Fail |
n = 50;
area_correct = 439116598409;
tolerance = 1e-3;
assert(abs(triangle_sequence(n)-area_correct)<tolerance)
|
Find the longest sequence of 1's in a binary sequence.
2200 Solvers
4496 Solvers
Find common elements in matrix rows
671 Solvers
Getting the absolute index from a matrix
172 Solvers
142 Solvers