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))
|
2 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(m(2:end-1,2:end-1),x))
|
3 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(sum(m(1,:)),0))
|
4 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(sum(m(end,:)),0))
|
5 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(sum(m(:,1)),0))
|
6 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(sum(m(:,end)),0))
|
7 | Pass |
x = randi(10,4,5);
m=zeroWrap(x);
assert(isequal(size(m)-2,size(x)))
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
524 Solvers
Project Euler: Problem 8, Find largest product in a large string of numbers
196 Solvers
135 Solvers
1005 Solvers
379 Solvers