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))
|
The Goldbach Conjecture, Part 2
961 Solvers
Remove the small words from a list of words.
474 Solvers
Number of digits in an integer
271 Solvers
07 - Common functions and indexing 1
268 Solvers
Find the index of n in magic(n)
128 Solvers