Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
list = {[1 3; 2 4; 5 6],[4 6; 2 5;6 7],[3 4; 6 1; 4 6]}
selections = [2 1 2];
assert(isequal(ChooseBestFittingDominoes(list),selections))
list =
[3x2 double] [3x2 double] [3x2 double]
n =
3
a =
Columns 1 through 16
1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1
1 1 1 2 2 2 3 3 3 1 1 1 2 2 2 3
1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2
Columns 17 through 27
2 3 1 2 3 1 2 3 1 2 3
3 3 1 1 1 2 2 2 3 3 3
2 2 3 3 3 3 3 3 3 3 3
|
2 | Pass |
%%
list = {[1 5; 2 3; 2 2; 3 4; 0 3],
[0 4; 1 5; 2 2; 4 5; 4 6],
[7 7; 3 8; 4 7; 5 9; 0 4]};
selections = [4 4 4];
assert(isequal(ChooseBestFittingDominoes(list),selections))
n =
3
a =
Columns 1 through 16
1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1
1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Columns 17 through 32
2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2
4 4 4 4 5 5 5 5 5 1 1 1 1 1 2 2
1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2
Columns 33 through 48
3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3
2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
Columns 49 through 64
4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4
5 5 1 1 1 1 1 2 2 2 2 2 3 3 3 3
2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3
Columns 65 through 80
5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5
3 4 4 4 4 4 5 5 5 5 5 1 1 1 1 1
3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4
Columns 81 through 96
1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1
2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5
4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4
Columns 97 through 112
2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2
5 5 5 5 1 1 1 1 1 2 2 2 2 2 3 3
4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5
Columns 113 through 125
3 4 5 1 2 3 4 5 1 2 3 4 5
3 3 3 4 4 4 4 4 5 5 5 5 5
5 5 5 5 5 5 5 5 5 5 5 5 5
|
3 | Pass |
%%
list = {[1 4; 2 2; 1 1; 3 3],[1 2; 2 3],[2 2]};
selections = [3 1 1];
assert(isequal(ChooseBestFittingDominoes(list),selections))
n =
3
a =
1 2 3 4 1 2 3 4
1 1 1 1 2 2 2 2
1 1 1 1 1 1 1 1
|
735 Solvers
Maximum running product for a string of numbers
816 Solvers
179 Solvers
204 Solvers
1778 Solvers