HDU1028:Ignatius and the Princess III(dp入门 & 母函数)
来源:互联网 发布:linux怎么看cpu占用 编辑:程序博客网 时间:2024/06/17 08:01
Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19924 Accepted Submission(s): 13936
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
将一个正整数分成若干个数相加,求分解的方案数。
法一:动态规划:易得dp[i] = dp[i] + dp[i-a[k]], (k<=i)。
# include <stdio.h>int main(){ int n, i, j, dp[125]={1}; for(i=1; i<=120; ++i) for(j=i; j<=120; ++j) dp[j] += dp[j-i]; while(~scanf("%d",&n)) printf("%d\n",dp[n]); return 0;}
法二:母函数:
# include <stdio.h># define MAXN 120int a[MAXN+3]={1}, b[MAXN+3]={0};void init(){ int i, j, k; for(i=1; i<=MAXN; ++i)//枚举分解的数 { for(j=0; j<=MAXN; j+=i)//从0开始,步长为i for(k=0; j+k<=MAXN; ++k) b[j+k] += a[k];//多项式的系数相加 for(j=0; j<=MAXN; ++j) { a[j] = b[j];//更新a数组 b[j] = 0;//清除b数组 } }}int main(){ init(); int n; while(~scanf("%d",&n)) printf("%d\n",a[n]); return 0;}
0 0
- HDU1028:Ignatius and the Princess III(dp入门 & 母函数)
- hdu1028-Ignatius and the Princess III (母函数模板)
- HDU1028 Ignatius and the Princess III(母函数)
- HDU1028 Ignatius and the Princess III(母函数模板)
- 【母函数】hdu1028(Ignatius and the Princess III)
- HDU1028 Ignatius and the Princess III(母函数)
- hdu1028 Ignatius and the Princess III(DP整数划分)
- HDU1028 Ignatius and the Princess III(DP)
- HDU1028 Ignatius and the Princess III,母函数
- Ignatius and the Princess III(hdu1028母函数)
- Hdu1028 Ignatius and the Princess III 母函数
- HDU1028 Ignatius and the Princess III 【母函数模板题】
- HDU1028 Ignatius and the Princess III【母函数】【完全背包】
- hdu1028 Ignatius and the Princess III(母函数)
- 【HDU1028】Ignatius and the Princess III 母函数
- HDU1028 Ignatius and the Princess III(整数拆分:母函数||DP)
- HDU1398-Square Coins,HDU1028-Ignatius and the Princess III(母函数)
- Ignatius and the Princess III(hdu1028,母函数之整数划分)
- 命令行方式编译C++代码(Windows)
- 一些实用时间JS代码
- 关于url传参乱码的解决
- MySQL 5.6.17 版本发布及下载地址(mysql-5.6.17-winx64.zip)
- MapReduce: Simplified Data Processing on Large Clusters
- HDU1028:Ignatius and the Princess III(dp入门 & 母函数)
- React-Native版本升级的实践方案
- 编程珠玑: 13章 搜索 13.2使用线性结构,生成[0 ,maxval]范围内m各随机整数的有序序列 -------解题总结
- Third Maximum Number
- SpringBatch JobExecution
- java设计模式速记
- POJ 3279 Fliptile 开关问题
- javase 用来接收activemq消息的两种方式
- 伍华聪架构思路