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 = 3;
y_correct = [1 1 1;0 1 0;1 1 1];
assert(isequal(Z(n),y_correct))
ans =
1 1 1
0 1 0
1 1 1
|
2 | Pass |
n = 4;
y_correct = [1 1 1 1;0 0 1 0; 0 1 0 0; 1 1 1 1];
assert(isequal(Z(n),y_correct))
ans =
1 1 1 1
0 0 1 0
0 1 0 0
1 1 1 1
|
3 | Pass |
n = 5;
y_correct = [1 1 1 1 1; 0 0 0 1 0; 0 0 1 0 0; 0 1 0 0 0; 1 1 1 1 1];
assert(isequal(Z(n),y_correct))
ans =
1 1 1 1 1
0 0 0 1 0
0 0 1 0 0
0 1 0 0 0
1 1 1 1 1
|
2233 Solvers
Project Euler: Problem 9, Pythagorean numbers
157 Solvers
204 Solvers
129 Solvers
502 Solvers