HDU 1028-Ignatius and the Princess III(经典母函数模型)
来源:互联网 发布:c 软件外包兼职 编辑:程序博客网 时间:2024/06/05 06:02
题目传送门
Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21747 Accepted Submission(s): 15182
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//经典母函数#include <stdio.h>#define maxn 125int c1[maxn];int c2[maxn];int main(){for(int i=0; i<maxn; i++){c1[i] = 1;c2[i] = 0;}for(int i=2; i<maxn; i++){for(int j=0; j<maxn; j++)for(int k=0; k+j<maxn; k+=i){c2[j+k] += c1[j];}for(int j=0; j<maxn; j++){c1[j] = c2[j];c2[j] = 0;}}int n;while(~scanf("%d", &n)){printf("%d\n", c1[n]);}return 0;}
推荐母函数学习地址:http://www.wutianqi.com/?p=596
阅读全文
0 0
- HDU 1028-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 (母函数)
- 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 母函数/dp
- Ignatius and the Princess III 【HDU--1028-母函数】
- 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(母函数)
- 关于python常用的注释、输入值、转义字符
- Ubuntu16安装删除libfreenect2
- 音频放播器
- c++将数组作为参数意味着什么?
- JDBC规范化写法
- HDU 1028-Ignatius and the Princess III(经典母函数模型)
- PCL安装过程中OpenNI安装出现问题
- Oracle VM VirtualBox虚拟机移动之后无法运行
- Mysql命令大全
- cmakelist笔记:cmake-commands
- PAT 1025反转链表
- Tomcat学习总结(1)——Tomcat入门教程
- linux下安装ngix系统
- python解析xml文件——通过etree来解析xml文件