Shredding Company (dfs)
发布日期:2021-10-16 05:05:01
浏览次数:10
分类:技术文章
本文共 6112 字,大约阅读时间需要 20 分钟。
Shredding Company
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 37 Accepted Submission(s) : 17
Problem 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 :<br><br>tl num1<br>t2 num2<br>...<br>tn numn<br>0 0<br><br>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.<br><br>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.<br><br>
Output
For each test case in the input, the corresponding output takes one of the following three types :<br><br>sum part1 part2 ...<br>rejected<br>error<br><br>In the first type, partj and sum have the following meaning :<br><br>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.<br><br>2.sum is the sum of the numbers after being shredded, i.e., sum = part1 + part2 +...<br><br>Each number should be separated by one space.<br>The message error is printed if it is not possible to make any combination, and rejected if there is<br>more than one possible combination.<br>No extra characters including spaces are allowed at the beginning of each line, nor at the end of each line.<br>
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
PKU
题意:
一个碎纸机,给定一个上限数,和一个最长是6位的数字,然后将数字分割,找分割后的数字之和最接近或者等于上限数的情况。
思路:
深搜+剪枝,以每一位作为新的起点开始重新往后分配,求出最大的。
代码:
#include另一种代码是:总共是两个方向,即进入与否。#include #include #include #include #include #include using namespace std;vector v;vector temp;int l,ans,flag,minn;int n;char str[20];void dfs(int pos,int sum) //当前的位数,以及前面形成的数字和{ if(sum>n)return;//剪枝 if(pos>l)return; if(pos==l){ if(sum<=n&&(n-sum) >n>>str) { v.clear(); temp.clear(); s=ss=0; minn=0x3f3f3f3f; if(n==0&&str[0]=='0')break; //结束 l=strlen(str); for(i=0;i n){cout<<"error"<
#include#include #include using namespace std; int a[6],res[6]; int t,num; int digit[7]; int len; int flag; //0:error 1:right 2:double int nMax; void dfs(int sum,int cur,int step){ //sum代表上段和,cur代表目前这段形成的数字和,step代表第几个数字 if(step==len){ if(sum<=t&&sum){ if(sum==nMax){ flag=2; } if(sum>nMax){ nMax=sum; flag=1; for(int i=0;i t) return; int temp; temp=cur*10+digit[step]; if(step >t>>num; if(!t&&!num) break; flag=nMax=0; len=0; memset(a,0,sizeof(a)); int temp; temp=num; while(temp){ digit[len++]=temp%10; temp/=10; } for(int i=0;i
转载地址:https://blog.csdn.net/sinat_37668729/article/details/76869955 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!
发表评论
最新留言
网站不错 人气很旺了 加油
[***.192.178.218]2024年03月25日 23时59分28秒
关于作者
喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!
推荐文章
ArticleDAL
2019-04-25
git 终端显示中文乱码
2019-04-25
关于java.lang.IllegalStateException: getOutputStream() has already been called for this response求解
2019-04-25
oracle 10.2.0.1.0 误删除数据文件 后的处理方法
2019-04-25
JPA 默认值配置
2019-04-25
myeclipse 的 maven工程报错或pom.xml头报错解决办法
2019-04-25
反向Ajax,第2部分:WebSocket
2019-04-25
反向Ajax,第1部分:Comet介绍
2019-04-25
反向Ajax,第3部分:Web服务器和Socket.IO
2019-04-25
反向Ajax,第4部分:Atmosphere和CometD
2019-04-25
反向Ajax,第5部分:事件驱动的Web开发
2019-04-25
Servlet3.0新特性&动态代理
2019-04-25
servlet3 实现请求异步处理
2019-04-25
java线程管理利器:java.util.current的用法举例
2019-04-25
native2ascii.exe的使用
2019-04-25
docker-machine的安装
2019-04-25
用docker-machine创建虚拟主机
2019-04-25
spring mvc 4 + swagger2
2019-04-25
Jenkins之持续构建
2019-04-25
sonarqube 启动不了,异常提示:远程主机强迫关闭了一个现有的连接。
2019-04-25