How Many Points of Intersection?
How Many Points of Intersection? |
We have two rows. There are a dots on the top row and b dots on the bottom row. We draw line segments connecting every dot on the top row with every dot on the bottom row. The dots are arranged in such a way that the number of internal intersections among the line segments is maximized. To achieve this goal we must not allow more than two line segments to intersect in a point. The intersection points on the top row and the bottom are not included in our count; we can allow more than two line segments to intersect on those two rows. Given the value of a and b, your task is to compute P(a, b), the number of intersections in between the two rows. For example, in the following figure a = 2 and b = 3. This figure illustrates that P(2, 3) = 3.
![\epsfbox{p10790.eps}](http://uva.onlinejudge.org/external/107/p10790.jpg)
Input
Each line in the input will contain two positive integers a ( 0 < a20000) and b ( 0 < b
20000). Input is terminated by a line where both a and b are zero. This case should not be processed. You will need to process at most 1200 sets of inputs.
Output
For each line of input, print in a line the serial of output followed by the value of P(a, b). Look at the output for sample input for details. You can assume that the output for the test cases will fit in 64-bitsigned integers.
Sample Input
2 2 2 3 3 3 0 0
Sample Output
Case 1: 1 Case 2: 3 Case 3: 9
-------------------------------------------------------------------------------------------------
解题思路:
解题思路是,上下各选取两个点,这四个点必然能够形成一个交点,于是结果为C(n,2)*C(m,2)。
在具体实现过程中,不能直接算阶乘,因为会溢出很多,而应该先化简,这题关键点在于组合数恒定是选2,所以能够将C(n,2)直接化简成n*(n-1)/2。
--------------------------------------------------------------------------------------------------
代码:
#include<iostream>
#include<fstream>
#include<vector>
#include<math.h>
using namespace std;
long long com(int n, int m)
{
return n*(n - 1) / 2;
}
int main()
{
int a, b;
int i = 1;
while (true)
{
cin >> a >> b;
if (a == 0)
break;
long long result = com(a, 2)* com(b, 2);
cout << "Case " << i++ << ": "<< result << endl;
}
}