PT母函数

#include<stdio.h>
#include<string.h>
int pri(int x){
	for(int i=2;i<x;i++)
	if(x%i==0){
		return 0;
		break;
	}
	return 1;
}
int main(){
	int z =0,p[155];
	int a[10010],b[10010],n,m;
	for(int i=2;i<=150;i++){
		if(pri(i))p[z++] = i;
	}
	scanf("%d",&n);
	while(n--){
		//memset(a,0,sizeof(a));
		scanf("%d",&m);
		memset(a,0,sizeof(a));
		a[0] =1;
		for(int i=0;p[i]<=m;i++){
		    for(int j=0;j<=m;j++)
		    for(int k=0;k*p[i]+j<=m;k++)
		    b[k*p[i]+j] += a[j];
		    for(int j= 0;j<=m;j++){
    			 a[j] = b[j];
    			 b[j] = 0;
    		}
		   
		}
		printf("%d\n",a[m]);	 
	}
}