hdu2152Fruit-上下限母函数
hdu2152
从给出的N种水果中选出限制范围最大M种
然后母函数
#include<iostream>using namespace std;int A[101],B[101],c1[101],c2[101];int main(){int i,j,m,num,N,M,sum;while(scanf("%d%d",&N,&M)!=EOF){for(i=1;i<=N;i++){scanf("%d%d",&A[i],&B[i]);}memset(c1,0,sizeof(c1));memset(c2,0,sizeof(c2));for(i=A[1];i<=B[1];i++)c1[i]=1;//c1[0]=1;for(i=2;i<=N;i++){for(j=0;j<=M;j++){if(c1[j])for(num=A[i];(num+j<=M)&&(num<=B[i]);num++)c2[num+j]+=c1[j];}for(j=0;j<=M;j++){c1[j]=c2[j];c2[j]=0;}}printf("%d\n",c1[M]);}return 0;}