brilliant!
clever!
abs(sort(-cumprod(-ones(n)).*reshape(1:n^2,n,n)',2));
This one is more clear.what do you think?
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)));
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
2110 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4
1561 Solvers
296 Solvers