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;
mat=[1 1];
ok = 1;
assert(isequal(FillWithOnes(n,mat),ok))
|
2 | Pass |
n = 2;
mat=[1 2; 2 1];
ok = [0 1; 1 0];
assert(isequal(FillWithOnes(n,mat),ok))
|
3 | Pass |
n=3;
mat=[1 3; 3 2; 3 3];
ok = [0 0 1; 0 0 0; 0 1 1];
assert(isequal(FillWithOnes(n,mat),ok))
|
4 | Pass |
n=4;
mat=[1 3; 3 2; 3 3];
ok = [0 0 1 0; 0 0 0 0; 0 1 1 0; 0 0 0 0];
assert(isequal(FillWithOnes(n,mat),ok))
|
497 Solvers
176 Solvers
How long is the longest prime diagonal?
280 Solvers
310 Solvers
270 Solvers