Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
y_correct = [0];
assert(isequal(seq(n),y_correct))
a =
0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0
|
2 | Pass |
n = 4
y_correct = [0, 2, 0, -2];
assert(isequal(seq(n),y_correct))
n =
4
a =
0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0
|
3 | Pass |
n = 5
y_correct = [0, 2, 0, -2, 0];
assert(isequal(seq(n),y_correct))
n =
5
a =
0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0
|
4 | Pass |
n = 8
y_correct = [0, 2, 0, -2, 0, 2, 0, -2];
assert(isequal(seq(n),y_correct))
n =
8
a =
0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0
|
5 | Pass |
n = 25
y_correct = [0, 2, 0, -2, 0, 2, 0, -2, 0, 2, 0, -2, 0, 2, 0, -2, 0, 2, 0, -2, 0, 2, 0, -2, 0];
assert(isequal(seq(n),y_correct))
n =
25
a =
0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0 2 0 -2 0
|
All your base are belong to us
425 Solvers
351 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
196 Solvers
142 Solvers