R
Roger
Hello,
I am working on a small private project in c++. For the program
however, I need to be able to generate a list of all possible
combonations for a set of numbers. k = amount of spaces
t = highest number
l = lowest number
I need a function that will give all possible combonations of k spaces
with numbers from l to t ex. l = 0 , t = 2, with k = 5.
00000, 00010, --snip-- , 11111
so numbers will be able to repeat them selves.
Like I said before I need ALL POSSIBLE COMBANATIONS and no repeateing
combanations in the list.
I have worked on this for a while to no avial. Any ideas, code
examples, or direction
I am working on a small private project in c++. For the program
however, I need to be able to generate a list of all possible
combonations for a set of numbers. k = amount of spaces
t = highest number
l = lowest number
I need a function that will give all possible combonations of k spaces
with numbers from l to t ex. l = 0 , t = 2, with k = 5.
00000, 00010, --snip-- , 11111
so numbers will be able to repeat them selves.
Like I said before I need ALL POSSIBLE COMBANATIONS and no repeateing
combanations in the list.
I have worked on this for a while to no avial. Any ideas, code
examples, or direction