3934: Violent division
内存限制：128 MB
时间限制：100.000 S
评测方式：文本比较
命题人：
提交：11
解决：5
题目描述
Enter a positive integer n, 2<=n<=79.
Output all expressions like: abcde/fghij=n in ascending order,
where a~j are numbers from 0~9, each number of a~j is different.
E.g.
abcde = 79546, fghij = 01283, so 79546/01283=62, a~j is a permutation of 0~9.
Now given a result n, you should write a program to find all expressions satisfied abcde/fghij=n.
Output all ex
where a~j are numbers from 0~9, each number of a~j is different.
E.g.
abcde = 79546, fghij = 01283, so 79546/01283=62, a~j is a permutation of 0~9.
Now given a result n, you should write a program to find all ex
输入
The input consists of multiple lines, one integer one line, 2<=n<=79
输出
The expression is output by ascending order for each input n.
If there are no expression for input n, it is no need to output.
If there are no ex
样例输入 复制
62样例输出 复制
79546/01283=62
94736/01528=62