Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
d = 1;
x = 1;
y_correct = 1;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
1
|
2 | Pass |
d = 10;
x = 5;
y_correct = 0.1000;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.1000
|
3 | Pass |
d = 10;
x = 1;
y_correct = 0.2000;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.2000
|
4 | Pass |
d = 20;
x = 9;
y_correct = 0.0500;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0500
|
5 | Pass |
d = 50;
x = 0;
y_correct = 0.0400;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0400
|
6 | Pass |
d = 50;
x = 2;
y_correct = 0.2600;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.2600
|
7 | Pass |
d = 1000;
x = 9;
y_correct = 0.0670;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0670
|
8 | Pass |
d = 1e4;
x = 8;
y_correct = 0.0747;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0747
|
9 | Pass |
d = 1e5;
x = 7;
y_correct = 0.0864;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0864
|
10 | Pass |
d = 1e6;
x = 6;
y_correct = 0.0935;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0935
|
11 | Pass |
d = 1e6;
x = 5;
y_correct = 0.0937;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0937
|
12 | Pass |
d = 2e6;
x = 4;
y_correct = 0.0903;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.0903
|
13 | Pass |
d = 2000124;
x = 3;
y_correct = 0.1162;
assert(abs(digitCon(d,x)-y_correct) < 1e-4)
ans =
0.1162
|
12381 Solvers
Project Euler: Problem 5, Smallest multiple
397 Solvers
613 Solvers
Find best placement for ordered dominoes (harder)
205 Solvers
Integer Sequence - II : New Fibonacci
252 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!