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 |
x = 1;
y_correct = 3600000;
assert(isequal(your_fcn_name(x),y_correct))
|
14348 Solvers
Sum all integers from 1 to 2^n
6327 Solvers
Basics: Divide integers to get integer outputs in all cases
92 Solvers
377 Solvers
123 Solvers