Cody

Solution 1908892

Submitted on 22 Aug 2019 by Nikolaos Nikolaou
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = [1]; y_correct = [0 0 0 0 1 0 0 0 0]; assert(isequal(zeroWrap(x),y_correct))

x = 0 1 0 y = 0 0 0 0 1 0 0 0 0

2   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(m(2:end-1,2:end-1),x))

x = 0 9 2 8 6 1 0 0 3 4 1 9 8 0 0 6 3 9 4 7 0 0 1 3 10 9 5 0 y = 0 0 0 0 0 0 0 0 9 2 8 6 1 0 0 3 4 1 9 8 0 0 6 3 9 4 7 0 0 1 3 10 9 5 0 0 0 0 0 0 0 0

3   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(sum(m(1,:)),0))

x = 0 4 2 4 7 9 0 0 2 9 9 8 9 0 0 6 2 2 1 1 0 0 3 8 5 1 7 0 y = 0 0 0 0 0 0 0 0 4 2 4 7 9 0 0 2 9 9 8 9 0 0 6 2 2 1 1 0 0 3 8 5 1 7 0 0 0 0 0 0 0 0

4   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(sum(m(end,:)),0))

x = 0 3 10 7 3 2 0 0 3 4 9 8 5 0 0 5 2 8 10 6 0 0 5 2 8 9 1 0 y = 0 0 0 0 0 0 0 0 3 10 7 3 2 0 0 3 4 9 8 5 0 0 5 2 8 10 6 0 0 5 2 8 9 1 0 0 0 0 0 0 0 0

5   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(sum(m(:,1)),0))

x = 0 9 6 9 3 3 0 0 3 3 10 1 6 0 0 6 2 7 2 6 0 0 8 5 8 9 2 0 y = 0 0 0 0 0 0 0 0 9 6 9 3 3 0 0 3 3 10 1 6 0 0 6 2 7 2 6 0 0 8 5 8 9 2 0 0 0 0 0 0 0 0

6   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(sum(m(:,end)),0))

x = 0 4 3 3 9 8 0 0 1 5 8 4 2 0 0 6 4 5 6 1 0 0 6 1 1 10 7 0 y = 0 0 0 0 0 0 0 0 4 3 3 9 8 0 0 1 5 8 4 2 0 0 6 4 5 6 1 0 0 6 1 1 10 7 0 0 0 0 0 0 0 0

7   Pass
x = randi(10,4,5); m=zeroWrap(x); assert(isequal(size(m)-2,size(x)))

x = 0 5 7 9 9 7 0 0 3 9 7 7 7 0 0 4 8 7 4 9 0 0 3 10 3 6 10 0 y = 0 0 0 0 0 0 0 0 5 7 9 9 7 0 0 3 9 7 7 7 0 0 4 8 7 4 9 0 0 3 10 3 6 10 0 0 0 0 0 0 0 0