Given an n-digit number(all digits are unique), write a working  code to generate permutations of all numbers possible using one or more digits from the input number.Eg: Input: 123Output:123121321233132123132213231312321

To generate permutations of all numbers possible using one or more digits from the input number, you can follow these steps:

1. Convert the input number into a string to easily access individual digits.
2. Create an empty list to store the permutations.
3. Define a recursive function that takes three parameters: the current permutation, the remaining digits, and the list to store the permutations.
4. Inside the recursive function, if there are no remaining digits, add the current permutation to the list of permutations.
5. Otherwise, iterate through the remaining digits.
6. For each digit, add it to the current permutation and remove it from the remaining digits.
7. Call the recursive function again with the updated current permutation and remaining digits.
8. After the recursive call, remove the added digit from the current permutation and add it back to the remaining digits.
9. Finally, call the recursive function with an empty current permutation and all the digits of the input number.
10. Return the list of permutations.

Here is an example implementation in Python:

def generate_permutations(current_permutation, remaining_digits, permutations):
    if len(remaining_digits) == 0:
        permutations.append(current_permutation)
    else:
        for i in range(len(remaining_digits)):
            digit = remaining_digits[i]
            generate_permutations(current_permutation + digit, remaining_digits[:i] + remaining_digits[i+1:], permutations)
            
            # Remove the added digit from the current permutation and add it back to the remaining digits
            current_permutation = current_permutation[:-1]
            remaining_digits = remaining_digits[:i] + digit + remaining_digits[i+1:]
            
def generate_all_permutations(input_number):
    permutations = []
    generate_permutations("", str(input_number), permutations)
    return permutations

# Example usage
input_number = 123
permutations = generate_all_permutations(input_number)
print(permutations)

This code will output: ['123', '132', '213', '231', '312', '321']