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)));
z =
1
z =
1 2
z =
1 2 3
z =
1 2 3 4
z =
5
z =
5 6
z =
5 6 7
z =
5 6 7 8
z =
9
z =
9 10
z =
9 10 11
z =
9 10 11 12
z =
13
z =
13 14
z =
13 14 15
z =
13 14 15 16
|
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)));
z =
1
z =
1 2
z =
1 2 3
z =
1 2 3 4
z =
1 2 3 4 5
z =
6
z =
6 7
z =
6 7 8
z =
6 7 8 9
z =
6 7 8 9 10
z =
11
z =
11 12
z =
11 12 13
z =
11 12 13 14
z =
11 12 13 14 15
z =
16
z =
16 17
z =
16 17 18
z =
16 17 18 19
z =
16 17 18 19 20
z =
21
z =
21 22
z =
21 22 23
z =
21 22 23 24
z =
21 22 23 24 25
|
225 Solvers
465 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
458 Solvers
289 Solvers
379 Solvers