热门标签 | HotTags
当前位置:  开发笔记 > 编程语言 > 正文

搜索+剪枝POJ1416ShreddingCompany

POJ1416ShreddingCompanyTimeLimit: 1000MSMemoryLimit: 10000KTotalSubmissions: 5231Accepted:

POJ 1416 Shredding Company
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 5231   Accepted: 2964

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
  1 /*这个题目比较难的地方就是记录是如何划分的,我这里用了一个path,path的位数表示划分成了几份,每一位path表示的是这一划分了几个*/
  2 #include
  3 #include
  4 #include
  5 using namespace std;
  6 #include
  7 #define N 10
  8 #include
  9 int tar;
 10 int visit[1000000],rel,path=0;
 11 char paper[N];
 12 int sum(const char *s)/*计算字符串表示的数*/
 13 {
 14     int len=strlen(s+1);
 15     int ans=0;
 16     for(int i=1;i<=len;++i)
 17       ans=ans*10+s[i]-0;
 18     return ans;
 19 }
 20 int get_ws(int n)/*取出n的位数,因为n顶多6位数*/
 21 {
 22     if(n<10) return 1;
 23     if(n<100) return 2;
 24     if(n<1000) return 3;
 25     if(n<10000) return 4;
 26     if(n<100000) return 5;
 27     return 6;
 28 }
 29 int get_pre(int n,int k)/*取出n的前k位*/
 30 {
 31     int ws=get_ws(n);
 32     return n/(int)pow(10.0,ws-k);/*这里pow中要用10.0,因为会有误差,比如pow(10,2)==99*/
 33 }
 34 void dfs(const char* s,int p,int sum1,int len)
 35 {
 36     if(sum1>tar) return;/*剪枝*/
 37     if(len==0)/*边界*//
 38     {
 39         visit[sum1]++;
 40         if(sum1>rel&&sum1<=tar)
 41         {
 42             path=p;
 43             rel=sum1;
 44         }
 45         return;
 46     }
 47     for(int i=1;i<=len;++i)
 48     {
 49         char a[10]={0},b[10]={0};
 50         int j,t;
 51         for(j=1;j<=i;++j)
 52           a[j]=s[j];
 53         a[j+1]=\0;
 54         for(t=1;j<=len;++j,++t)
 55           b[t]=s[j];
 56         b[++t]=\0;
 57         int now=sum(a);/*把a分为一份,枚举a的长度,然后递归分b*/
 58         p=p*10+i;/*记录划分方式*/
 59         dfs(b,p,sum1+now,strlen(b+1));
 60         p/=10;/*回溯*/
 61     }
 62 }
 63 int main()
 64 {
 65     while(scanf("%d%s",&tar,paper+1)==2)
 66     {
 67         int now=sum(paper);
 68         if(tar==0&&now==0) break;
 69         if(tar==now)
 70         {
 71             printf("%d %d\n",tar,tar);
 72             continue;
 73         }
 74         int len=strlen(paper+1);
 75         int su=0;
 76         for(int i=1;i<=len;++i)
 77            su+=paper[i]-0;
 78         if(su>tar)/*如果最小的划分方式都大于tar,那说明是达不到的*/
 79         {
 80             printf("error\n");
 81             continue;
 82         }
 83         dfs(paper,0,0,len);
 84         if(visit[rel]>1)/*到达超过一次,最好用数组统计,不会错,而且空间够*/
 85         {
 86             printf("rejected\n");
 87         }
 88         else{
 89             printf("%d ",rel);
 90             int i=1;
 91             while(path)/*输出划分方式*/
 92             {
 93                 int l=get_pre(path,1);
 94                 int k=l+i-1;
 95                 for(;i<=k;++i)
 96                   printf("%d",paper[i]-0);
 97                   printf(" ");
 98                 int ws=get_ws(path);
 99                 path-=l*(int)pow(10.0,ws-1);
100             }
101             printf("\n");
102         }
103         rel=0;path=0;tar=0;
104         memset(paper,0,sizeof(paper));
105         memset(visit,0,sizeof(visit));
106     /*别忘记初始化*/
107         }
108     return 0;
109 }

搜索+剪枝 POJ 1416 Shredding Company


