Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
Pvar={ [1 2], [-2 3 -4], [4 -5] };
Tval=[ 1 0 1 1 0 ];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
2 | Pass |
%%
Pvar={ [1 2], [-2 3 4], [-4 5] };
Tval=[ 1 0 1 1 0 ];
y_correct=false;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
3 | Pass |
%%
Pvar={ [1 2], [-2 3 -4], [4 -5] };
Tval=[ 0 1 1 0 0 ];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
4 | Pass |
%%
Pvar={ [1 2] };
Tval=[0 0];
y_correct=false;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
5 | Pass |
%%
Pvar={ [1 2] };
Tval=[0 1];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
6 | Pass |
%%
Pvar={ [1 2] };
Tval=[1 0 ];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
7 | Pass |
%%
Pvar={ [1 -2] };
Tval=[0 0];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
8 | Pass |
%%
Pvar={ [1 2 3 4 ], [ 5 6 7 8] };
Tval=[1 0 0 0 1 0 0 0];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
9 | Pass |
%%
Pvar={ [1 2 3 ], [ 4 5 6 ], [7 8 9], [10 11 -12] };
Tval=[1 0 0 0 1 0 0 0 1 0 0 0];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
10 | Pass |
%%
Pvar={ [1 2 3 ], [ 4 5 6 ], [7 8 9], [10 11 12] };
Tval=[1 0 0 0 1 0 0 0 1 0 0 0];
y_correct=false;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
11 | Pass |
%%
Pvar={ [1 2 3 ], [ -3 2 -1], [3 2 -4] [ 4 -2 -1] };
Tval=[1 0 0 0 ];
y_correct=true;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
12 | Pass |
%%
Pvar={ [1 2 3 ], [ -3 2 -1], [3 2 -4] [ 4 -2 -1] };
Tval=[1 0 0 1 ];
y_correct=false;
assert(isequal(CnfProp(Pvar,Tval),y_correct))
|
Find the numeric mean of the prime numbers in a matrix.
5913 Solvers
Return the 3n+1 sequence for n
5207 Solvers
Remove the small words from a list of words.
474 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?
209 Solvers
Convert a vector into a number
442 Solvers