Division |

Write a program that finds and displays all pairs of 5-digit numbers that
between them use the digits `0` through `9` once each, such that the
first number divided by the second is equal to an integer *N*, where
.
That is,

`abcde / fghij =` *N*

where each letter represents a different digit. The first digit of one of the numerals is allowed to be zero.

Your output should be in the following general form:

`xxxxx / xxxxx =` *N*

`xxxxx / xxxxx =` *N*

.

.

In case there are no pairs of numerals satisfying the condition, you must
write ```There are no solutions for `*N*`.`". Separate the output for two
different values of *N* by a blank line.

61 62 0

There are no solutions for 61. 79546 / 01283 = 62 94736 / 01528 = 62