UVA 562 Dividing coins 01背包 Commencel

<pre name="code" class="cpp">#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
	return a % b == 0 ? b : gcd(b, a % b);
}
#define MAXN 110
int dp[MAXN*500];
int coin[MAXN];
int main()
{
    //freopen("sample.txt","r",stdin);
    LL sum;
    int T;
    scanf("%d",&T);
    while (T--)
    {
        sum=0;
        int n;
        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 i;
        for (int i=sum/2;i>=0;i--)
            if (dp[i])
        {
            printf("%lld\n",(sum-i)-i);
            break;
        }
    }
    return 0;
}