hdu-1028-Ignatius and the Princess III
2014-08-11 09:15
357 查看
母函数:
程序:#include<stdio.h>
#include<string.h>
int a[130],b[130],n;
void gf()
{
int i,j,k;
for(i=2;i<=n;i++)
{
for(j=0;j<=n;j++)
{
for(k=0;k+j<=n;k+=i)
{
a[j+k]+=b[j];
}
}
for(j=0;j<=n;j++)
{
b[j]=a[j];
a[j]=0;
}
}
}
int main()
{
int i;
while(scanf("%d",&n)!=EOF)
{
memset(b,0,sizeof(b));
for(i=0;i<=n;i++)
{
a[i]=0;
b[i]=1;
}
gf();
printf("%d\n",b
);
}
return 0;
}
程序:#include<stdio.h>
#include<string.h>
int a[130],b[130],n;
void gf()
{
int i,j,k;
for(i=2;i<=n;i++)
{
for(j=0;j<=n;j++)
{
for(k=0;k+j<=n;k+=i)
{
a[j+k]+=b[j];
}
}
for(j=0;j<=n;j++)
{
b[j]=a[j];
a[j]=0;
}
}
}
int main()
{
int i;
while(scanf("%d",&n)!=EOF)
{
memset(b,0,sizeof(b));
for(i=0;i<=n;i++)
{
a[i]=0;
b[i]=1;
}
gf();
printf("%d\n",b
);
}
return 0;
}
相关文章推荐
- hdu 1398 Square Coins/hdu 1028 Ignatius and the Princess III
- hdu 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III 动态规划完全背包
- HDU 1028 Ignatius and the Princess III
- hdu 1028Ignatius and the Princess III(整数划分)
- HDU 1028 Ignatius and the Princess III
- hdu 1028Ignatius and the Princess III
- HDU-1028-Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III
- hdu 1028 Ignatius and the Princess III
- HDOJ HDU 1028 Ignatius and the Princess III ACM 1028 IN HDU
- hdu 1028 Ignatius and the Princess III
- hdu 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III
- hdu 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III (母函数,或者DP)
- HDU 1028 Ignatius and the Princess III
- HDU 1028 Ignatius and the Princess III(母函数)