Write a function or find a logical way of finding a number X1X2X3... such that
X1 is the amount of zerror's in the number
X2 is the amount of one's
X3 is the amount of two's
and so on
Task is to:
1. Finind smallest number
2. Find largest integer number
3. Find an algorithm and print all numbers...
Position 0: cannot be zerro, so we put "1"
Position 1: cannot be zerror as we have one "1", cannot be "1" or we would violate the condition by having two "1"s, so we choose "2"
Position 2: cannot be zerro as we have one "2", so put "1"
Position 3: can be zerro
So, minimal number is 1210
Maximum number is infinity