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 |
n = 2;
A_correct = 2;
assert(isequal(your_fcn_name(n),A_correct))
A =
2
|
2 | Pass |
n = 3;
A_correct = [2 3];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3
|
3 | Pass |
n = 4;
A_correct = [2 3 4];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3 4
|
4 | Pass |
n = 5;
A_correct = [2 3 4 5];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3 4 5
|
5 | Pass |
n = 10;
A_correct = [2 3 4 5 6 8 9 10];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3 4 5 6 8 9 10
|
6 | Fail |
n = 17;
A_correct = [2 3 4 5 6 8 9 10 12 15 16];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3 4 5 6 8 9 10 12 14 15 16
|
7 | Fail |
n = 31;
A_correct = [2 3 4 5 6 8 9 10 12 15 16 18 20 24 25 27 30];
assert(isequal(your_fcn_name(n),A_correct))
A =
2 3 4 5 6 8 9 10 12 14 15 16 18 20 21 22 24 25 26 27 28 30
|
22993 Solvers
960 Solvers
559 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
Generate a vector like 1,2,2,3,3,3,4,4,4,4
1561 Solvers