You will be given a cell array of nx2 matrices. Choose one row from each matrix. These are the ordered pairs that will be placed in a line like this.
{[1 2 [4 5 [0 4 3 5 2 4 3 2 1 5] 5 1] 5 3]}
Choices might be: [1 2 3]
yields: [1 2][2 4][5 3] or: abs(2-2) + abs(4-5) or: 0 + 1 or: 1
You are trying to minimize the score, the absolute difference of the sum of the difference at the intersections.
this isn't a big deal, but you have inconsistent inputs for your test cases. cases 1 & 3 are 'row vector' cell arrays whereas case 2 is a 'column vector' cell array.
It would be good to amend the Test Suite in the following regards: (1) Add "%%" to the beginning of the first test case, so that Cody interprets it as intended. (2) Include more test cases: currently the twelve smallest 'correct' submissions are all hard-coded cheats. (3) Include test cases in which the minimum score is not zero. (4) Include test cases in which the number of dominoes to be placed "in a line" is not three. —DIV
And (5) Include test cases in which for a particular position there are more than 9 candidate dominoes available.
Cf. Solution 1554377: if Shared Variables ("SV") assertion fails, output from SV section is echoed to console and Test Point is not called. If SV assertion is passed, output from SV section is not echoed to console (i.e. 'hidden'), and Test Point is called, with output from the Test Point call echoed to console.
Defect in Test Suite.
Presumably would fail if the Test Suite contained a case in which there were more than 9 candidate dominoes available for a particular position.
Nice.
this code works well in my desktop matlab, but is incorrect here,why?
Some cheating :), since the least score is always 0 in the test suite, despite the statement in the problem description.
Honesty always appreciated :-) This is also an example of relying on the Test Suite always requiring 3 dominoes to be represented in the output (i, j & k here). —DIV
Return the 3n+1 sequence for n
5002 Solvers
5605 Solvers
Sum all integers from 1 to 2^n
5910 Solvers
106 Solvers
367 Solvers