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 0 0 0 0;...
0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1];
B = [0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0

2  Pass 
A = [1 1 0 0 0;...
0 1 1 0 0;...
0 0 1 1 0;...
0 0 0 1 1;...
1 0 0 0 1];
B = [0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0;...
0 0 1 0 0;...
0 0 0 1 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0

3  Pass 
A = [1 1 0 0 1;...
1 1 1 0 0;...
0 1 1 1 0;...
0 0 1 1 1;...
1 0 0 1 1];
B = [0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0];
tf_correct = 0;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0

4  Pass 
A = [1 1 1 0 1;...
1 1 1 1 0;...
0 1 1 1 1;...
1 0 1 1 1;...
1 1 0 1 1];
B = [0 1 0 0 0;...
1 0 0 0 0;...
0 0 0 0 1;...
0 0 0 1 0;...
0 0 1 0 0];
tf_correct = 1;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
logical
0
tf =
logical
1
tf =
logical
1

5  Pass 
A = [1 1 0 0 1;...
1 1 1 0 0;...
0 1 1 1 0;...
0 0 1 1 1;...
1 1 0 1 1];
B = [0 0 1 0 0;...
0 0 0 1 0;...
0 0 0 0 1;...
1 0 0 0 0;...
0 1 0 0 0];
tf_correct = 1;
assert(isequal(intersection_of_matrices(A,B),tf_correct))
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
0
tf =
logical
1
tf =
logical
1

1025 Solvers
How to find the position of an element in a vector without using the find function
2357 Solvers
Permute diagonal and antidiagonal
186 Solvers
255 Solvers
1095 Solvers