hdu1028 Ignatius and the Princess III

最新推荐文章于 2021-07-27 09:58:29 发布

蒋莹

最新推荐文章于 2021-07-27 09:58:29 发布

阅读量574

点赞数

分类专栏： dp 文章标签： hdu1028 整数划分

本文链接：https://blog.csdn.net/u012592081/article/details/25652169

版权

dp 专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Ignatius and the Princess III
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11935 Accepted Submission(s): 8450

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!"

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

Sample Output

题目大概意思就是一个整数可以划分成多少种不同的数有多少种。很经典的一道dp题。

思想：

如果一个整数i，划分成j是怎么划分的。

第一种情况：j==1||i==1 时只有1种；

第二种情况：j==i 那么f（i，i）=f（i，j-1）+1；

第三种情况：j<i 时那么f（i，j）=f（i，i）；

第四重情况：i>j 时那么 f（i，i）=f（i-j，j）+f（i，j-1）；

但是我想告诉你的是会超时。所以就得转换成dp了。

/*递归超时
#include<stdio.h>
int fun(int n,int m)
{
	if(n==1||m==1)
		return 1;
	if(n==m)
		return fun(n,m-1)+1;
	if(n<m)
	   return fun(n,n);
	if(n>m)
		return fun(n-m,m)+fun(n,m-1);
}
int main()
{
	int i,j,n;
	while(scanf("%d",&n)!=EOF)
	{
		printf("%d\n",fun(n,n));
	}
	return 0;
}
*/

#include<stdio.h>//ac代码
#include<string.h>
int main()
{
	int n,i,j,dp[200][200],k;
	while(scanf("%d",&n)!=EOF)
	{
		memset(dp,0,sizeof dp);
		dp[0][0]=1;
		for(i=0;i<=n;i++)
			for(j=1;j<=n;j++)
			{
				if(j<=i)
					dp[i][j]=dp[i-j][j]+dp[i][j-1];
				else
					dp[i][j]=dp[i][i];
			}
			printf("%d\n",dp[n][n]);
	}
   return 0;
}