Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
x = [1 2 3 4 5];
y_correct = [1 2 3 4 5];
assert(isequal(gendigit_champernowne(x),y_correct))
|
2 | Fail |
x = [10 11 12 13 14 15];
y_correct = [1 0 1 1 1 2];
assert(isequal(gendigit_champernowne(x),y_correct))
|
3 | Fail |
x = [188 189];
y_correct = [9 9];
assert(isequal(gendigit_champernowne(x),y_correct))
|
4 | Fail |
x = 2887:3000;
y_correct = '999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102';
assert(isequal(sprintf('%d',gendigit_champernowne(2887:3000)),y_correct))
|
5 | Fail |
x=[1000000 1000001 1000002];
y_correct = [1 8 5];
assert(isequal(gendigit_champernowne(x),y_correct))
|
6 | Fail |
x=[12000:12005];
y_correct = [7 7 3 2 7 8];
assert(isequal(gendigit_champernowne(x),y_correct))
|
7 | Fail |
x=[10000000 10000001 10000002];
y_correct = [7 3 0];
assert(isequal(gendigit_champernowne(x),y_correct))
|
8 | Fail |
x=[120000:120005];
y_correct = [2 6 2 2 2 2];
assert(isequal(gendigit_champernowne(x),y_correct))
|
9 | Fail |
x=[1200000:1200005];
y_correct = [ 8 5 1 8 2 1];
assert(isequal(gendigit_champernowne(x),y_correct))
|
10 | Fail |
x=[1200004:1200009];
y_correct = [ 2 1 8 5 1 9];
assert(isequal(gendigit_champernowne(x),y_correct))
|
11 | Fail |
x=[1200008:1200013];
y_correct = [1 9 2 1 8 5];
assert(isequal(gendigit_champernowne(x),y_correct))
|
12 | Fail |
x=[13000008:13000013];
y_correct = [2 0 1 5 8 7];
assert(isequal(gendigit_champernowne(x),y_correct))
|
13 | Fail |
x=[14000008:14000013];
y_correct = [ 1 5 8 7 3 1];
assert(isequal(gendigit_champernowne(x),y_correct))
|
2197 Solvers
Sum all integers from 1 to 2^n
8414 Solvers
Back to basics 17 - white space
245 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
546 Solvers
Is this is a Tic Tac Toe X Win?
438 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!