Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
list = [ 1 5
2 1
2 2
3 2
4 8
5 4
5 5
10 3];
correct = [8 4 3 2 1 7 6 5];
assert(isequal(findPerfectOrderedDominoes(list),correct))
|
2 | Fail |
list = [ 1 6
2 2
2 7
7 1
7 8
8 10
10 2
10 10];
correct = [5 6 8 7 2 3 4 1];
assert(isequal(findPerfectOrderedDominoes(list),correct))
|
3 | Fail |
list = [1 1
1 7
2 4
4 6
5 1
6 2
7 4
7 5];
correct = [8 5 1 2 7 4 6 3];
assert(isequal(findPerfectOrderedDominoes(list),correct))
|
4 | Fail |
list = [1 10
3 10
5 3
6 9
7 6
8 7
8 8
9 1
10 5];
correct = [7 6 5 4 8 1 9 3 2];
assert(isequal(findPerfectOrderedDominoes(list),correct))
|
Return the 3n+1 sequence for n
5206 Solvers
226 Solvers
Back to basics 23 - Triangular matrix
532 Solvers
299 Solvers
288 Solvers