Cody

Problem 43684. 0, 2, 0, -2, 0, 2, 0, -2, ...

Solution 1061862

Submitted on 27 Nov 2016 by Peng Liu
  • Size: 18
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
n = 1; y_correct = [0]; assert(isequal(seq(n),y_correct))
2   Pass
n = 4 y_correct = [0, 2, 0, -2]; assert(isequal(seq(n),y_correct))

n = 4
3   Pass
n = 5 y_correct = [0, 2, 0, -2, 0]; assert(isequal(seq(n),y_correct))

n = 5
4   Pass
n = 8 y_correct = [0, 2, 0, -2, 0, 2, 0, -2]; assert(isequal(seq(n),y_correct))

n = 8
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

Suggested Problems

More from this Author30