This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 10;
y_correct = 3.041840000000000;
assert(isequal(pi_est1(x),y_correct))
|
2 | Pass |
x = 1000;
y_correct = 3.140593000000000;
assert(isequal(pi_est1(x),y_correct))
|
3 | Pass |
x = 1e6;
y_correct = 3.141592000000000;
assert(isequal(pi_est1(x),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2444 Solvers
Arrange Vector in descending order
1810 Solvers
Back to basics 9 - Indexed References
348 Solvers
228 Solvers
178 Solvers