hdu acn 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
  
  

/*

*/
#include <iostream>
#include<stdio.h>
#include <cstring>
using namespace std;
int t[125][125];
int fun(int,int);
int main()
{
    int N;
    while(scanf("%d",&N)!=EOF)
    {
        int P=0;
        memset(t,0,sizeof(t));
        for(int i=0;i<N;i++)
            P+=fun(N,i);
        printf("%d\n",P);
    }
    return 0;
}
int fun(int N,int i)
{
    if((i==0)||(i==1)||((N-i)==1))
        return 1;
    int x=i<(N-i)?i:(i-1);
    int s=i>(N-i)?(2*i-N):0;
    int z=0;
    for(int j=s;j<=x;j++)
    {
        if(t[i][j]==0)
            z+=fun(i,j);
        else
            z+=t[i][j];
    }
    t[N][i]=z;
    return z;
}