So I am working on my ultimate project and I have come so far that I won't stop now. To the thing, I need either a program or file that can calculate/countains all possible combinations of 111, 222, 333, 444, 555 and 666. They should come in this fashion, 111,222,333 and 111,222,333,444 . [All spots/slots can contain same numbers-> 111,111,111/222,222,222,222] [Every combination ONCE] There should be 216 different combinations in X3 rows and 1896 in X4. Liefully yours, Sam190.
I have no idea of what you speak but if the numbers have no constraints on which its length can be, then the answer is infinity. You can write any number and I can write one that is larger in the same sequence. Try picking up a pencil and working it out on paper! 216 combinations would be no worse than writing lines for misbehaving in school.
While that may be right, writing nearly 2k sets is just plain nonsense. There is 6 different numbers/values like 111, 222, 333, 444, 555, 666 aaa, bbb, ccc, ddd, eee, fff 1, 2, 3, 4, 5, 6 a, b, c, d, e, f Six different values. Anything like that.
