POJ 1416 Shredding Company

题目： http://poj.org/problem?id=1416

又16ms 1A了，这人品。。。

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

 int n, ans;
 bool rejected;
 char path[], tmp[], ans_path[];

 void dfs(int sum, char s[])
 {
     if(sum > n)return;
     if(s[] == '\0')
     {
         if(sum == ans)rejected = ;
         else if(sum > ans && sum <= n)
         {
             rejected = ;
             ans = sum;
             strcpy(ans_path, path);
         }
         return;
     }
     int len = strlen(s);
     for(int i = ; i <= len; i++)
     {
         int x = s[] - '';
         for(int j = ; j < i; j++)
             x = x *  + s[j] - '';
         int pathlen = strlen(path);

         sprintf(path, "%s %d", path, x);
         //也可以把上面一行写成下面这两行。上面的写法把自己打印到自己，与编译器有关。
         //sprintf(tmp, " %d", x);
         //strcat(path, tmp);

         dfs(x+sum, &s[i]);
         path[pathlen] = '\0';
     }
 }

 int main()
 {
     char s[];
     while(scanf("%d %s", &n, s) != EOF)
     {
         if(n ==  && s[] == '')break;
         ans = -;
         rejected = ;
         int len = strlen(s);
         for(int i = ; i <= len; i++)
         {
             int x = s[] - '';
             for(int j = ; j < i; j++)
                 x = x *  + s[j] - '';
             sprintf(path, "%d", x);
             dfs(x, &s[i]);
         }
         if(ans == -)
             printf("error\n");
         else if(rejected)
             printf("rejected\n");
         else
             printf("%d %s\n", ans, ans_path);
     }
     return ;
 }