Dividing coins+uva+01背包
来源:互联网 发布:创意淘宝店铺名字 编辑:程序博客网 时间:2024/04/30 03:14
Description
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
解决方案:求将n块钱币分成两份,两份的最小差值。此题可转01背包来解,总的价值为背包容量,对其进行01背包求解。
code:
#include <iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int dp[60000];int v[200];int main(){ int t; scanf("%d",&t); while(t--){ int n; scanf("%d",&n); int sum=0; for(int i=0;i<n;i++){ scanf("%d",&v[i]); sum+=v[i]; } memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) for(int j=sum;j>=v[i];j--){ dp[j]=max(dp[j],dp[j-v[i]]+v[i]); } int s=fabs(sum-2*dp[sum/2]); printf("%d\n",s); } return 0;}
- Dividing coins+uva+01背包
- UVA 562 Dividing coins(dp + 01背包)
- uva 562 - Dividing coins(01背包)
- UVA 562 Dividing coins(01背包)
- UVA 562 Dividing coins(DP:01背包)
- UVA 562 Dividing coins 01背包 Commencel
- UVA 562 - Dividing coins(01背包)
- UVA - 562 Dividing coins 经典01背包
- UVA - 562 Dividing coins (01背包)
- UVA 562 Dividing coins 01背包
- uva 562 Dividing coins (01背包)
- UVA - 562 - Dividing coins (01背包)
- UVA 562Dividing coins 01背包
- UVA 562Dividing coins(01 背包问题)
- UVA - 562 Dividing coins(01背包)
- uva 562 Dividing coins 01背包
- UVA 562 Dividing coins(01背包)
- UVA-562 Dividing coins(01背包)
- JavaScript--new创建对象的过程
- Repeater多层绑定数据 (三层嵌套循环)获取各层控件的值
- uva321The New Villa
- select, poll, epoll详解(二)
- DOM(基础篇)
- Dividing coins+uva+01背包
- 记录遇到的ios下的bugs[废弃]
- 动态规划总结
- C++ primer 第五版 中文版 第10章 小结
- JAVA基础加强:反射
- Keepalived原理与实战精讲
- javascript 笔记
- AFNetworking下载文件断点续传操作
- 单一职责原则(SRP)