CHALLENGE: Permutation of digits 💻⌨️🖱️

Question

Level: easy
Initial number n is an integer greater than 0.
Try to rearrange the digits of the initial number so that the new number is divisible by inital number (the new number contains exactly the same digits as the initial number, but in a different order) .
For example:
Input: 100035
Output: Possible (300105)
300105/10035=3
Input: 102345
Output: Impossible
NOTE:
✔️ Use any language.
🚫 Don't use: String, char or char array.
https://code.sololearn.com/cuzywif8t9r7/?ref=app

Answer 1

https://code.sololearn.com/cneNRX712MWQ/?ref=app

Answer 2

trying

Answer 3

I couldn't work out a way in python in which I wouldn't have to use a string if I gave an input. But here is my try with input.
https://code.sololearn.com/c3l5QqWibfXh/?ref=app

Answer 4

Good, I work.

Answer 5

My code in python:
https://code.sololearn.com/cEzxsNe2JHcg/?ref=app

Answer 6

For digits, I replaced the dictionary with the list and removed the check for presence in it - it seems to me that this should work faster.
Для цифр заменил словарь на список и убрал проверку на присутствие в нём - мне кажется, что так должно работать быстрее.
https://code.sololearn.com/csdrXhOC6hCR/?ref=app

Answer 7

I deliberately refused to go through all the permutations of the digits, since for large numbers this is too slow.

Answer 8

my try
https://code.sololearn.com/cElbZoz29uV5/?ref=app