HDU 1028 Ignatius and the Princess III

HDU 1028 Ignatius and the Princess III

题目链接：HDU 1028 Ignatius and the Princess III

---

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

题意：

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

AC代码：

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <locale>
#include <vector>
#include <string>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#define MOD 20090126

using namespace std;

int dp[125][125];

int main()
{
    for(int i=0;i<122;i++)
    {
        dp[i][1]=1;
        dp[1][i]=1;
    }
    for(int i=2;i<122;i++)
    {
        for(int j=2;j<122;j++)
        {
            if(i<j)
                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];
        }
    }
    int n;
    while(~scanf("%d",&n))
        printf("%d\n",dp[n][n]);
    return 0;
}