#include<bits/stdc++.h>
using namespace std;
int n,i,j,k,q,p,x,y,t,bb,len,c[10];
bool done(){
return c[0]&&c[1]&&c[2]&&c[3]&&c[4]&&c[5]&&c[6]&&c[7]&&c[8]&&c[9];
}
bool ok;
int main(){
while(scanf("%d",&n)){
if(n==0)break;
if(bb)printf("\n");
bb=1;
ok=0;
for(i=0;i<=9;i++)
for(j=0;j<=9;j++)
if(i!=j)
for(k=0;k<=9;k++)
if(i!=k&&j!=k)
for(q=0;q<=9;q++)
if(i!=q&&j!=q&&k!=q)
for(p=0;p<=9;p++)
if(i!=p&&j!=p&&k!=p&&q!=p){
x=i*10000+j*1000+k*100+q*10+p;
if(x%n==0){
y=x/n;
t=y;
len=0;
memset(c,0,sizeof(c));
while(t){
c[t%10]=1;
t/=10;
len++;
}
if(len<5)c[0]=1;
c[i]=1;
c[j]=1;
c[k]=1;
c[q]=1;
c[p]=1;
if(done()){
ok=1;
printf("%d%d%d%d%d / ",i,j,k,q,p);
for(t=1;t<=5-len;t++)
printf("0");
printf("%d = %d\n",y,n);
}
}
}
if(ok==0)printf("There are no solutions for %d.\n",n);
}
return 0;
}
UVA 725 Division
最新推荐文章于 2020-01-26 22:49:00 发布