1008Fourier's Lines

最新推荐文章于 2018-10-10 10:32:03 发布

原创最新推荐文章于 2018-10-10 10:32:03 发布 · 1.1k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#input #output #each #equals #up

本文探讨了Fourier's Lines问题，即如何绘制N条直线以形成M个交叉点，并求解这些直线最多能将平面分割成多少部分。通过动态规划方法解决了这一问题，并提供了完整的代码实现。

Fourier's Lines

Time Limit: 1 Seconds Memory Limit: 32768 K

Total Submit:22 Accepted:10

Description

Joseph Fourier was a great mathematician and physicist and is well known for his mathematic series. Among all the nineteen children in his family, Joseph was the youngest and the smartest. He began to show his interest in mathematics when he was very young. After he grew up, he often corresponded with C. Bonard (a professor of mathematics at Auxerre) by exchanging letters. In one letter written to Bonard, Fourier asked a question: how to draw 17 lines on a plane to make exactly 101 crossings, where each crossing belongs to exactly two lines. Obviously, this is an easy problem, and Figure-1 is a solution that satisfies his requirement. Now the problem for you is a universal one. Can we draw N lines on a plane to make exactly M crossings, where each crossing belongs to exactly two lines? If we can, how many pieces, at most, can these lines cut the plane into?

Input

The input may have several sets of test data. Each set is one line containing two integers N and M (1 <= N <= 100, 0 <= M <= 10000), separated by a space. The test data is followed by a line containing two zeros, which indicates the end of input and should not be processed as a set of data.

Output

Output one line for each set of input in the following format: Case i: N lines cannot make exactly M crossings. if the drawing of these lines is impossible; or: Case i: N lines with exactly M crossings can cut the plane into K pieces at most. Note: Even if N or M equals to one, you should use the words "lines" and "crossings" in your output.

Sample Input

Sample Output

Case 1: 4 lines with exactly 3 crossings can cut the plane into 8 pieces at most.
Case 2: 4 lines with exactly 6 crossings can cut the plane into 11 pieces at most.
Case 3: 4 lines cannot make exactly 2 crossings.
Case 4: 5 lines cannot make exactly 11 crossings.
Case 5: 17 lines with exactly 101 crossings can cut the plane into 119 pieces at most.

Source

Beijing 2004 Preliminary@POJ

此题主要是题意的理解，只用知道如果增加了n条直线，那么它最多可以比原来多n（a+1)个平面，a是代表原有的平面。这样就可以用动态规划来做了，有个细节就是因为本题n最大值为一百，而一百最多有4950个交点，所以只要开辟dp【101】【4950】了（别忘了判断如果有超出4950的情况哦）

Source:

#include<iostream>
using namespace std;
int dp[101][4951];
void digui(int a,int b,int z)
{
	for(int i=1;i<=100;i++)
	{
		if(a+i>100)break;
		if(dp[a+i][a*i+b]==0)	
		{
			dp[a+i][a*i+b]=a*i+i+z;	
			digui(a+i,a*i+b,dp[a+i][a*i+b]);
		}
	}
}

int main()
{

	digui(0,0,1);
	int n,m,i;i=1;
	while(cin>>n>>m)
	{
		if(n==0&&m==0)
			break;
		if(m>4950||dp[n][m]==0)
			cout<<"Case "<<i<<": "<<n<<" lines cannot make exactly "<<m<<" crossings."<<endl;
		else
			cout<<"Case "<<i<<": "<<n<<" lines with exactly "<<m<<" crossings can cut the plane into "<<dp[n][m]<<" pieces at most."<<endl;
	i++;
	}
	return 0;
}