zoj 1149 双向dp
来源:互联网 发布:淘宝买aj哪家店好16年 编辑:程序博客网 时间:2024/04/30 10:44
本来想学四边形优化DP的,不小心学到了一个双向dp,耗时比优化了还少
Dividing
Time Limit: 1 Second Memory Limit: 32768 KB
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.
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.
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.
Sample Input
1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0
Sample Output
Collection #1:
Can't be divided.
Collection #2:
Can be divided.
Source: Mid-Central European Regional Contest 1999
- zoj 1149 双向dp
- poj2353--双向DP
- poj 2353 双向DP
- 探寻宝藏---双向dp
- HDU 4826 双向DP
- 双向dp题目
- zoj 2402 简单dp
- zoj 2744 DP做法
- zoj 2704 dp
- zoj 1738 dp
- zoj 1027 dp
- zoj 2401 dp
- zoj 3502 Contest //dp
- zoj 1558【DP】
- 【DP】ZOJ 2068
- 树形DP zoj 3527
- zoj 3381(DP+RMQ)
- ZOJ 3463 DP
- Plóya定理
- 如何去除“此邮件可能是垃圾邮件”的主题
- 国庆
- (2010-10-07)VS2008 引用App_Code下的类文件问题解决方法
- FileUpload组件
- zoj 1149 双向dp
- ffmpeg参数设定解说(1) 转
- 用axel加速下载
- uva10112 Myacm Triangles
- 十月七日记
- JVM知识整理
- 大洋蛋...还有3天...倒数349...
- 基于对话框实现工具条提示显示
- C#中如何使用访问修饰符来修饰属性