Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
M = [8 6 10 10 4 7 7 7
9 1 10 5 9 0 8 2
1 3 2 8 8 8 7 7
9 5 10 1 10 9 4 0 ];
y_correct = 35;
assert(isequal(shortest_path(M),y_correct))
|
2 | Pass |
M = [6 8 5 5 3
5 4 8 0 5
9 6 9 3 2
3 1 1 2 6
8 1 6 8 3 ];
y_correct = 22;
assert(isequal(shortest_path(M),y_correct))
|
3 | Pass |
M = hadamard(8);
y_correct = -5;
assert(isequal(shortest_path(M),y_correct))
|
10765 Solvers
Similar Triangles - find the height of the tree
156 Solvers
119 Solvers
Determine the number of odd integers in a vector
323 Solvers
134 Solvers