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 |
n = 1;
y_correct = 1;
assert(isequal(your_fcn_name(n),y_correct))
|
2 | Pass |
n = 2;
y_correct = 3;
assert(isequal(your_fcn_name(n),y_correct))
|
3 | Pass |
n = 3;
y_correct = 7;
assert(isequal(your_fcn_name(n),y_correct))
|
4 | Pass |
n = 4;
lol_correct = 15;
assert(isequal(your_fcn_name(n),lol_correct))
|
5 | Pass |
n = 5;
y_correct = 31;
assert(isequal(your_fcn_name(n),y_correct))
|
6 | Pass |
n = 6;
y_correct = 63;
assert(isequal(your_fcn_name(n),y_correct))
|
1311 Solvers
Sum all integers from 1 to 2^n
6327 Solvers
324 Solvers
301 Solvers
197 Solvers