Dividing 03多重背包问题
来源:互联网 发布:访页面问升级中新域名 编辑:程序博客网 时间:2024/06/10 15:04
http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1005&ojid=0&cid=3900
Dividing
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 8 Accepted Submission(s) : 2
Problem Description
Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value.
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.
Input
Each line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, ..., n6, where ni is the number of marbles of value i. So, the example from above would be described by the input-line ``1 0 1 2 0 0''. The maximum total number of marbles will be 20000.
The last line of the input file will be ``0 0 0 0 0 0''; do not process this line.
The last line of the input file will be ``0 0 0 0 0 0''; do not process this line.
Output
For each colletcion, output ``Collection #k:'', where k is the number of the test case, and then either ``Can be divided.'' or ``Can't be divided.''.
Output a blank line after each test case.
Output a blank line after each test case.
Sample Input
1 0 1 2 0 01 0 0 0 1 10 0 0 0 0 0
Sample Output
Collection #1:Can't be divided.Collection #2:Can be divided.用到n[i]=n[i]%10; mod10 跟以前的情况就会是一致的否则的话就会超时
#include<cstdio>#include<cstring>using namespace std;int dp[60500];int main(){ int n[7]; int v[7]; int sum=0; int test=1; while(scanf("%d",&n[1])!=EOF) { memset(dp,0,sizeof(dp)); int sum=n[1]; int t; for(int i=2; i<=6; i++) { scanf("%d",&t); n[i]=t%10; sum+=i*n[i]; } if(n[1]==0&&n[2]==0&&n[3]==0&&n[4]==0&&n[5]==0&&n[6]==0) break; if(sum%2==1) { printf("Collection #%d:\nCan't be divided.\n\n",test); test++; continue; } for(int i=1; i<=6; i++) v[i]=i; int V=sum/2; dp[0]=1; for(int i=1; i<=6; i++) { for(int j=0; j<n[i]; j++) { for(int k=V; k>=v[i]; k--) { if(dp[k-v[i]]) dp[k]=1; } } } // for(int i=V;i>=0;i--) //printf("%d %d\n",dp[i],i); if(dp[V]==1) { printf("Collection #%d:\nCan be divided.\n\n",test); test++; } else { printf("Collection #%d:\nCan't be divided.\n\n",test); test++; } } return 0;}
- Dividing 03多重背包问题
- Dividing 多重背包问题
- Dividing----POJ_1014----多重背包问题
- hdu 1059 Dividing--DP-多重背包问题
- poj1014 Dividing 动态规划 多重背包问题
- ZOJ1149 POJ1014 HDU1059 Dividing,多重背包问题
- POJ 1014 Dividing (多重背包问题)
- HDU 1059 Dividing (多重背包问题)
- hdu 1059 多重背包问题 Dividing
- poj 1014 Dividing 多重背包问题
- HDU 1059 Dividing 多重背包问题
- POJ1014--多重背包--Dividing
- 1014 Dividing 多重背包
- Dividing ( 多重背包)
- hdu1059 Dividing 多重背包
- [hdu1059]Dividing 多重背包
- hdu1059 Dividing (多重背包)
- hdoj1059 Dividing 多重背包
- sqlite数据库常用命令及操作
- 学习技术的三部曲:WHAT、HOW、WHY
- 批处理学习(自己简单的bat)
- UML相关工具一览
- [Java IO源码]缓冲流的实现原理
- Dividing 03多重背包问题
- IOS调用摄像头或照片库获取资源
- Hadoop程序调试简易办法
- 【Effective Java】Ch2_创建销毁对象:Item5_避免创建不必要的对象
- UIView的drawRect方法
- 安卓程序UI探测工具
- 程序猿笔记Android客户端说明及项目源码下载!
- java采用压缩解压缩方式修改word中内容或替换标签
- 对于public static void main(String args[])你知几何?