推荐阅读
  • 本文将介绍如何编写一些有趣的VBScript脚本,这些脚本可以在朋友之间进行无害的恶作剧。通过简单的代码示例,帮助您了解VBScript的基本语法和功能。 ... [详细]
  • 技术分享:从动态网站提取站点密钥的解决方案
    本文探讨了如何从动态网站中提取站点密钥,特别是针对验证码(reCAPTCHA)的处理方法。通过结合Selenium和requests库,提供了详细的代码示例和优化建议。 ... [详细]
  • 1:有如下一段程序:packagea.b.c;publicclassTest{privatestaticinti0;publicintgetNext(){return ... [详细]
  • 在Linux系统中配置并启动ActiveMQ
    本文详细介绍了如何在Linux环境中安装和配置ActiveMQ,包括端口开放及防火墙设置。通过本文,您可以掌握完整的ActiveMQ部署流程,确保其在网络环境中正常运行。 ... [详细]
  • 本文介绍如何通过Windows批处理脚本定期检查并重启Java应用程序,确保其持续稳定运行。脚本每30分钟检查一次,并在需要时重启Java程序。同时,它会将任务结果发送到Redis。 ... [详细]
  • 本章将深入探讨移动 UI 设计的核心原则,帮助开发者构建简洁、高效且用户友好的界面。通过学习设计规则和用户体验优化技巧,您将能够创建出既美观又实用的移动应用。 ... [详细]
  • 离线环境下的Python及其第三方库安装指南
    在项目开发中,有时会遇到电脑只能连接内网或完全无法联网的情况。本文将详细介绍如何在这种环境下安装Python及其所需的第三方库,确保开发工作的顺利进行。 ... [详细]
  • golang常用库:配置文件解析库/管理工具viper使用
    golang常用库:配置文件解析库管理工具-viper使用-一、viper简介viper配置管理解析库,是由大神SteveFrancia开发,他在google领导着golang的 ... [详细]
  • 本文探讨了如何通过最小生成树(MST)来计算严格次小生成树。在处理过程中,需特别注意所有边权重相等的情况,以避免错误。我们首先构建最小生成树,然后枚举每条非树边,检查其是否能形成更优的次小生成树。 ... [详细]
  • 本文详细介绍了IBM DB2数据库在大型应用系统中的应用,强调其卓越的可扩展性和多环境支持能力。文章深入分析了DB2在数据利用性、完整性、安全性和恢复性方面的优势,并提供了优化建议以提升其在不同规模应用程序中的表现。 ... [详细]
  • PHP 编程疑难解析与知识点汇总
    本文详细解答了 PHP 编程中的常见问题,并提供了丰富的代码示例和解决方案,帮助开发者更好地理解和应用 PHP 知识。 ... [详细]
  • 深入理解OAuth认证机制
    本文介绍了OAuth认证协议的核心概念及其工作原理。OAuth是一种开放标准,旨在为第三方应用提供安全的用户资源访问授权,同时确保用户的账户信息(如用户名和密码)不会暴露给第三方。 ... [详细]
  • 国内BI工具迎战国际巨头Tableau,稳步崛起
    尽管商业智能(BI)工具在中国的普及程度尚不及国际市场,但近年来,随着本土企业的持续创新和市场推广,国内主流BI工具正逐渐崭露头角。面对国际品牌如Tableau的强大竞争,国内BI工具通过不断优化产品和技术,赢得了越来越多用户的认可。 ... [详细]
  • 数据管理权威指南:《DAMA-DMBOK2 数据管理知识体系》
    本书提供了全面的数据管理职能、术语和最佳实践方法的标准行业解释,构建了数据管理的总体框架,为数据管理的发展奠定了坚实的理论基础。适合各类数据管理专业人士和相关领域的从业人员。 ... [详细]
  • DNN Community 和 Professional 版本的主要差异
    本文详细解析了 DotNetNuke (DNN) 的两种主要版本:Community 和 Professional。通过对比两者的功能和附加组件,帮助用户选择最适合其需求的版本。 ... [详细]
author-avatar
鍾情噯伱_616
这个家伙很懒,什么也没留下!
PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具 | 在线工具
Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved | 京公网安备 11010802041100号 | 京ICP备19059560号-4 | PHP1.CN 第一PHP社区 版权所有