# Yiner的ACM

 < 2011年2月 >
303112345
6789101112
13141516171819
20212223242526
272812345
6789101112

• 随笔 - 29
• 文章 - 0
• 评论 - 2
• 引用 - 0

•

# 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+a+a+...+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.

```4
10
20
```

```5
42
627
```

### Author

Ignatius.L  posted on 2011-02-15 18:28 Yiner 阅读(246) 评论(0)  编辑 收藏 引用 所属分类: 母函数 