UVA 562 Dividing coins
来源:互联网 发布:iphone英语翻译软件 编辑:程序博客网 时间:2024/04/29 09:26
Dividing coins
It's commonly known that the Dutch have invented copper-wire. Two Dutch men were fighting over a nickel, which was made of copper. They were both so eager to get it and the fighting was so fierce, they stretched the coin to great length and thus created copper-wire.
Not commonly known is that the fighting started, after the two Dutch tried to divide a bag with coins between the two of them. The contents of the bag appeared not to be equally divisible. The Dutch of the past couldn't stand the fact that a division should favour one of them and they always wanted a fair share to the very last cent. Nowadays fighting over a single cent will not be seen anymore, but being capable of making an equal division as fair as possible is something that will remain important forever...
That's what this whole problem is about. Not everyone is capable of seeing instantly what's the most fair division of a bag of coins between two persons. Your help is asked to solve this problem.
Given a bag with a maximum of 100 coins, determine the most fair division between two persons. This means that the difference between the amount each person obtains should be minimised. The value of a coin varies from 1 cent to 500 cents. It's not allowed to split a single coin.
Input
A line with the number of problems n, followed by n times:- a line with a non negative integer m () indicating the number of coins in the bag
- a line with m numbers separated by one space, each number indicates the value of a coin.
Output
The output consists of n lines. Each line contains the minimal positive difference between the amount the two persons obtain when they divide the coins from the corresponding bag.Sample Input
232 3 541 2 4 6
Sample Output
01
题意: 一对金币,要求你把它分成两堆,并算出它们的最小差值。
分析:01背包,只要把总金币额的一半作为背包即可。
#include <stdio.h>#include <string.h>int a[105];int f[25005];int main(){ int n, m, i,j, T, sum; scanf("%d",&T); while(T--) { scanf("%d",&n); sum = 0; for(i=0; i<n; i++) { scanf("%d",&a[i]); sum += a[i]; } m = sum>>1; memset(f,0,sizeof(f)); f[0] = 1; for(i=0; i<n; i++) for(j=m; j>=a[i]; j--) f[j] = f[j] || f[j-a[i]]; for(i=m; i>=0; i--) if(f[i]) break; printf("%d\n",sum - 2*i); } return 0;}
- uva 562 Dividing coins
- uva:562 - Dividing coins
- UVA 562 Dividing coins
- Uva 562 Dividing coins
- UVa 562 - Dividing coins
- UVA 562 Dividing coins
- uva 562 Dividing Coins
- UVa 562 - Dividing coins
- UVa 562 - Dividing coins
- uva 562 - Dividing coins
- uva 562 Dividing coins
- UVa 562 - Dividing coins
- UVa 562 Dividing Coins
- Uva-562- Dividing coins
- UVA 562 Dividing coins
- UVa 562: Dividing Coins
- UVA - 562 Dividing coins
- uva 562 Dividing coins
- 导数据语句
- JS刷新框架中的其他页面&&JS刷新窗口方法汇总
- 阶乘和
- 【IDE-Visual Studio】启动出错(chenlu-4):Run-Time Check Failure #0
- 浏览器兼容之旅的第二站:各浏览器的Hack写法
- UVA 562 Dividing coins
- jbpm工作流_1
- IE8 window.open不能新窗口打开
- oracle实现自增长列
- 黑马程序员之java中命名规范(Naming Conventions)
- SQL基础
- HDU--杭电--1358--Period--KMP--next值的应用
- poj 1469 COURSES----二分图
- hdu 1072 Nightmare (bfs+贪心)