Uva 725 除法

/*#include <stdio.h>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    int a[10] = {0,1,2,3,4,5,6,7,8,9};
    while(scanf("%d",&n),n) {

        bool flag = false;
        do {

            int s = 0;
            for(int i=0;i<5;i++) {
                s = s*10 + a[i];
            }
            int t = 0;
            for(int i=5;i<10;i++) {
                t = t*10 + a[i];
            }
            if(s%t==0&&s/t==n) {
                flag = 1;
                printf("%d%d%d%d%d / %d%d%d%d%d = %d\n",a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8],a[9],n);
            }

        }while(next_permutation(a,a+10));

        if(!flag)
            printf("There are no solutions for %d.\n",n);

    }

    return 0;
}
*/

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main() {

    //freopen("in.txt","r",stdin);
    int n;
    int kase = 0;
    char buf[99];
    while(scanf("%d",&n),n) {

        if(kase++)
            printf("\n");
        int cnt = 0;
        for(int fghij = 1234;;fghij++) {
            int abcde = fghij*n;
            sprintf(buf,"%05d%05d",abcde,fghij);
            if(strlen(buf)>10) break;
            sort(buf,buf+10);
            bool ok = true;
            for(int i=0;i<10;i++) {
                if(buf[i]!=‘0‘+i) ok = false;
            }

            if(ok) {
                cnt++;
                printf("%05d / %05d = %d\n",abcde,fghij,n);
            }


        }
        if(!cnt)
            printf("There are no solutions for %d.\n",n);

    }


    return 0;
}