Cody

Problem 520. Choose the best fitting dominoes

Solution 222721

Submitted on 25 Mar 2013 by Ted
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
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] orders = 1 1 1 2 1 1 3 1 1 1 2 1 2 2 1 3 2 1 1 3 1 2 3 1 3 3 1 1 1 2 2 1 2 3 1 2 1 2 2 2 2 2 3 2 2 1 3 2 2 3 2 3 3 2 1 1 3 2 1 3 3 1 3 1 2 3 2 2 3 3 2 3 1 3 3 2 3 3 3 3 3 r = 27

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))

orders = 1 1 1 2 1 1 3 1 1 4 1 1 5 1 1 1 2 1 2 2 1 3 2 1 4 2 1 5 2 1 1 3 1 2 3 1 3 3 1 4 3 1 5 3 1 1 4 1 2 4 1 3 4 1 4 4 1 5 4 1 1 5 1 2 5 1 3 5 1 4 5 1 5 5 1 1 1 2 2 1 2 3 1 2 4 1 2 5 1 2 1 2 2 2 2 2 3 2 2 4 2 2 5 2 2 1 3 2 2 3 2 3 3 2 4 3 2 5 3 2 1 4 2 2 4 2 3 4 2 4 4 2 5 4 2 1 5 2 2 5 2 3 5 2 4 5 2 5 5 2 1 1 3 2 1 3 3 1 3 4 1 3 5 1 3 1 2 3 2 2 3 3 2 3 4 2 3 5 2 3 1 3 3 2 3 3 3 3 3 4 3 3 5 3 3 1 4 3 2 4 3 3 4 3 4 4 3 5 4 3 1 5 3 2 5 3 3 5 3 4 5 3 5 5 3 1 1 4 2 1 4 3 1 4 4 1 4 5 1 4 1 2 4 2 2 4 3 2 4 4 2 4 5 2 4 1 3 4 2 3 4 3 3 4 4 3 4 5 3 4 1 4 4 2 4 4 3 4 4 4 4 4 5 4 4 1 5 4 2 5 4 3 5 4 4 5 4 5 5 4 1 1 5 2 1 5 3 1 5 4 1 5 5 1 5 1 2 5 2 2 5 3 2 5 4 2 5 5 2 5 1 3 5 2 3 5 3 3 5 4 3 5 5 3 5 1 4 5 2 4 5 3 4 5 4 4 5 5 4 5 1 5 5 2 5 5 3 5 5 4 5 5 5 5 5 r = 125

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))

orders = 1 1 1 2 1 1 3 1 1 4 1 1 1 2 1 2 2 1 3 2 1 4 2 1 r = 8