usaco 2.1.4 Subset Sums 【母函数】

(1+x)*(1+x^2)*(1+x^3)*……*x^n   则 x^(n*(n+1)/2) 的系数一半为ans

/*
 ID:   w.x.f.g1
 PROG: subset
 LANG: C++
*/

#include<iostream>
#include<cstring>
#include<fstream>
using namespace std;
typedef long long ll;
ll c1[400],c2[400],c3[400];
int main()
{
    ifstream cin("subset.in");
    ofstream cout("subset.out");
    int n;cin>>n;
    int sum=n*(n+1)/2;
    if(sum&1){cout<<0<<endl;return 0;}
    c1[0]=c1[1]=1;
    for(int i=2;i<=n;i++)
    {
        c3[0]=0,c3[1]=i;
        memset(c2,0,sizeof(c2));
        for(int j=0;j<=sum>>1;j++)
            for(int k=0;k<2&&c3[k]+1<=sum>>1;k++)
                c2[c3[k]+j]+=c1[j];
        copy(c2,c2+sum/2+1,c1);
    }
    cout<<c1[sum>>1]/2<<endl;
}