#include <stdio.h>
#include <stdlib.h>
unsigned long long int r;
int a[5],n,i,j,k,count,g;
int repeat(long int x,int y);
int main(){
int min;
g=0;
min=1234;
if(n<=0)
break;
for(;min<29876;min++){
if(min*n>=98765){
break;
}
k=repeat(min,n);
if(k==1){
if(min<9876){
printf("%d / 0%d = %d\n", min
*n
, min
, n
); g++;
}
else{
printf("%d / %d = %d\n", min
*n
, min
, n
); g++;
}
}
}
if(g==0){
printf("There are no solutions for %d.\n",n
); }
}
}
int repeat(long int x,int y){
count=0;
r=x*y*100000+x;
for(i=0;i<10;i++){
a[i]=r%10;
r/=10;
}
for(i=0;i<10;i++){
for(j=0;j<10;j++){
if(i==j)
continue;
if(a[i]!=a[j])
count++;
}
}
if(count==90)
return 1;
else{
return 0;
}
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KdW5zaWduZWQgbG9uZyBsb25nIGludCByOwppbnQgYVs1XSxuLGksaixrLGNvdW50LGc7CmludCByZXBlYXQobG9uZyBpbnQgeCxpbnQgeSk7CmludCBtYWluKCl7CiAgICBpbnQgbWluOwoJd2hpbGUofnNjYW5mKCIlZCIsJm4pKXsKICAgICAgICBnPTA7CiAgICAgICAgbWluPTEyMzQ7CiAgICAgICAgaWYobjw9MCkKICAgICAgICAgICAgYnJlYWs7CgkJZm9yKDttaW48Mjk4NzY7bWluKyspewoJCSAgICBpZihtaW4qbj49OTg3NjUpewoJCSAgICAgICAgYnJlYWs7CgkJICAgIH0KCQkgICAgaz1yZXBlYXQobWluLG4pOwoJCQlpZihrPT0xKXsKCQkJICAgIGlmKG1pbjw5ODc2KXsKCQkJCSAgICBwcmludGYoIiVkIC8gMCVkID0gJWRcbiIsIG1pbipuLCBtaW4sIG4pOwogICAgICAgICAgICAgICAgICAgIGcrKzsKICAgICAgICAgICAgICAgIH0KCQkJCWVsc2V7CgkJCSAgICAgICAgcHJpbnRmKCIlZCAvICVkID0gJWRcbiIsIG1pbipuLCBtaW4sIG4pOwogICAgICAgICAgICAgICAgICAgIGcrKzsKCQkJCX0KCQkJfQoJCX0KICAgICAgICBpZihnPT0wKXsKICAgICAgICAgICAgcHJpbnRmKCJUaGVyZSBhcmUgbm8gc29sdXRpb25zIGZvciAlZC5cbiIsbik7CiAgICAgICAgfQoJCX0KCX0KaW50IHJlcGVhdChsb25nIGludCB4LGludCB5KXsKICAgIGNvdW50PTA7CiAgICByPXgqeSoxMDAwMDAreDsKCWZvcihpPTA7aTwxMDtpKyspewoJCWFbaV09ciUxMDsKCQlyLz0xMDsKCX0KCWZvcihpPTA7aTwxMDtpKyspewoJZm9yKGo9MDtqPDEwO2orKyl7CgkgICAgaWYoaT09aikKCSAgICAgICBjb250aW51ZTsKICAgICAgICBpZihhW2ldIT1hW2pdKQogICAgICAgICAgIGNvdW50Kys7Cn0KfQppZihjb3VudD09OTApCiAgICByZXR1cm4gMTsKZWxzZXsKICAgIHJldHVybiAwOwp9Cn0=