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 =[0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
2 | Pass |
%%
n = 2;
y_correct =[11 11
0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
3 | Pass |
%%
n = 3;
y_correct =[11 11 11
0 0 11
0 0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
4 | Pass |
%%
n = 4;
y_correct =[11 11 11 11
0 0 0 11
0 0 11 11
0 0 0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
5 | Pass |
%%
n = 5;
y_correct =[11 11 11 11 11
0 0 0 0 11
0 0 11 0 11
0 0 11 11 11
0 0 0 0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
6 | Pass |
%%
n = 10;
y_correct =[11 11 11 11 11 11 11 11 11 11
0 0 0 0 0 0 0 0 0 11
0 0 11 11 11 11 11 11 0 11
0 0 11 0 0 0 0 11 0 11
0 0 11 0 11 11 0 11 0 11
0 0 11 0 11 0 0 11 0 11
0 0 11 0 11 11 11 11 0 11
0 0 11 0 0 0 0 0 0 11
0 0 11 11 11 11 11 11 11 11
0 0 0 0 0 0 0 0 0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
7 | Pass |
%%
n = 17;
y_correct =[11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11
0 0 11 11 11 11 11 11 11 11 11 11 11 11 11 0 11
0 0 11 0 0 0 0 0 0 0 0 0 0 0 11 0 11
0 0 11 0 11 11 11 11 11 11 11 11 11 0 11 0 11
0 0 11 0 11 0 0 0 0 0 0 0 11 0 11 0 11
0 0 11 0 11 0 11 11 11 11 11 0 11 0 11 0 11
0 0 11 0 11 0 11 0 0 0 11 0 11 0 11 0 11
0 0 11 0 11 0 11 0 11 0 11 0 11 0 11 0 11
0 0 11 0 11 0 11 0 11 11 11 0 11 0 11 0 11
0 0 11 0 11 0 11 0 0 0 0 0 11 0 11 0 11
0 0 11 0 11 0 11 11 11 11 11 11 11 0 11 0 11
0 0 11 0 11 0 0 0 0 0 0 0 0 0 11 0 11
0 0 11 0 11 11 11 11 11 11 11 11 11 11 11 0 11
0 0 11 0 0 0 0 0 0 0 0 0 0 0 0 0 11
0 0 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0];
assert(isequal(Matrix_Spiral(n),y_correct))
|
735 Solvers
1102 Solvers
729 Solvers
Given a window, how many subsets of a vector sum positive
673 Solvers
96 Solvers