【题解】 HDU 1028 Ignatius and the Princess III

目录

 

题目描述

题意分析

AC代码

---

题目描述

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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

 

题意分析

题意：与HDU 1284 是同一种题型。同为完全背包，可得递推方程  dp[i] +=dp[i-1]

 

AC代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <memory.h>
#define MAXN 10005
using namespace std;

long long dp[MAXN];

int main()
{
    int n,i,j;
    dp[0]=1;
    for(i=1;i<=120;i++)
    {
        for(j=i;j<=120;j++)
        {
            dp[j] += dp[j-i];
        }
    }
    while(cin>>n && n)
    {
        cout<<dp[n]<<endl;
    }
    return 0;
}