Cody

Solution 371541

Submitted on 17 Dec 2013 by Robert
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
%% M = 2; N = 2; y_correct = [0 0 1 1; 0 1 0 1]; assert(isequal(countInBaseN(M,N),y_correct))

y = 0 0 0 0 0 0 0 0 new = 1 new = 1 0 new = 1 1

2   Pass
%% M = 2; N = 3; y_correct = [ 0 0 0 1 1 1 2 2 2; 0 1 2 0 1 2 0 1 2]; assert(isequal(countInBaseN(M,N),y_correct))

y = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 new = 1 new = 2 new = 1 0 new = 1 1 new = 1 2 new = 2 0 new = 2 1 new = 2 2

3   Pass
%% M = 3; N = 4; y_correct = [ 0 0 0 0 0 1 0 0 2 0 0 3 0 1 0 0 1 1 0 1 2 0 1 3 0 2 0 0 2 1 0 2 2 0 2 3 0 3 0 0 3 1 0 3 2 0 3 3 1 0 0 1 0 1 1 0 2 1 0 3 1 1 0 1 1 1 1 1 2 1 1 3 1 2 0 1 2 1 1 2 2 1 2 3 1 3 0 1 3 1 1 3 2 1 3 3 2 0 0 2 0 1 2 0 2 2 0 3 2 1 0 2 1 1 2 1 2 2 1 3 2 2 0 2 2 1 2 2 2 2 2 3 2 3 0 2 3 1 2 3 2 2 3 3 3 0 0 3 0 1 3 0 2 3 0 3 3 1 0 3 1 1 3 1 2 3 1 3 3 2 0 3 2 1 3 2 2 3 2 3 3 3 0 3 3 1 3 3 2 3 3 3]; assert(isequal(countInBaseN(M,N),y_correct'))

y = Columns 1 through 16 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 17 through 32 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 33 through 48 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Columns 49 through 64 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 new = 1 new = 2 new = 3 new = 1 0 new = 1 1 new = 1 2 new = 1 3 new = 2 0 new = 2 1 new = 2 2 new = 2 3 new = 3 0 new = 3 1 new = 3 2 new = 3 3 new = 1 0 0 new = 1 0 1 new = 1 0 2 new = 1 0 3 new = 1 1 0 new = 1 1 1 new = 1 1 2 new = 1 1 3 new = 1 2 0 new = 1 2 1 new = 1 2 2 new = 1 2 3 new = 1 3 0 new = 1 3 1 new = 1 3 2 new = 1 3 3 new = 2 0 0 new = 2 0 1 new = 2 0 2 new = 2 0 3 new = 2 1 0 new = 2 1 1 new = 2 1 2 new = 2 1 3 new = 2 2 0 new = 2 2 1 new = 2 2 2 new = 2 2 3 new = 2 3 0 new = 2 3 1 new = 2 3 2 new = 2 3 3 new = 3 0 0 new = 3 0 1 new = 3 0 2 new = 3 0 3 new = 3 1 0 new = 3 1 1 new = 3 1 2 new = 3 1 3 new = 3 2 0 new = 3 2 1 new = 3 2 2 new = 3 2 3 new = 3 3 0 new = 3 3 1 new = 3 3 2 new = 3 3 3

Suggested Problems

More from this Author1