This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = [1 2 3];
n = 3;
A_correct = [1 2 3 0 0 0 0 0 0; 0 0 0 1 2 3 0 0 0; 0 0 0 0 0 0 1 2 3];
assert(isequal(block_diagonal(a,n),A_correct))
|
2 | Pass |
%%
a = [];
n = 3;
A_correct = [];
assert(isequal(block_diagonal(a,n),A_correct))
|
3 | Pass |
%%
a = [1 2 -3]';
n = 0;
A_correct = [];
assert(isequal(block_diagonal(a,n),A_correct))
|
4 | Pass |
%%
a = [3 -2]';
n = 4;
A_correct = [3 -2 0 0 0 0 0 0; 0 0 3 -2 0 0 0 0; 0 0 0 0 3 -2 0 0; 0 0 0 0 0 0 3 -2]';
assert(isequal(block_diagonal(a,n),A_correct))
|
5 | Pass |
%%
a = 6;
n = 23;
A_correct = a*eye(n);
assert(isequal(block_diagonal(a,n),A_correct))
|
6 | Pass |
%%
a = magic(5);
n = 2;
A_correct = [a zeros(5); zeros(5) a];
assert(isequal(block_diagonal(a,n),A_correct))
|
7 | Pass |
%%
a = randi(100,13,8);
n = 1;
A_correct = a;
assert(isequal(block_diagonal(a,n),A_correct))
|
1915 Solvers
Remove the small words from a list of words.
474 Solvers
299 Solvers
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
122 Solvers
204 Solvers