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 |
n = 1;
y_correct = 1;
assert(isequal(mat_fun(n),y_correct))
|
2 | Pass |
n = 2;
y_correct = [2 1; 1 1];
assert(isequal(mat_fun(n),y_correct))
|
3 | Pass |
n = 3;
y_correct = [3 2 1; 2 2 1; 1 1 1]
assert(isequal(mat_fun(n),y_correct))
y_correct =
3 2 1
2 2 1
1 1 1
|
4 | Pass |
n = 4;
y_correct = [4 3 2 1; 3 3 2 1; 2 2 2 1; 1 1 1 1]
assert(isequal(mat_fun(n),y_correct))
y_correct =
4 3 2 1
3 3 2 1
2 2 2 1
1 1 1 1
|
Number of 1s in the Binary Representation of a Number
319 Solvers
279 Solvers
409 Solvers
271 Solvers
Create an anti-identity matrix
119 Solvers