Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
d = 1;
x = 1;
y_correct = 1;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
2 | Pass |
d = 10;
x = 5;
y_correct = 0.1000;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
3 | Pass |
d = 10;
x = 1;
y_correct = 0.2000;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
4 | Pass |
d = 20;
x = 9;
y_correct = 0.0500;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
5 | Pass |
d = 50;
x = 0;
y_correct = 0.0400;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
6 | Pass |
d = 50;
x = 2;
y_correct = 0.2600;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
7 | Pass |
d = 1000;
x = 9;
y_correct = 0.0670;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
8 | Pass |
d = 1e4;
x = 8;
y_correct = 0.0747;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
9 | Pass |
d = 1e5;
x = 7;
y_correct = 0.0864;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
10 | Pass |
d = 1e6;
x = 6;
y_correct = 0.0935;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
11 | Pass |
d = 1e6;
x = 5;
y_correct = 0.0937;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
12 | Pass |
d = 2e6;
x = 4;
y_correct = 0.0903;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
13 | Pass |
d = 2000124;
x = 3;
y_correct = 0.1162;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
|
Is my wife right? Now with even more wrong husband
1145 Solvers
Replace multiples of 5 with NaN
282 Solvers
Create an n-by-n null matrix and fill with ones certain positions
140 Solvers
Create an index-powered vector
232 Solvers
Sums of Multiple Pairs of Triangular Numbers
179 Solvers