uva725 Division

#include <fstream>
#include <iostream>
#include <string>
#include <cstring>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>
#include <ctime>
#include<bits/stdc++.h>
using namespace std;
int v[20],n;
bool check(int x)
{
memset(v,0,sizeof(v));
int t=x;
while(t){
int a=t%10;
if(v[a]) return false;
else v[a]=1;
t/=10;
}
int ans=n*x;
if(ans>98765) return false;
while(ans){
int a=ans%10;
if(v[a]||(x<=9876&&a==0)) return false;
else v[a]=1;
ans/=10;
}
if(x<=98765) v[0]=1;
int sum=0;
for(int i=0;i<=9;i++) sum+=v[i];
return sum==10;
}
int main()
{
#ifdef yxj
freopen("C:\\Users\\MrYxJ\\Desktop\\in.txt","r",stdin);
freopen("C:\\Users\\MrYxJ\\Desktop\\out.txt","w",stdout);
#endif // yxj
int cnt=0;
while(scanf("%d",&n)&&n){
int ok=0;
if(cnt++) printf("\n");
for(int i=1234;i<50000;i++){
if(check(i)){
ok=1;
if(i<=9876) printf("%05d / 0%04d = %d\n",i*n,i,n);
else printf("%05d / %05d = %d\n",i*n,i,n);
}
}
if(!ok) printf("There are no solutions for %d.\n",n);
}
}