This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 4;
a = [ 1 2 3 4;
8 7 6 5;
9 10 11 12;
16 15 14 13];
assert(isequal(a,back_and_forth(n)));
|
2 | Pass |
%%
n = 5;
a = [ 1 2 3 4 5;
10 9 8 7 6;
11 12 13 14 15;
20 19 18 17 16;
21 22 23 24 25];
assert(isequal(a,back_and_forth(n)));
|
Return a list sorted by number of occurrences
1504 Solvers
Project Euler: Problem 3, Largest prime factor
380 Solvers
401 Solvers
Rotate and display numbered tile
239 Solvers
390 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!