UVA - 725 Division

//真的是手生了我擦， 以前做过的题， 愣是敲了一节课，醉了

#include<cstdio>
#include<iostream>
#include<string.h>
using namespace std;
int k[11];
int kk[11];
int solve(int n, int m)
{
    k[0] = n/10000;kk[k[0]]++;
    n %= 10000;
    k[1] = n/1000;kk[k[1]]++;
    n %= 1000;
    k[2] = n/100;kk[k[2]]++;
    n %= 100;
    k[3] = n/10;kk[k[3]]++;
    n %= 10;
    k[4] = n;kk[k[4]]++;
    k[5] = m/10000;kk[k[5]]++;
    m %= 10000;
    k[6] = m/1000;kk[k[6]]++;
    m %= 1000;
    k[7] = m/100;kk[k[7]]++;
    m %= 100;
    k[8] = m/10;kk[k[8]]++;
    m %= 10;
    k[9] = m;kk[k[9]]++;

    for(int i = 0; i < 10; ++i)
    {
        if(kk[i] != 1) return false;
    }
    return true;
}
int main()
{
    int res;
    int kase = 0;
    while(scanf("%d", &res) == 1&& res)
    {
        if(kase) cout << "\n";
        ++kase;
        bool flag = false;
        for(int i = 1; i <=  99999; ++i)
        {
            int n = i;
            memset(k,0,sizeof(k));
            memset(kk,0,sizeof(kk));
            if(!(n%res))
            {
                int m = n/res;
                if(solve(n, m))
                {
                    for(int j = 0; j < 5; ++j) cout << k[j];
                    cout << " " << "/" << " " ;
                    for(int j = 5; j < 10; ++j) cout << k[j];
                    cout << " " << "=" << " " << res;
                    cout << "\n" ;
                    flag = true;
                }
            }
        }
        if(!flag) cout << "There are no solutions for " << res << "." <<endl;
    }
}