HDU-1059-Dividing-多重背包
来源:互联网 发布:淘宝卖童装的好店名字 编辑:程序博客网 时间:2024/05/10 16:54
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.
#include <iostream>#include <string.h>#include <stdio.h>using namespace std;int arr[7], opt[120000], cnts[120000];int main() {//freopen("in.txt","r",stdin);int c=0;while (true) {c++;int cnt = 0, sum = 0;for (int i = 1; i <= 6; i++) {cin >> arr[i];if (arr[i] == 0)cnt++;elsesum += arr[i] * i;}if (cnt == 6)break;if (sum % 2) {printf("Collection #%d:\nCan't be divided.\n\n",c);continue;}sum >>= 1; //初2memset(opt, 0, sizeof(int) * (sum + 1));for (int i = 1; i <= 6; i++) {if(arr[i] == 0) continue;memset(cnts, 0, sizeof(int) * (sum + 1));for (int j = i; j <= sum; j++) {if (opt[j] < opt[j - i] + i && cnts[j-i] < arr[i]) {opt[j] = opt[j - i] + i;cnts[j] = cnts[j - i] + 1;}}}if (opt[sum] != sum) {printf("Collection #%d:\nCan't be divided.\n\n",c);} elseprintf("Collection #%d:\nCan be divided.\n\n",c);}return 0;}
- hdu 1059 Dividing 多重背包
- hdu 1059 Dividing(多重背包)
- hdu 1059 Dividing(多重背包)
- HDU 1059 Dividing(多重背包)
- hdu 1059 Dividing 多重背包
- Hdu 1059 Dividing -- 多重背包
- hdu 1059 Dividing 多重背包
- HDU-1059-Dividing-多重背包
- HDU-1059 Dividing 多重背包
- hdu 1059 Dividing (多重背包)
- HDU 1059 Dividing 多重背包
- Hdu 1059 Dividing (多重背包)
- HDU 1059 Dividing 多重背包
- hdu-1059-多重背包-Dividing
- HDU 1059 Dividing 多重背包
- HDU 1059 Dividing(多重背包)
- 【多重背包】HDU 1059 Dividing
- hdu 1059 Dividing 多重背包
- A. Mountain Scenery
- gnuplot 使用方法
- python乱码问题
- mysql判断某一张表是否存在
- 解决JS弹出新窗口被浏览器阻止的解决方案
- HDU-1059-Dividing-多重背包
- python datetime,time转换操作
- 【windows7没有声音解决思路】
- WaitForSingleObject 和 WaitForMultipleObjects函数
- Github使用指南
- Ubuntu VirtualBox中实现文件夹共享
- c语言中常用的字符串处理函数
- H264 Reference picture lists
- HLA仿真数据分发管理