FZU Problem 1895 整除45问题

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1005;
const int M = 15;
const int dir[5]= {0,5};
int tmp, rec[M], cnt[M];
int n, s[N], x, id;
bool flag;
char ans[N];
bool cmp(char *a, char *b)
{
    for(int i=0; a[i]; i++)
    {
        if(a[i]!=b[i]) return a[i] < b[i];
    }
    return false;
}
void dfs(int m, int d, int sum)
{
    if(d>=m)
    {
        if((sum-tmp)%9 == 0)
        {
            char now[N];
            memset(now,0,sizeof(now));
            int len = 0;
            for(int i=9; i>=0; i--)
            {
                for(int j = 0; j < cnt[i]; j++)
                    now[len++] = i + ‘0‘;
            }
            now[len++] = dir[id] + ‘0‘;
            if(m < x || (cmp(ans, now) && m == x))
            {
                flag = true;
                x = m;
                strcpy(ans, now);
            }
        }
        return;
    }
    for(int i = 1; i <= 8; i++)
    {
        if(!cnt[i]) continue;
        cnt[i]--;
        dfs(m, d+1, sum+i);
        cnt[i]++;
    }
}
int main()
{
    int cas;
    scanf("%d", &cas);
    for(int i=1; i<=cas; i++)
    {
        char num[N];
        scanf("%s", num);
        x = strlen(num), tmp = 0;
        flag = false;
        memset(rec, 0, sizeof(rec));
        memset(ans, 0, sizeof(ans));
        for(int i=0; i<x; i++)
        {
            int cur = num[i] - ‘0‘;
            tmp += cur;
            rec[cur]++;
        }
        for(int i=0; i<2; i++)
        {
            memcpy(cnt, rec, sizeof(rec));
            cnt[dir[i]]--;
            if (cnt[dir[i]] < 0) continue;
            id = i;
            for(int j=0; j<=tmp && j<=x; j++)
                dfs(j, 0, 0);
        }
        if(!flag)
        {
            printf("impossible\n");
            continue;
        }
        int lenss = strlen(ans),sum1 = 0;
        for(int i = 0; i < lenss; i++)
        {
            sum1 += ans[i] - ‘0‘;
        }
        if(sum1 == 0)
        {
            puts("0");
            continue;
        }
        puts(ans);
    }
    return 0;
}