Division UVA - 725

题目：

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 2 ≤ N ≤ 79.

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.

Input

Each line of the input file consists of a valid integer N. An input of zero is to terminate the program.

Output

Your program have to display ALL qualifying pairs of numerals, sorted by increasing numerator (and, of course, denominator). 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.

Sample Input

61

62

0

Sample Output

There are no solutions for 61.

 

79546 / 01283 = 62

94736 / 01528 = 62

题意：

给你一个数字 N，让你求出来所有的A/B=N的结果，但是0--9只能出现一次；

思路：

直接暴力进行判断，循环B，然后判断 A*N 和 B 是否满足题目的要求，然后输出；

注意输出，每两个测试数据之间输出一个空行；

A和B都是占据5位；

代码如下：

#include