Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 2 3;4 5 6];
y_correct = [1;4];
assert(isequal(min_per_row(x),y_correct))
|
2 | Pass |
x = [7.2 -2.5 5.1;4.2 -9.8 3.6];
y_correct = [-2.5;-9.8];
assert(isequal(min_per_row(x),y_correct))
|
3 | Pass |
x = [pi exp(1) pi/2;3 pi 4];
y_correct = [pi/2;3];
assert(isequal(min_per_row(x),y_correct))
|
Project Euler: Problem 7, Nth prime
339 Solvers
205 Solvers
171 Solvers
276 Solvers
Finding perimeter of a rectangle
193 Solvers