1028

Ignatius and the Princess III

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

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
  
  
  
  


  
  

    动态规划题

    dp[i][j]表示把i这个数分化成几个不大于j的数的分法种数

    很显然dp[i][0]=1

    dp[i][j]=∑dp[i-k][min(i-k,k)];   (    k∈( 1 , j )    )

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

#define MAXN 150

using namespace std;

int n;
int dp[MAXN][MAXN];

int main()
{
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	while(scanf("%d",&n)==1)
	{
		dp[0][0]=1;
		for(int i=1;i<=n;i++)
		{
			dp[i][0]=1;
			for(int j=1;j<=i;j++)
			{
				dp[i][j]=0;
				for(int k=1;k<=j;k++)dp[i][j]+=dp[i-k][min(i-k,k)];
			}
		}
		printf("%d\n",dp[n][n]);
	}
	return 0;
}