Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
A = [1,0,0]; B = [5,3,0]; Z=[5,3,3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
2 | Pass |
%%
A = [1;0;0]; B = [5;3;0]; Z=[5;3;3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
3 | Pass |
%%
A = [0,0,0]; B = [4,3,0]; Z=[4,3,3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
4 | Pass |
%%
A = [0;0;0]; B = [4;3;0]; Z=[4;3;3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
5 | Pass |
%%
A = [0,3,0]; B = [4,0,0]; Z=[4,0,3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
6 | Pass |
%%
A = [0;3;0]; B = [4;0;0]; Z=[4;0;3];
y_correct = 5.830951894845301;
assert(isequal(euclidean(A,B,Z),y_correct))
|
7 | Pass |
%%
A = [0;3;0]; B = [4;0;0]; Z=[4;0;12];
y_correct = 13;
assert(isequal(euclidean(A,B,Z),y_correct))
|
Find the peak 3n+1 sequence value
792 Solvers
169 Solvers
Flip the main diagonal of a matrix
426 Solvers
Sum the elements in either diagonal of a square matrix
145 Solvers
Who has power to do everything in this world?
256 Solvers