Hello, I am struggling with filling int arrays in the most possible ways.
Lets say I am creating int arrays length of 5 and I pick numbers to it between 1 to 70. In one array there is never same number twice and
the next created array will not have exactly the same numbers sequence that the previous ones had.
Creation of arrays stops only when all possible number sequences are created.
And yes this is for Keno numbers, stupid hobby of mine but it spends time
In this method numbers are processed as follows...
{1, 2, 3, 4, 5}
{1, 2, 3, 4, 6}
.
{1, 2, 3, 4, 70}
{1, 2, 3, 5, 6}
{1, 2, 3, 5, 7}
.
{1, 2, 3, 5, 70}
{1, 2, 3, 6, 7}
{1, 2, 3, 6, 8}
.
{1, 2, 3, 6, 70}
and so on...................
In the end, sum of number sequences for level 5 is 8645 and thats not enough.
If you feel that you could have strength to process this, thanks in advance