This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
more elegant solution than a loop: Use the LDL decomposition on the bullseye matrix and you will find an interesting L and D matrix. THe D matrix is diagonale and can be built using n only. THe matrix L is the sum of a lower triangular matrix whose lowest part is put to zero using the mirrored triangular matrix. Finally the identity matrix is added :)
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
%%
n = 5;
a = [3 3 3 3 3;
3 2 2 2 3;
3 2 1 2 3;
3 2 2 2 3;
3 3 3 3 3];
assert(isequal(bullseye(n),a));
|
| 2 | Pass |
%%
n = 7;
a = [4 4 4 4 4 4 4;
4 3 3 3 3 3 4;
4 3 2 2 2 3 4;
4 3 2 1 2 3 4;
4 3 2 2 2 3 4;
4 3 3 3 3 3 4;
4 4 4 4 4 4 4];
assert(isequal(bullseye(n),a))
|
272 Solvers
457 Solvers
Number of 1s in a binary string
753 Solvers
279 Solvers
159 Solvers