HDU1028
来源:互联网 发布:上海贝尔怎么样 知乎 编辑:程序博客网 时间:2024/06/05 17:56
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!"
"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
41020
Sample Output
542627//HDU1028基础题//Ignatius and the Princess III//2017.05.26 by wyj#includeusing namespace std;int P[121][121];int main(){for (int i = 1;i <= 120;i++){for (int j = 1;j <= 120;j++){if (i == 1 || j == 1)P[i][j] = 1;else if (i < j)P[i][j] = P[i][i];else if (i == j)P[i][j] = P[i][j - 1] + 1;elseP[i][j] = P[i][j - 1] + P[i - j][j];}}int n;while (cin >> n){cout << P[n][n] << endl;}return 0;}
阅读全文
0 0
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- HDU1028
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- hdu1028
- HDU1028
- HDU1028
- HDU1028
- HDU1028(DP)
- HDU1028 DP
- 标准模型和IE模型的区别
- 虚拟环境下Django创建、运行项目
- nginx配置参数详解 优化
- salt 迁移
- 微信公众号开发(十一)生成带参数二维码
- HDU1028
- 第一章:JNI介绍
- 学习笔记——使用ajax()方法解决跨域问题
- 脑洞蒙特卡洛模型,来招聘
- 你还
- Beautiful Soup 4.4.0 文档
- mfc调用qt的dll
- 剑指offer--(5) 用两个栈实现队列
- CSS初学习