hdu1028Ignatius and the Princess III
来源:互联网 发布:cnc电脑编程教程 编辑:程序博客网 时间:2024/06/05 00:38
Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19699 Accepted Submission(s): 13787
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
#include<stdio.h>
int main()
{
int c1[230],c2[230];
int i,j,k,n;
while(~scanf("%d",&n))
{
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[j+k]+=c1[j];
for(j=0;j<=n;j++)
{
c1[j]=c2[j];
c2[j]=0;
}
}
printf("%d\n",c1[n]);
}
return 0;
}
int main()
{
int c1[230],c2[230];
int i,j,k,n;
while(~scanf("%d",&n))
{
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[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
- hdu1028Ignatius and the Princess III
- hdu1028Ignatius and the Princess III
- HDU1028Ignatius and the Princess III母函数入门
- hdu1028Ignatius and the Princess III(母函数)
- hdu1028Ignatius and the Princess III(最基础的母函数模板)
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- Ignatius and the Princess III
- 查看Linux内核
- 图片PGM格式转化为JPG格式(MATLAB 实现)
- JSP学习 更改tomcat端口号 入门 九九乘法表
- STM32F103使用内部Flash保存参数
- JS跨域(ajax跨域、iframe跨域)解决方法及原理详解
- hdu1028Ignatius and the Princess III
- php的简单使用1
- Rancher v1.2震撼发布:更优秀的全栈化容器部署与管理平台
- Map遍历的三种方法
- Linux内核补丁升级
- tomcat7.0.55配置单向和双向HTTPS连接 (一)
- 机器学习性能改善备忘单:32个帮你做出更好预测模型的技巧和窍门
- IP地址的分类及其分类方法介绍
- 最大似然估计的一些优点