You can Solve a Geometry Problem too
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 714 Accepted Submission(s): 342
Problem Description
Many geometry(几何)problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According to the experience of many ACMers, geometry problems are always much trouble, but this problem is very easy, after all we are now attending an exam, not a contest :)
Give you N (1<=N<=100) segments(线段), please output the number of all intersections(交点). You should count repeatedly if M (M>2) segments intersect at the same point.
Note:
You can assume that two segments would not intersect at more than one point.
Give you N (1<=N<=100) segments(线段), please output the number of all intersections(交点). You should count repeatedly if M (M>2) segments intersect at the same point.
Note:
You can assume that two segments would not intersect at more than one point.
Input
Input contains multiple test cases. Each test case contains a integer N (1=N<=100) in a line first, and then N lines follow. Each line describes one segment with four float values x1, y1, x2, y2 which are coordinates of the segment’s ending.
A test case starting with 0 terminates the input and this test case is not to be processed.
A test case starting with 0 terminates the input and this test case is not to be processed.
Output
For each case, print the number of intersections, and one line one case.
Sample Input
2 0.00 0.00 1.00 1.00 0.00 1.00 1.00 0.00 3 0.00 0.00 1.00 1.00 0.00 1.00 1.00 0.000 0.00 0.00 1.00 0.00 0
Sample Output
1 3
Author
lcy
#include<iostream>
using namespace std ;
float hanshu ( float x1 , float y1 , float x2 , float y2 )
{
return (x1 *y2 -x2 *y1 );
}
bool ifis ( float x1 , float y1 , float x11 , float y11 , float x2 , float y2 , float x22 , float y22 )
{
return (hanshu (x1 -x2 ,y1 -y2 ,x22 -x2 ,y22 -y2 )*hanshu (x22 -x2 ,y22 -y2 ,x11 -x2 ,y11 -y2 )>= 0 );
}
int main ()
{
int n ,sum ,i ,j ; float a [ 100 ][ 2 ],b [ 100 ][ 2 ];
while (cin >>n &&n )
{
for (i = 0 ;i <n ;i ++)
cin >>a [i ][ 0 ]>>a [i ][ 1 ]>>b [i ][ 0 ]>>b [i ][ 1 ];
sum = 0 ;
for (i = 0 ;i <n ;i ++)
for (j =i + 1 ;j <n ;j ++)
{
if (ifis (a [i ][ 0 ],a [i ][ 1 ],b [i ][ 0 ],b [i ][ 1 ],a [j ][ 0 ],a [j ][ 1 ],b [j ][ 0 ],b [j ][ 1 ])&&ifis (a [j ][ 0 ],a [j ][ 1 ],b [j ][ 0 ],b [j ][ 1 ],a [i ][ 0 ],a [i ][ 1 ],b [i ][ 0 ],b [i ][ 1 ]))
sum ++;
}
cout <<sum <<endl ;
}
return 0 ;
}
using namespace std ;
float hanshu ( float x1 , float y1 , float x2 , float y2 )
{
return (x1 *y2 -x2 *y1 );
}
bool ifis ( float x1 , float y1 , float x11 , float y11 , float x2 , float y2 , float x22 , float y22 )
{
return (hanshu (x1 -x2 ,y1 -y2 ,x22 -x2 ,y22 -y2 )*hanshu (x22 -x2 ,y22 -y2 ,x11 -x2 ,y11 -y2 )>= 0 );
}
int main ()
{
int n ,sum ,i ,j ; float a [ 100 ][ 2 ],b [ 100 ][ 2 ];
while (cin >>n &&n )
{
for (i = 0 ;i <n ;i ++)
cin >>a [i ][ 0 ]>>a [i ][ 1 ]>>b [i ][ 0 ]>>b [i ][ 1 ];
sum = 0 ;
for (i = 0 ;i <n ;i ++)
for (j =i + 1 ;j <n ;j ++)
{
if (ifis (a [i ][ 0 ],a [i ][ 1 ],b [i ][ 0 ],b [i ][ 1 ],a [j ][ 0 ],a [j ][ 1 ],b [j ][ 0 ],b [j ][ 1 ])&&ifis (a [j ][ 0 ],a [j ][ 1 ],b [j ][ 0 ],b [j ][ 1 ],a [i ][ 0 ],a [i ][ 1 ],b [i ][ 0 ],b [i ][ 1 ]))
sum ++;
}
cout <<sum <<endl ;
}
return 0 ;
}