2189 ACM 母函数 素数

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

int main(){
    int num[35]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149};
    int n,k,i,j,t;
    int c1[160],c2[160];
    cin>>t;
    while(t--){
        memset(c1,0,sizeof(c1));
        memset(c2,0,sizeof(c2));
        cin>>n;
        for(i=0;i<=n;i+=2)
        {
            c1[i]=1;
        }
        for(i=1;i<35;i++)
        {
            for(j=0;j<=n;j++)
            {
                for(k=0;k+j<=n;k+=num[i])
                {
                    c2[j+k]+=c1[j];
                }
            }
            for(j=0;j<=n;j++)
            {
                c1[j]=c2[j];
                c2[j]=0;
            }
        }
        cout<<c1[n]<<endl;
    }
    return 0;
}