This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
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))
|
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))
|
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'))
|
Find the sum of the elements in the "second" diagonal
879 Solvers
153 Solvers
Change the sign of even index entries of the reversed vector
213 Solvers
MATCH THE STRINGS (2 CHAR) very easy
194 Solvers
251 Solvers