Find all the possible ways to reach the end of a matrix. So given
[a b c d]
the possible ways [a c],[a d],[b c],[b d] as inputs p the number of rows and n the number of column. You will produce a matrix by using these two input inputs. The matrix starts with 1 and increases left to right. The last number in the matrix will be n*p. After that you find the possible ways to reach end of the matrix
Example 1
p = 2; the number of rows n = 2; the number of columns
will produce this output matrix
[1 2 3 4]
Possible ways are [1 3],[1 4],[2 3],[2 4]
output =
1 3
1 4
2 3
2 4Example 2
p = 4; n = 2;
These produce the matrix
[1 2 3 4 5 6 7 8]
Possible ways are [1 3 5 7], [1 3 5 8],...,[2 4 6 8]
output =
1 3 5 7
1 3 5 8
1 3 6 7
1 3 6 8
1 4 5 7
1 4 5 8
1 4 6 7
1 4 6 8
2 3 5 7
2 3 5 8
2 3 6 7
2 3 6 8
2 4 5 7
2 4 5 8
2 4 6 7
2 4 6 8
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers41
Suggested Problems
-
5967 Solvers
-
1470 Solvers
-
271 Solvers
-
80 Solvers
-
Numbers spiral diagonals (Part 1)
296 Solvers
More from this Author21
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!