HDU 1028 Ignatius and the Princess III
来源:互联网 发布:网络电影榜单 编辑:程序博客网 时间:2024/06/10 10:21
/*
中文题意:求组成一个数有多少种方案
中文翻译:4的组成方案有5种,是赤露露的母函数
题目大意:求一个数有多少种组成他的方案
解题思路:直接套用母函数的模板
难点详解:见母函数模板的博客
关键点:了解母函数
解题人:lingnichong
解题时间:2014/08/09 9:44
解题感受:母函数的应用,现在还不是非常清楚这题是如何AC的,只是用了母函数的模板,他就AC了
*/
Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12766 Accepted Submission(s): 9024
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>#include<string.h>#define MAXN 150int c1[MAXN],c2[MAXN];int main(){int n,i,j,k;while(~scanf("%d",&n)){memset(c2,0,sizeof(c2));for(i=0;i<=n;i++)c1[i]=1;for(i=2;i<=n;i++){for(j=0;j<=n;j++)for(k=0;k+j<=n;k+=i)c2[j+k]+=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 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
- 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
- Ignatius and the Princess III hdu 1028
- 布隆过滤器(Bloom Filter)
- STL--B - Hardwood Species
- ural 1008 Image Encoding bfs
- Codeforces Round #260 (Div. 2)A. Laptops
- 2054A==B?hdu
- HDU 1028 Ignatius and the Princess III
- uvaLive 6667 Longest Chain ( splay )
- ios中的字面量语法
- java
- ural 1005 Stone Pile 01背包或dfs
- JavaScript学习 jquery14 渐变动画
- HSSFWorkBooK用法
- 使用泛型的注意事项
- linux中我最常用的20条命令