Permutations with repatitions in c++

[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

[Martin Magnusson]

Roger wrote:

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.

This is much more of a combinatorial problem than a C++ related one. You
will probably be able to get more help at comp.math or a similar group.
Actually, I think there is something related to this in the comp.math
FAQs. http://www.faqs.org/ might be of help.

/ martin