UVA 562
来源:互联网 发布:h3c 绑定mac地址 编辑:程序博客网 时间:2024/05/16 01:20
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAXN 1111
int coin[MAXN];
bool dp[111111];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n ,sum =0;
scanf("%d",&n);
for( int i = 0; i < n; i++)
{
scanf("%d",&coin[i]);
sum += coin[i];
}
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for( int i = 0; i < n; i++)
{
for( int j = sum; j >= coin[i]; j--)
if(dp[j - coin[i]])
dp[j] = 1;
}
int res;
for( int i = sum/2; i >= 0; i--)
if(dp[i])
{
res = i;
break;
}
printf("%d\n", abs(sum - 2*res));
}
}
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAXN 1111
int coin[MAXN];
bool dp[111111];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n ,sum =0;
scanf("%d",&n);
for( int i = 0; i < n; i++)
{
scanf("%d",&coin[i]);
sum += coin[i];
}
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for( int i = 0; i < n; i++)
{
for( int j = sum; j >= coin[i]; j--)
if(dp[j - coin[i]])
dp[j] = 1;
}
int res;
for( int i = sum/2; i >= 0; i--)
if(dp[i])
{
res = i;
break;
}
printf("%d\n", abs(sum - 2*res));
}
}
0 0
- UVa 562
- uva 562
- uva 562
- uva 562
- uva 562
- UVA 562
- uva-562
- UVA 562
- uva 562Uva 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
- 解决错误界面的问题
- Linux下安装Mathematica 9的说明
- UVa 1149 - Bin Packing(贪心+二分查找)
- 第十五周项目3-在OJ上玩指针
- ZigBee组网学习笔记(六)--串口透传
- UVA 562
- LaTex 入门3
- Java进阶之支付宝在线支付知识点总结
- 360校园招聘2015技术类笔试题
- 【ASP.net】解析Repeater 控件的模板
- 备份mysql数据库提示marked as crashed and should be repaired when doing LOCK TABLES
- spring cache基本入门例子
- flex按钮控制文本标签内容
- dos攻击种类