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(4);
y_correct = sum(diag(x));
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = ones(5);
y_correct = sum(diag(x));
assert(isequal(your_fcn_name(x),y_correct))
|
5737 Solvers
367 Solvers
232 Solvers
Find nearest prime number less than input number
183 Solvers
203 Solvers