Cody

Solution 238169

Submitted on 30 Apr 2013 by Prateep Mukherjee
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% x = [1 2 3 4 5]; y_correct = [1 2 3 4 5]; assert(isequal(gendigit_champernowne(x),y_correct))
2   Pass
%% x = [10 11 12 13 14 15]; y_correct = [1 0 1 1 1 2]; assert(isequal(gendigit_champernowne(x),y_correct))
3   Pass
%% x = [188 189]; y_correct = [9 9]; assert(isequal(gendigit_champernowne(x),y_correct))
4   Pass
%% x = 2887:3000; y_correct = '999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102'; assert(isequal(sprintf('%d',gendigit_champernowne(2887:3000)),y_correct))
5   Pass
%% x=[1000000 1000001 1000002]; y_correct = [1 8 5]; assert(isequal(gendigit_champernowne(x),y_correct))
6   Pass
%% x=[12000:12005]; y_correct = [7 7 3 2 7 8]; assert(isequal(gendigit_champernowne(x),y_correct))
7   Pass
%% x=[10000000 10000001 10000002]; y_correct = [7 3 0]; assert(isequal(gendigit_champernowne(x),y_correct))
8   Pass
%% x=[120000:120005]; y_correct = [2 6 2 2 2 2]; assert(isequal(gendigit_champernowne(x),y_correct))
9   Pass
%% x=[1200000:1200005]; y_correct = [ 8 5 1 8 2 1]; assert(isequal(gendigit_champernowne(x),y_correct))
10   Pass
%% x=[1200004:1200009]; y_correct = [ 2 1 8 5 1 9]; assert(isequal(gendigit_champernowne(x),y_correct))
11   Pass
%% x=[1200008:1200013]; y_correct = [1 9 2 1 8 5]; assert(isequal(gendigit_champernowne(x),y_correct))
12   Pass
%% x=[13000008:13000013]; y_correct = [2 0 1 5 8 7]; assert(isequal(gendigit_champernowne(x),y_correct))
13   Pass
%% x=[14000008:14000013]; y_correct = [ 1 5 8 7 3 1]; assert(isequal(gendigit_champernowne(x),y_correct))