暴力。。注意清空数组a
#include<cstdio>
#include<cstring>using namespace std;
int a[20];
int main(){
int N,L=0;
while(scanf("%d",&N)!=EOF&&N){
int maxn=0;
if(L) printf("\n"); L=1;
for(int i=0;i<=9;i++)
for(int j=0;j<=9;j++){
if(j==i) continue;
for(int n=0;n<=9;n++){
if(n==j||n==i) continue;
for(int m=0;m<=9;m++){
if(m==i||m==n||m==j) continue;
for(int k=0;k<=9;k++){
if(k==i||k==j||k==n||k==m) continue;
int ans,cnt=0; ans=i*10000+j*1000+n*100+m*10+k;
int kase=ans*N;
int t=kase,bbs=1;
memset(a,0,sizeof(a));
if(kase<1234||kase>98765) continue;
while(t>0){
int q=t%10;
a[cnt++]=q; t=t/10;
}
for(int z=0;z<5;z++)
if(a[z]==i||a[z]==j||a[z]==n||a[z]==m||a[z]==k) {bbs=0;break;}
for(int z=0;z<4;z++)
for(int x=z+1;x<5;x++)
if(a[z]==a[x]) { bbs=0;break; }
if(bbs==1){
printf("%d%d%d%d%d / %d%d%d%d%d = %d\n",a[4],a[3],a[2],a[1],a[0],i,j,n,m,k,N); maxn++;
}
}
}
}
}
if(maxn==0)
printf("There are no solutions for %d.\n",N);
}
return 0;
}