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): 16918    Accepted Submission(s): 11907

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

 

Recommend

We have carefully selected several similar problems for you:  1171 1085 1398 2152 1709 

 

整数划分问题，和我前面写的一篇博客是一样的，参考：http://www.cnblogs.com/pshw/p/4838898.html

不过此题数据比较大，直接递归计算会导致超时，因此需要使用母函数的思想。其实我也不知道啥叫母函数。。。只是用dp将数据保存起来。

 

题意：整数划分问题是将一个正整数n拆成一组数连加并等于n的形式，且这组数中的最大加数不大于n。

 

附上代码：

 

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    int n,i,j,m;
    int dp[125][125];
    memset(dp,0,sizeof(dp));
    dp[1][1]=1;
    for(i=1; i<=120; i++)
    {
        dp[i][1]=1;
        dp[1][i]=1;
    }
    for(i=2; i<=120; i++)  //规律可见推荐的博客~
    {
        for(j=2; j<=120; j++)
        {
            if(j>i)
                dp[i][j]=dp[i][i];
            else if(i==j)
                dp[i][j]=dp[i][j-1]+1;
            else
                dp[i][j]=dp[i][j-1]+dp[i-j][j];
        }
    }
    while(~scanf("%d",&n))
    {
        printf("%d
",dp[n][n]);
    }
    return 0;
}