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))
|
Find the two most distant points
1233 Solvers
522 Solvers
2110 Solvers
264 Solvers
235 Solvers