Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
A = randi(100);
sz = [randi(100) 1];
B_correct = repmat(A,sz);
assert(isequal(enlarge(A,sz),B_correct))
|
2 | Pass |
%%
A = randi(1000);
sz = [1 randi(1000)];
B_correct = repmat(A,sz);
assert(isequal(enlarge(A,sz),B_correct))
|
3 | Pass |
%%
A = eye(3);
sz = [2 4];
B_correct = [1 1 1 1 0 0 0 0 0 0 0 0;
1 1 1 1 0 0 0 0 0 0 0 0;
0 0 0 0 1 1 1 1 0 0 0 0;
0 0 0 0 1 1 1 1 0 0 0 0;
0 0 0 0 0 0 0 0 1 1 1 1;
0 0 0 0 0 0 0 0 1 1 1 1];
assert(isequal(enlarge(A,sz),B_correct))
|
4 | Pass |
%%
A = magic(4);
sz = [3 3];
B_correct = [16 16 16 2 2 2 3 3 3 13 13 13;
16 16 16 2 2 2 3 3 3 13 13 13;
16 16 16 2 2 2 3 3 3 13 13 13;
5 5 5 11 11 11 10 10 10 8 8 8;
5 5 5 11 11 11 10 10 10 8 8 8;
5 5 5 11 11 11 10 10 10 8 8 8;
9 9 9 7 7 7 6 6 6 12 12 12;
9 9 9 7 7 7 6 6 6 12 12 12;
9 9 9 7 7 7 6 6 6 12 12 12;
4 4 4 14 14 14 15 15 15 1 1 1;
4 4 4 14 14 14 15 15 15 1 1 1;
4 4 4 14 14 14 15 15 15 1 1 1];
assert(isequal(enlarge(A,sz),B_correct))
|
5 | Pass |
%%
A = (-99:0)';
sz = [1 100];
B = enlarge(A,sz);
assert(all(all(bsxfun(@minus,B,A)==0)))
|
533 Solvers
163 Solvers
Create an n-by-n null matrix and fill with ones certain positions
140 Solvers
2137 Solvers
3009 Solvers