Shredding Company(dfs)

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

题意：将一个数分成几部分，使其分割的各个数的和最大并且小于所给的数。

凌乱了。。参考的会神的代码。。orz...

#include <stdio.h>
#include <string.h>

int arr[102],ans[102];
int max,len,f;
int a,b;

void dfs(int n,int now,int sum,int k,int t)
{
    int m = n % 10;
    if (!n)
    {
        arr[k] = now;
        if (sum + now > a)
            return  ;
        if (sum + now ==max)
            f++;
        if (sum +now > max)
        {
            max = sum + now;
            f = 1;
            len = k;
            for (int i = 1; i <= k; i ++)
            {
                ans[i] = arr[i];
            }

        }
        return ;
    }
    dfs(n/10,now+t*m,sum,k,t*10);
    arr[k] = now;
    dfs(n/10,m,sum+now,k+1,10);
}
int main()
{
    while(~scanf("%d%d",&a,&b)&&a&&b)
    {
        max = 0;
        f = 0;
        dfs(b/10,b%10,0,1,10);
        if (max==0)
        {
            printf("error
");
            continue;
        }
        if (f > 1)
        {
            printf("rejected
");
            continue;
        }
        printf("%d",max);
        for (int i = len; i >= 1; i --)
        {
            printf(" %d",ans[i]);
        }
        printf("
");
    }
    return 0;
}