I don't think this checks the diagonals. Is that because it's not necessary?
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = magic(3);
y_correct = true;
assert(isequal(magical(x),y_correct))
|
2 | Pass |
x = magic(7);
y_correct = true;
assert(isequal(magical(x),y_correct))
|
3 | Pass |
x = eye(7);
y_correct = false;
assert(isequal(magical(x),y_correct))
|
4 | Pass |
x = magic(2);
y_correct = false;
assert(isequal(magical(x),y_correct))
|
5 | Pass |
x = magic(3)+1;
y_correct = false;
assert(isequal(magical(x),y_correct))
|
6 | Pass |
x = flipud(magic(9));
y_correct = true;
assert(isequal(magical(x),y_correct))
|
7 | Pass |
x = fliplr(magic(11));
y_correct = true;
assert(isequal(magical(x),y_correct))
|
8 | Pass |
x = magic(4);
y_correct = true;
assert(isequal(magical(x),y_correct))
|
9 | Pass |
x = flipud(magic(8));
y_correct = true;
assert(isequal(magical(x),y_correct))
|
10 | Pass |
x = [1 2; 3 4];
y_correct = false;
assert(isequal(magical(x),y_correct))
|
11 | Fail |
x = [1 2 3; 4 5 6];
y_correct = false;
assert(isequal(magical(x),y_correct))
|
12 | Pass |
x = ones(2);
y_correct = false;
assert(isequal(magical(x),y_correct))
|
13 | Pass |
x = [7 1 6; 3 5 7; 4 9 3];
y_correct = false;
assert(isequal(magical(x),y_correct))
|
Find the two most distant points
1233 Solvers
414 Solvers
797 Solvers
Project Euler: Problem 6, Natural numbers, squares and sums.
782 Solvers
205 Solvers