HDU 1028 Ignatius and the Princess III 整数的拆分

点击打开链接

Ignatius and the Princess III

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11071    Accepted Submission(s): 7834

Problem Description

"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.

"The second problem is, given an positive integer N, we define an equation like this:
  N=a[1]+a[2]+a[3]+...+a[m];
  a[i]>0,1<=m<=N;
My question is how many different equations you can find for a given N.
For example, assume N is 4, we can find:
  4 = 4;
  4 = 3 + 1;
  4 = 2 + 2;
  4 = 2 + 1 + 1;
  4 = 1 + 1 + 1 + 1;
so the result is 5 when N is 4. Note that "4 = 3 + 1" and "4 = 1 + 3" is the same in this problem. Now, you do it!"

 

Input

The input contains several test cases. Each test case contains a positive integer N(1<=N<=120) which is mentioned above. The input is terminated by the end of file.

 

Output

For each test case, you have to output a line contains an integer P which indicate the different equations you have found.

 

Sample Input

   
   

    
    4
10
20
   
   

 

Sample Output

   
   

    
    5
42
627
   
   

 

Author

Ignatius.L

求整数的拆分数，也就是求不同的等式个数。整数拆分也是一种普通母函数题目的类型。

//15MS	236K
#include<stdio.h>
#include<string.h>
#define M 127
int c1[M],c2[M];
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<=n;i++)c1[i]=1;//c1保存当前得到的多项式各项系数
        memset(c2,0,sizeof(c2));//c2保存每次计算时临时的结果
        for(int i=2; i<=n; i++) //要乘以n个多项式
        {
            for(int j=0; j<=n; j++) //c1的各项指数
                for(int k=0;j+k<=n;k+=i)
                    c2[j+k]+=c1[j];//指数相加得j+k,加多少只取决于c1[j]的系数，因为被乘多项式的各项系数均为1
            memcpy(c1,c2,sizeof(c2));
            memset(c2,0,sizeof(c2));
        }
        printf("%d\n",c1[n]);
    }
    return 0;
}