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 = [15 15 15 15]; %row sum, col sum, main diag sum, other diag sum
[a b c d] = MagicSquare(n);
assert(isequal([a b c d],y_correct))
|
2 | Pass |
n = 5;
y_correct = [65 65 65 65]; %row sum, col sum, main diag sum, other diag sum
[a b c d] = MagicSquare(n);
assert(isequal([a b c d],y_correct))
|
3 | Pass |
n = 9;
y_correct = [369 369 369 369]; %row sum, col sum, main diag sum, other diag sum
[a b c d] = MagicSquare(n);
assert(isequal([a b c d],y_correct))
|
4 | Pass |
n = 15;
y_correct = [1695 1695 1695 1695]; %row sum, col sum, main diag sum, other diag sum
[a b c d] = MagicSquare(n);
assert(isequal([a b c d],y_correct))
|
Find the two most distant points
1233 Solvers
Remove the small words from a list of words.
474 Solvers
271 Solvers
Return a list sorted by number of consecutive occurrences
110 Solvers
412 Solvers