poj 1416 Shredding Company

Shredding Company

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3708 Accepted: 2108

Description

You have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would just shred sheets of paper into little pieces so that the contents would become unreadable, this new shredder needs to have the following unusual basic characteristics.

1.The shredder takes as input a target number and a sheet of paper with a number written on it.

2.It shreds (or cuts) the sheet into pieces each of which has one or more digits on it.

3.The sum of the numbers written on each piece is the closest possible number to the target number, without going over it.

For example, suppose that the target number is 50, and the sheet of paper has the number 12346. The shredder would cut the sheet into four pieces, where one piece has 1, another has 2, the third has 34, and the fourth has 6. This is because their sum 43 (= 1 + 2 + 34 + 6) is closest to the target number 50 of all possible combinations without going over 50. For example, a combination where the pieces are 1, 23, 4, and 6 is not valid, because the sum of this combination 34 (= 1 + 23 + 4 + 6) is less than the above combination's 43. The combination of 12, 34, and 6 is not valid either, because the sum 52 (= 12 + 34 + 6) is greater than the target number of 50.

Figure 1. Shredding a sheet of paper having the number 12346 when the target number is 50

There are also three special rules :

1.If the target number is the same as the number on the sheet of paper, then the paper is not cut.

For example, if the target number is 100 and the number on the sheet of paper is also 100, then

the paper is not cut.

2.If it is not possible to make any combination whose sum is less than or equal to the target number, then error is printed on a display. For example, if the target number is 1 and the number on the sheet of paper is 123, it is not possible to make any valid combination, as the combination with the smallest possible sum is 1, 2, 3. The sum for this combination is 6, which is greater than the target number, and thus error is printed.

3.If there is more than one possible combination where the sum is closest to the target number without going over it, then rejected is printed on a display. For example, if the target number is 15, and the number on the sheet of paper is 111, then there are two possible combinations with the highest possible sum of 12: (a) 1 and 11 and (b) 11 and 1; thus rejected is printed. In order to develop such a shredder, you have decided to first make a simple program that would simulate the above characteristics and rules. Given two numbers, where the first is the target number and the second is the number on the sheet of paper to be shredded, you need to figure out how the shredder should "cut up" the second number.

Input

The input consists of several test cases, each on one line, as follows :

tl num1
t2 num2
...
tn numn
0 0

Each test case consists of the following two positive integers, which are separated by one space : (1) the first integer (ti above) is the target number, (2) the second integer (numi above) is the number that is on the paper to be shredded.

Neither integers may have a 0 as the first digit, e.g., 123 is allowed but 0123 is not. You may assume that both integers are at most 6 digits in length. A line consisting of two zeros signals the end of the input.

Output

For each test case in the input, the corresponding output takes one of the following three types :

sum part1 part2 ...
rejected
error

In the first type, partj and sum have the following meaning :

1.Each partj is a number on one piece of shredded paper. The order of partj corresponds to the order of the original digits on the sheet of paper.

2.sum is the sum of the numbers after being shredded, i.e., sum = part1 + part2 +...

Each number should be separated by one space.
The message error is printed if it is not possible to make any combination, and rejected if there is
more than one possible combination.
No extra characters including spaces are allowed at the beginning of each line, nor at the end of each line.

Sample Input

50 12346376 144139927438 92743818 33129 314225 1299111 33333103 8621506 11040 0

Sample Output

43 1 2 34 6283 144 139927438 92743818 3 3 12error21 1 2 9 9rejected103 86 2 15 0rejected

Source

Japan 2002 Kanazawa

大致题意：给一张数字纸条，放入机器，裁剪得到的数字之和最接近目标数。
题目分析：
1.如果裁剪的最小和大于目标数，则error. 如：10 12345 ：最小和为：1+2+3+4+5 = 15
2.裁剪方法：从头裁剪，一直裁剪到最后，采用深搜，深搜过程简单描述：第一层（1）：1 234，第二层（1）：1 2 34，第三层（1）： 1 2 3 4，第二层（2）：1 23 4， 第一层（2）：12 34 ，第二层（1）：12 3 4 。。。。。
3.每次搜到最后都要比较最优解，并保存最优解。
4.遇到相同的最优解标记一下，不能立即退出，下一次搜到的可能比这个更优。

代码：

#include <stdio.h>#include <string.h>#include <memory.h>int num[7], res[7];char sNum[7];int target, digit;int len, best, total, all;bool flag;/* 获取卡片从start到pos的数字 */int getnum(int start, int pos){int k = start;    int sum = sNum[start]- 48;    k++;    while (k<=pos)    {        sum *= 10;        sum += (sNum[k]-48);        k++;    }    return sum;}void dfs(int pos, int sum){    if (pos == len) // 剪到尾    {        if (sum <= target) // 保证当前和小于目标数        {            if (target-sum < target-best) // 当前更接近目标            {                best = sum;             // 最优解                all = total;            // 切割数字个数                memcpy(res, num, sizeof(num)); // 复制结果                flag = false;                       }            else if (target-sum == target-best) // 出现相同最有解            {                flag = true;            }        }        return;    }    int newNum, cur;    for (int i=pos; i<len; ++i) // 从当前位置cut    {        newNum = getnum(pos, i); // 获取i前面的数        cur = sum+newNum;               if (cur > target)       // 剪枝            continue;        num[total] = newNum; // 存储新数        total++;        dfs(i+1, cur);      // 继续        total--;    }}int main(){    while (scanf("%d%d", &target, &digit), digit||target)    {        if (digit == target)        {            printf("%d %d\n", target, digit);            continue;        }        sprintf(sNum, "%d", digit);        len = strlen(sNum);        int sum = 0;        for (int i=0; i<len; ++i)        {            sum += (sNum[i]-48);        }        if (sum > target)        {            puts("error");        }        else        {            best = 0;            flag = false;            dfs(0, 0);            if (flag)            {            puts("rejected");            }            else            {            printf("%d", best);            for (int i=0; i<all; ++i)            {            printf(" %d", res[i]);            }            putchar('\n');            }        }    }return 0;}