uva 725

baoli

/*************************************************************************
    > File Name: 725.cpp
    > Author: ma6174
    > Mail: ma6174@163.com 
    > Created Time: 2015年11月23日 星期一 14时56分21秒
 ************************************************************************/
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<string.h>
using namespace std;

int judge(int i,int b){
	if(b>98765)	return 0;
	int aum[10],x;
	memset(aum,0,sizeof(aum));
	if(i<10000)	aum[0]=1;
	while(i){
		x=i%10;
		i/=10;
		aum[x]=1;
	}
	while(b){
		x=b%10;
		b/=10;
		aum[x]=1;
	}
	int sum=0;
	for(int w=0;w<10;w++){
		sum+=aum[w];
	}
	if(sum==10)
		return 1;
	else return 0;
}
int main(){
	int n,T;
	while(scanf("%d",&n)&&n){
		if(T++) printf("\n");
		int count=0;
		for(int i=1234;i<100000;i++){
			if(judge(i,n*i)){
				/*if(i<10000)
					cout<<n*i<<" / 0"<<i<<" = "<<n<<endl;
				else 
					cout<<n*i<<" / "<<i<<" = "<<n<<endl;*/
				printf("%05d / %05d = %d\n",i*n,i,n);
				count++;
			}
		}
		if(count==0){
			cout<<"There are no solutions for "<<n<<"."<<endl;
			//cout<<endl;
			//count=0;
		}
	}
	return 0;
}