Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
N = 1;
P=1;
M=0;
hope_correct = 1;
assert(fate(N,P,M)>hope_correct*0.999)
|
2 | Pass |
N = 1;
P=0;
M=1;
hope_correct = 1;
assert(fate(N,P,M)>hope_correct*0.999)
|
3 | Pass |
N=1;
P=1;
M=1;
hope_correct = 0.3679;
assert(fate(N,P,M)>hope_correct*0.999)
|
4 | Pass |
N=2;
P=1;
M=1;
hope_correct = 0.3679;
assert(fate(N,P,M)>hope_correct*0.999)
|
5 | Pass |
N=2;
P=1;
M=2;
hope_correct = 0.1353;
assert(fate(N,P,M)<hope_correct*1.1)
|
6 | Pass |
N=2;
P=2;
M=2;
hope_correct = 0.0183;
assert(fate(N,P,M)<hope_correct*1.1)
%%
|
2980 Solvers
Find state names that start with the letter N
598 Solvers
Back to basics 9 - Indexed References
392 Solvers
Given a window, how many subsets of a vector sum positive
743 Solvers
320 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!