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 |
x = magic(6);
y_correct = 111;
assert(isequal(sum_of_sec_diag(x),y_correct))
|
2 | Pass |
x = magic(10);
y_correct = 505;
assert(isequal(sum_of_sec_diag(x),y_correct))
|
3 | Pass |
x = magic(11);
y_correct = 671;
assert(isequal(sum_of_sec_diag(x),y_correct))
|
4 | Pass |
x=[1 2 3; 4 4 6; 2 8 9];
y_correct = 9;
assert(isequal(sum_of_sec_diag(x),y_correct))
|
Return a list sorted by number of occurrences
1225 Solvers
Count from 0 to N^M in base N.
200 Solvers
377 Solvers
260 Solvers
200 Solvers