HDU 1028-Ignatius and the Princess III-母函数-整数拆分
来源:互联网 发布:海岛奇兵保险库及数据 编辑:程序博客网 时间:2024/06/10 17:35
问题及代码:
运行结果:
母函数。
Ignatius and the Princess III
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
/* *Copyright (c)2015,烟台大学计算机与控制工程学院 *All rights reserved. *文件名称:HDU.cpp *作 者:单昕昕 *完成日期:2015年2月9日 *版 本 号:v1.0 */#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int N=10010;//c1数组保存各项组合的数目c2数组是中间变量保存每一次的情况int c1[N],c2[N];int main(){ int n,i,j,k; while(scanf("%d",&n)!=EOF) { for(i=0;i<=n;i++)//因为是第一个表达式(1+x+x2+..xn)所以c1数组初始化为1, { c1[i]=1; c2[i]=0; } for(i=2;i<=n;i++)//从2遍历,求每一个表达式 { //j 从0到n遍历,这里j就是(前面i个表达式累乘的表达式)里第j个变量 for(j=0;j<=n;j++) { for(k=0;k+j<=n;k=k+i)//k表示的是第j个指数,因为第i个表达式的增量是i,所以k每次增i { c2[k+j]=c2[k+j]+c1[j]; } } for(j=0;j<=n;j++) { c1[j]=c2[j];//因为c2每次是从一个表达式中开始的,把c2的值赋给c1,而把c2初始化为0. c2[j]=0; } } printf("%d\n",c1[n]);//X的n次方的系数即为所求 } return 0;}
运行结果:
母函数。
学习心得:
表示这题一开始以为是找规律的,然后试了几种都错了,后来一找度娘才发现要用母函数。
这母函数又是什么鬼呢,请见http://blog.csdn.net/mikasa3/article/details/43670817母函数详解。
组合数学的,长知识啊~~
0 0
- HDU 1028-Ignatius and the Princess III-母函数-整数拆分
- hdu 1028 Ignatius and the Princess III 整数拆分 母函数/dp
- HDU 1028-Ignatius and the Princess III(拆分整数-母函数-无限次)
- hdu 1028 Ignatius and the Princess III(整数拆分,母函数或dp)
- HDU 1028 Ignatius and the Princess III 整数的拆分
- HDU 1028 Ignatius and the Princess III【整数拆分】
- hdu 1028 Ignatius and the Princess III (整数拆分)
- Ignatius and the Princess III (HDU_1028) 母函数 + 整数拆分
- HDU 1085 Ignatius and the Princess III (母函数-整数拆分)
- HDOJ 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)
- hdu 1028 Ignatius and the Princess III(用母函数解决整数分拆问题)
- HDU 1028 Ignatius and the Princess III(母函数 或者 整数划分的DP动态规划)
- 【HDU 1028】【母函数 整数划分】Ignatius and the Princess III
- hdoj1028 Ignatius and the Princess III (母函数-整数拆分)
- Ignatius and the Princess III(母函数版整数拆分)
- js 数组扩展元素去重的方法
- 分享一段ios数据库代码,包括对表的创建、升级、增删查改
- 基于VTK&ITK的Qt应用程序开发
- POJ-3253 Fence Repair
- 【Android】横屏应用结束进程bug
- HDU 1028-Ignatius and the Princess III-母函数-整数拆分
- 遗传算法工具箱的应用
- JSP--JSP概述
- Android--获取SharedPreference实例
- 15分钟掌握Lua
- 线性表-双向链表的简单知识
- 基于VTK的MFC应用程序开发(1)
- java 建造者模式(Builder)
- 对存在空值的列建索引