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(pwr(n),y_correct))
|
2 | Pass |
n = 2;
y_correct = 4;
assert(isequal(pwr(n),y_correct))
|
3 | Pass |
n = 3;
y_correct = 27;
assert(isequal(pwr(n),y_correct))
|
4 | Pass |
n = 4;
y_correct = 256;
assert(isequal(pwr(n),y_correct))
|
5 | Pass |
n = 5;
y_correct = 3125;
assert(isequal(pwr(n),y_correct))
|
6 | Pass |
n = 9;
y_correct = 387420489;
assert(isequal(pwr(n),y_correct))
|
984 Solvers
Project Euler: Problem 6, Natural numbers, squares and sums.
782 Solvers
Create a two dimensional zero matrix
274 Solvers
Finding perimeter of a rectangle
193 Solvers
25 Solvers