hdu-2152 Fruit

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2152

母函数：代码：#include<stdio.h>#include<string.h>int main(){int c1[120],c2[120],min[120],max[120];int i,j,k,t,n,m;while(~scanf("%d%d",&n,&m)){memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));for(i=0;i<n;i++)  scanf("%d %d",&min[i],&max[i]);for(i=min[0];i<=max[0];i++)  c1[i]=1;for(i=1;i<n;i++){for(j=0;j<=m;j++){for(k=min[i];k+j<=m&&k<=max[i];k++)c2[j+k]+=c1[j];}for(j=0;j<=m;j++){c1[j]=c2[j];c2[j]=0;    }}printf("%d\n",c1[m]);}return 0;}