HDU 1028 Ignatius and the Princess III(母函数模板)
来源:互联网 发布:淘宝左侧分类模板代码 编辑:程序博客网 时间:2024/05/18 03:07
Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17839 Accepted Submission(s): 12508
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
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1171 1085 1398 2152 1709
母函数初学者,还是看大神的总结吧http://blog.csdn.net/vsooda/article/details/7975485,下面是个模板题。。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int n,i,j,k;int c1[140];//保存每个数字可以组合的数目 int c2[140];//中间量,保存每一次的情况 while(scanf("%d",&n)!=EOF){for(i=0;i<=n;i++)//初始化 {c1[i]=1;c2[i]=0;}for(i=2;i<=n;i++) {for(j=0;j<=n;j++){for(k=0;k+j<=n;k+=i)c2[k+j]+=c1[j];}for(j=0;j<=n;j++){c1[j]=c2[j];c2[j]=0; } }printf("%d\n",c1[n]);}return 0;}
0 0
- HDU 1028 Ignatius and the Princess III(母函数)
- HDU 1028 Ignatius and the Princess III (母函数)
- HDU-1028Ignatius and the Princess III(母函数)
- hdu 1028 Ignatius and the Princess III(母函数)
- [hdu 1028] Ignatius and the Princess III (母函数)
- hdu 1028 Ignatius and the Princess III ( 母函数)
- HDU -- 1028 Ignatius and the Princess III(母函数)
- hdu 1028 Ignatius and the Princess III (母函数)
- HDU - 1028 Ignatius and the Princess III(母函数)
- HDU 1028 Ignatius and the Princess III(母函数)
- HDU 1028 Ignatius and the Princess III(母函数)
- HDU 1028 Ignatius and the Princess III(母函数模板)
- HDU 1028 Ignatius and the Princess III (母函数模板)
- hdu1028-Ignatius and the Princess III (母函数模板)
- HDU1028 Ignatius and the Princess III(母函数模板)
- HDU/HDOJ 1028 母函数 Ignatius and the Princess III
- hdu 1028 Ignatius and the Princess III 母函数
- hdu 1028 Ignatius and the Princess III 母函数
- ACM 数论 青蛙的约会 扩展欧几里得
- 【ps vita】如何通过unity3d发布ps vita应用
- 【POJ 2370】Cow Sorting(置换群)
- WebView的简单使用
- win10 下edge浏览器打不开网页 应用商店等不进去方法解决
- HDU 1028 Ignatius and the Princess III(母函数模板)
- 【VC图像处理】双线性插值
- JavaScript DOM中 改变样式属性,实现动画效果
- 七月算法机器学习笔记3--凸优化
- mysql乱码解决
- 排序算法个人总结(3)
- PHP相关
- vs2013添加单元测试
- PE文件学习