POJ 1416 Shredding Company【dfs入门】

Shredding Company

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 6860		Accepted: 3710

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 12346

376 144139

927438 927438

18 3312

9 3142

25 1299

111 33333

103 862150

6 1104

0 0

Sample Output

43 1 2 34 6

283 144 139

927438 927438

18 3 3 12

error

21 1 2 9 9

rejected

103 86 2 15 0

rejected

Source

Japan 2002 Kanazawa

题意概括：

给一个目标值 T ，和一串数字（最多六个），切分这串数字使得最后切出来的数字和最接近T（但不可以大于T）

一、如果目标值和原数字值相同不可以切分；

二、如果最小的切分结果都大于 T 则输出 “error”；

三、如果切分的最优结果不唯一则输出“rejected”；

四、如果可切分并且结果唯一，输出最优值和切分结果。

解题思路：

我们知道如果原字串长度为 N ，则我们最多可以切 N-1 次；

根据数据范围可直接DFS，无需剪枝，暴力遍历所有可能找出最优值。

AC code：

///POJ 1416 dfs

#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <cmath>

#define INF 0x3f3f3f3f

#define ll long long int

using namespace std;

int dis[];

int num[], t[], v[];

char ch[];

int max_N, cnt;

int tar, top, N, len;

void dfs(int x, int m, int cap)

{

    int y;

    bool flag;

    if(x==len)      ///到达末尾

    {

        if(max_N > m) return;      ///当前值小于最优值

        flag = ;

        for(int i = ; i < cap; i++) ///判断两种切分是否相同

            if(t[i]!=v[i]) flag = ;

        if(max_N < m)       ///当前值优于最优值

        {

            max_N = m;

            cnt = cap;

            for(int i = ; i < cap; i++) t[i]=v[i];

        }

        if(flag) dis[m]++;  ///记录最优值 m 的出现次数

        return;

    }

    y = ;

    for(int i = x; i < len; i++)  ///从 X 开始遍历当前这一段的不同长度的结果

    {

        y = y*+num[i];

        if(y+m<=tar)               ///这一段可以加上num[ i ]

        {

            v[cap] = y;

            dfs(i+, y+m, cap+);  ///进入下一段

        }

        else break;

    }

}

int main()

{

    while(~scanf("%d", &tar))

    {

        scanf("%s", &ch);

        if(tar ==  && ch[] == '') break;

        len = ;

        memset(dis, , sizeof(dis));

        memset(v, , sizeof(v));

        memset(t, , sizeof(t));

        int sum = ;

        for(int i = ; ch[i] != '\0'; i++)

        {

            num[i] = ch[i]-'';

            N = N*+num[i];

            sum+=num[i];

            len++;

        }

        if(sum > tar || (sum == tar && top>)) {printf("error\n"); continue;}

        if(N == tar) {printf("%d\n", N); continue;}

        max_N = , cnt = ;

        dfs(, , );

        if(dis[max_N]!=) printf("rejected\n");

        else

        {

            printf("%d", max_N);

            for(int i = ; i < cnt; i++)

                printf(" %d", t[i]);

            puts("");

        }

    }

    return ;

}