Search:

I cant write : for(int i=0; i<2^500;i++)
I think is better working with strings.

Binary counting is not enaugh becauce has a 2^k limit (k=32 or 64) .I need combinations up to 1000 caracters(2^1000!!!).
If this is easier i want this order 1-digit , 2-digit ..... n-digit...

Hello all.
I need a function that produces this strings
a , b, aa ,ab, ba ,bb ,aaa,aab, aba ,abb baa ,bab ,bba , bbb ,aaaa...
It 's NOT exactly like binary counting (in binary after bbb (111) is...