Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = 1;
b = 2;
c_correct = sqrt(5);
tolerance = 1e-12 ;
assert(abs(hypotenuse(a,b)-c_correct)<tolerance);
|
2 | Pass |
a = 3;
b = 4;
c_correct = 5;
tolerance = 1e-12 ;
assert(abs(hypotenuse(a,b)-c_correct)<tolerance);
|
3 | Pass |
a = 5;
b = 12;
c_correct = 13;
tolerance = 1e-12 ;
assert(abs(hypotenuse(a,b)-c_correct)<tolerance);
|
Find the longest sequence of 1's in a binary sequence.
2444 Solvers
1965 Solvers
204 Solvers
276 Solvers
261 Solvers