除法(Division, UVa 725)

先对分子的五位数进行排列，如若两两不相等，则乘上给的积得到分母

将分母拆分成五位数，对以上的十位数再次判断是否两两不相等

如若两两不相等，输出

利用set容器判断是不是两两不相等，

#include <iostream>
#include <cstring>
#include <set>
using namespace std;
bool different(int a, int b, int c, int d, int e, int f, int g, int h, int i, int j)
{
	set<int> s;
	s.insert(a); s.insert(b); s.insert(c); s.insert(d); s.insert(e);s.insert(f); s.insert(g);
	s.insert(h); s.insert(i); s.insert(j);
	return s.size() == 10;
}
bool different(int a, int b, int c, int d, int e)
{
	set<int> s;
	s.insert(a); s.insert(b); s.insert(c); s.insert(d); s.insert(e);
	return s.size() == 5;
}
void print(int N)
{
	int ok = 0;
	for(int f = 0; f <= 9; f++)
		for(int g = 0; g <= 9; g++)
			for(int h = 0; h <= 9; h++)
				for(int i = 0; i <= 9; i++)
					for(int j = 0; j <= 9; j++)
						if(different(f,g,h,i,j) )
						{
							
								int numerator = j + i*10 + h*100 + g*1000 + f*10000;
								int denominator = N*numerator;
								if(denominator >= 12345 && denominator <= 98765)
								{
									int e = denominator % 10; denominator = denominator / 10;
									int d = denominator % 10; denominator = denominator / 10;
									int c = denominator % 10; denominator = denominator / 10;
									int b = denominator % 10; denominator = denominator / 10;
									int a = denominator % 10; denominator = denominator / 10;
									if(different(a,b,c,d,e,f,g,h,i,j) )
									{
										ok = 1;
										cout<<a<<b<<c<<d<<e<<" / "<<f<<g<<h<<i<<j<<" = "<<N<<endl;
									}
								}
						}
	if(ok == 0)	
		cout<<"There are no solutions for " << N << "."<<endl;
}
int main()
{
	int N, kn = 0;
	while(cin >> N && N) 
	{
		if(kn) cout<<endl; kn++;
		print(N);
	}
	return 0;
}