Shredding Company(dfs)

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

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

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

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

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

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

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