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 |
m = 3; n = 3;
y_correct = [0, 1, 0; 1, 1, 1; 0, 1, 0];
assert(isequal(crossFlag(m, n),y_correct))
|
2 | Pass |
m = 5; n = 3;
y_correct = [0, 1, 0; 0, 1, 0; 1, 1, 1; 0, 1, 0; 0, 1, 0];
assert(isequal(crossFlag(m, n),y_correct))
|
3 | Pass |
m = 16; n = 8;
y_correct = zeros(16,8);
assert(isequal(crossFlag(m, n),y_correct))
|
4 | Pass |
m = 7; n = 280;
y_correct = [zeros(3,280); ones(1,280); zeros(3,280)];
assert(isequal(crossFlag(m, n),y_correct))
|
5 | Pass |
m = 1; n = 1;
y_correct = 1;
assert(isequal(crossFlag(m, n),y_correct))
|
6 | Pass |
m = 7; n = 13;
y_correct =[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0;...
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0;...
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0;...
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;...
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0;...
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0;...
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0];
assert(isequal(crossFlag(m, n),y_correct))
|
36284 Solvers
Remove any row in which a NaN appears
5978 Solvers
Find state names that start with the letter N
465 Solvers
3652 Solvers
Given a window, how many subsets of a vector sum positive
673 Solvers