Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a=1;
n=1;
y_correct=1;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
2 | Pass |
a=10;
n=1;
y_correct=1;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
3 | Pass |
a=2;
n=10;
y_correct=1.4142;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
4 | Pass |
a=4;
n=10;
y_correct=2;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
5 | Pass |
a=0.25;
n=10;
y_correct=0.5;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
6 | Pass |
a=30;
n=4;
y_correct=6.0795;
assert(abs(Babylonian(a,n)-y_correct)<0.001);
|
All your base are belong to us
425 Solvers
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
123 Solvers
Determine the number of odd integers in a vector
323 Solvers
309 Solvers
291 Solvers