Cody

Problem 1512. Clock Solitaire

Solution 2634220

Submitted on 30 Jun 2020
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   Fail
deck = [1:52]; assert(isequal(clockSolitaire(deck),false))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test1 (line 2) assert(isequal(clockSolitaire(deck),false))

2   Fail
deck = [8 1 5 2 30 23 46 21 3 51 6 27 42 48 37 33 12 25 45 36 31 34 29 35 15 17 43 13 39 40 18 50 26 9 4 28 38 16 11 22 49 24 14 7 32 20 47 44 19 10 41 52]; assert(isequal(clockSolitaire(deck),true))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test2 (line 2) assert(isequal(clockSolitaire(deck),true))

3   Fail
deck = [52:-1:1]; assert(isequal(clockSolitaire(deck),false))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test3 (line 2) assert(isequal(clockSolitaire(deck),false))

4   Fail
deck = [40 29 25 37 23 41 13 50 33 2 42 20 49 48 27 46 36 45 28 1 7 11 14 5 9 26 15 21 12 8 19 35 10 38 34 52 32 51 31 16 18 22 6 3 47 44 43 4 24 17 30 39]; assert(isequal(clockSolitaire(deck),true))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test4 (line 2) assert(isequal(clockSolitaire(deck),true))

5   Fail
deck = [40 29 25 37 23 41 13 50 33 2 42 20 52 48 27 46 36 45 28 1 7 11 14 5 9 26 15 21 12 8 19 35 10 38 34 49 32 51 31 16 18 22 6 3 47 44 43 4 24 17 30 39]; assert(isequal(clockSolitaire(deck),false))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test5 (line 2) assert(isequal(clockSolitaire(deck),false))

6   Fail
deck = [8 1 5 2 30 23 46 21 3 51 6 27 13 48 37 33 12 25 45 36 31 34 29 35 15 17 43 42 39 40 18 50 26 9 4 28 38 16 11 22 49 24 14 7 32 20 47 44 19 10 41 52]; assert(isequal(clockSolitaire(deck),false))

P = 0×0 empty cell array

Index exceeds the number of array elements (0). Error in clockSolitaire (line 16) P{t}(end+1)=t; Error in Test6 (line 2) assert(isequal(clockSolitaire(deck),false))