Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = magic(7);
y_correct = [30 39 48 10 19 28
38 47 7 18 27 29
46 6 8 26 35 37
13 15 24 42 44 4
21 23 32 43 3 12
22 31 40 2 11 20];
assert(isequal(central_cross(x),y_correct))
|
2 | Pass |
%%
x = magic(3);
y_correct = [8 6
4 2];
assert(isequal(central_cross(x),y_correct))
|
3 | Pass |
%%
x = magic(1);
y_correct = [];
assert(isequal(central_cross(x),y_correct))
|
Return the 3n+1 sequence for n
5201 Solvers
892 Solvers
226 Solvers
Find nearest prime number less than input number
181 Solvers
209 Solvers