HDU 1028  Ignatius and the Princ…

Ignatius and the Princess III

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

Total Submission(s): 4673     Accepted Submission(s): 3276

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

这题打表直接过（附源代码）：

#include<stdio.h>

int n,sum,num;

void DFS(int num,int k)

{

int i;

if(num>=n){

if(num==n)sum++;

return;

}

for(i=k;i<=n-num;i++)

{

DFS(num+i,i);

}

}

int main()

{

for(n=1;n<=120;n++)

{

sum=0;

DFS(0,1);

printf("%d\n",sum);

}

return 0;

}唉，这可是运行了将近一个小时才出来所有的结果啊

#include<stdio.h>

int main()

{

int n,num[125]={0,1,

2,

3,

5,

7,

11,

15,

22,

30,

42,

56,

77,

101,

135,

176,

231,

297,

385,

490,

627,

792,

1002,

1255,

1575,

1958,

2436,

3010,

3718,

4565,

5604,

6842,

8349,

10143,

12310,

14883,

17977,

21637,

26015,

31185,

37338,

44583,

53174,

63261,

75175,

89134,

105558,

124754,

147273,

173525,

204226,

239943,

281589,

329931,

386155,

451276,

526823,

614154,

715220,

831820,

966467,

1121505,

1300156,

1505499,

1741630,

2012558,

2323520,

2679689,

3087735,

3554345,

4087968,

4697205,

5392783,

6185689,

7089500,

8118264,

9289091,

10619863,

12132164,

13848650,

15796476,

18004327,

20506255,

23338469,

26543660,

30167357,

34262962,

38887673,

44108109,

49995925,

56634173,

64112359,

72533807,

82010177,

92669720,

104651419,

118114304,

133230930,

150198136,

169229875,

190569292,

214481126,

241265379,

271248950,

304801365,

342325709,

384276336,

431149389,

483502844,

541946240,

607163746,

679903203,

761002156,

851376628,

952050665,

1064144451,

1188908248,

1327710076,

1482074143,

1653668665,

1844349560};

while(scanf("%d",&n)!=EOF)

printf("%d\n",num[n]);

return 0;

}