UVa 562 - Dividing Coins

//aarifshuvo   ``CSEJU

#include <bits/stdc++.h>
#define ll long long
#define SZ(x) ((int)(x).size())
#define scl(x) scanf("%lld", &x)
#define scll(x,y) scanf("%lld %lld", &x, &y)
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<n;i++)
#define REV(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define pri(a) cout<<a<<endl
#define prii(a,b) cout<<a<<" "<<b<<endl
#define priii(a,b,c) cout<<a<<" "<<b<<" "<<c<<endl
using namespace std;

ll ar[107],n,tot,mem[107][50007];

ll call(ll i,ll sum)
{
    if(i==n)
    {
        return abs(sum-(tot-sum));
    }

    if(mem[i][sum]!=-1) return mem[i][sum];

    return mem[i][sum] = min(call(i+1,sum+ar[i]),call(i+1,sum));
}

int main()
{
    ll t;
    scl(t);
    while(t--)
    {
        scl(n);

        tot = 0;
        REP(i,n) scl(ar[i]),tot+=ar[i];

        memset(mem,-1,sizeof mem);

        ll res = call(0,0);
        printf("%lld\n", res);
    }
    return 0;
}