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)
%%
|
Back to basics 22 - Rotate a matrix
682 Solvers
How long is the longest prime diagonal?
280 Solvers
Back to basics - mean of corner elements of a matrix
235 Solvers
739 Solvers
275 Solvers