hdu 2152 Fruit 母函数之取的个数有最大最小要求
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1781 Accepted Submission(s): 1035
Problem DescriptionInputOutputSample Input#include<stdio.h>#include<string.h>int max[105],min[105];int c1[10050],c2[10050];int main(){ int n,m,i,j,k,ans; while(scanf("%d %d",&n,&m)!=EOF) { ans=0; for(i=1;i<=n;i++) { scanf("%d %d",&min[i],&max[i]); } memset(c1,0,sizeof(c1)); memset(c2,0,sizeof(c2)); for(i=min[1];i<=max[1];i++) c1[i]=1; for(i=2;i<=n;i++) { for(j=0;j<=m;j++) for(k=min[i];k<=max[i]&&k+j<=m;k++) c2[k+j]+=c1[j]; for(j=0;j<=m;j++) { c1[j]=c2[j]; c2[j]=0; } } printf("%d\n",c1[m]); } return 0;}
我个人感觉用指数型母函数也可以 但是只拍出来了一个连样例都过不去的代码
我个人感觉没错啊 为什么就不对吗 求解释 贴下错误代码
#include<stdio.h>
#include<string.h>
int max[105],min[105];
double c1[10050],c2[10050];
double jc[105];
void get()
{
int i;
jc[0]=1;
for(i=1;i<=100;i++)
jc[i]=jc[i-1]*i;
}
int main()
{
int n,m,i,j,k,ans;
get();
while(scanf("%d %d",&n,&m)!=EOF)
{
ans=0;
for(i=1;i<=n;i++)
{
scanf("%d %d",&min[i],&max[i]);
}
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
for(i=min[1];i<=max[1];i++)
c1[i]=1.0/jc[i];
for(i=2;i<=n;i++)
{
for(j=0;j<=m;j++)
for(k=min[i];k<=max[i]&&k+j<=m;k++)
c2[k+j]+=c1[j]/jc[k];
for(j=0;j<=m;j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
printf("%.0lf\n",c1[m]);
}
return 0;
}