Of course, this solution, while short, is NOT the best solution! Clearly the best solution is the far more efficient: n*(n+1)/2
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
t = 1;
assert(isequal(triangle(n),t))
|
2 | Pass |
%%
n = 3;
t = 6;
assert(isequal(triangle(n),t))
|
3 | Pass |
%%
n = 5;
t = 15;
assert(isequal(triangle(n),t))
|
4 | Pass |
%%
n = 30;
t = 465;
assert(isequal(triangle(n),t))
|
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
221 Solvers
Getting the indices from a matrice
268 Solvers
410 Solvers
222 Solvers