poj1416Shredding Company

http://poj.org/problem?id=1416

乱七八糟的改，乱七八糟的错，最后过了样例 1A了 。对于每个分割开的数来说 有几种组合方式 搜下去

#include <iostream>
#include<cstdio>
#include<cstring>
#define INF 10000000
using namespace std;
int n,m,num[10],sum,g,vis[10],di,tt,mi,f;
char oo[10][10],o[10][10];
void dfs(int x,int sum,int v)
{
    int i,j,flag=0,y=1,ss,k;
    char si[10];
    if(x>g)
    {
        if(n-sum<mi)
        {
            f = 0;
            mi = n-sum;
            for(i = v-1 ; i>=1 ; i--)
                strcpy(oo[i],o[i]);
            tt = v-1;
        }
        else
        if(n-sum==mi)
        {
            if(f)
            return ;
            if(v-1!=tt)
            {
                f = 1;
                return;
            }
            for(i = 1; i < v ; i++)
                if(strcmp(oo[i],o[i])!=0)
                {
                    f = 1;
                    break;
                }
        }
        return ;
    }
    for(i = 0; i < g ; i++)
    {
        ss = 0;
        y = 1;
        k = 0;
        for(j = x ; j <= i+x&&j<=g ; j++)
        {
            ss+=y*num[j];
            si[k++] = num[j]+'0';
            y = y*10;
        }
        if(ss+sum>n)
        break;
        y = j;
        for(j = k-1 ; j>=0 ; j--)
        o[v][k-1-j] = si[j];
        o[v][k] = '\0';
        dfs(y,ss+sum,v+1);
    }
}
int main()
{
    int i,j,k;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)
        break;
        memset(oo,0,sizeof(oo));
        mi = INF;
        if(n==m)
        {
            cout<<n<<" "<<m<<endl;
            continue;
        }
        g =0 ;sum=0;k=0;di=0;f=0;
        while(m)
        {
            g++;
            num[g] = m%10;
            m = m/10;
        }
        for(i = 1; i <= g ; i++)
        sum+=num[i];
        if(sum>n)
        {
            puts("error");
            continue;
        }
        sum = 0;
        dfs(1,0,1);
        if(f)
            puts("rejected");
        else
        {
            cout<<n-mi<<" ";
            for(i = tt; i > 1 ; i--)
            cout<<oo[i]<<" ";
            cout<<oo[1]<<endl;
        }
    }
    return 0;
}