HDU 1086 You can Solve a Geometry Problem too(水题,判断线段相交)
2011-11-01 01:12
435 查看
You can Solve a Geometry Problem too
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3077 Accepted Submission(s): 1452
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each case, print the number of intersections, and one line one case.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
1 3
[align=left]Author[/align]
lcy
#include<stdio.h> #include<math.h> #include<iostream> using namespace std; struct Line { double x1,y1,x2,y2; }node[110]; bool solve(Line a,Line b) { if(((a.x1-b.x1)*(a.y2-b.y1)-(a.x2-b.x1)*(a.y1-b.y1))*((a.x1-b.x2)*(a.y2-b.y2)-(a.x2-b.x2)*(a.y1-b.y2))>0)return false; if(((b.x1-a.x1)*(b.y2-a.y1)-(b.x2-a.x1)*(b.y1-a.y1))*((b.x1-a.x2)*(b.y2-a.y2)-(b.x2-a.x2)*(b.y1-a.y2))>0)return false; return true; } int main() { int n; while(scanf("%d",&n),n) { for(int i=0;i<n;i++)scanf("%lf%lf%lf%lf",&node[i].x1,&node[i].y1,&node[i].x2,&node[i].y2); int res=0; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { if(solve(node[i],node[j]))res++; } } printf("%d\n",res); } return 0; }
相关文章推荐
- hdu 1086:You can Solve a Geometry Problem too(计算几何,判断两线段相交,水题)
- HDU 1086 You can Solve a Geometry Problem too(判断两线段是否相交)跨立实验
- HDU 1086 You can Solve a Geometry Problem too 判断任意两线段是否相交
- Hdu 1086 You can Solve a Geometry Problem too[判断线段相交,完整版]
- HDU 1086 You can Solve a Geometry Problem too(判断线段是否相交,非规范相交)
- HDU 1086.You can Solve a Geometry Problem too【判断两线段相交】【数学题】【12月30】
- HDU 1086 You can Solve a Geometry Problem too (判断线段相交)
- HDU 1086 You can Solve a Geometry Problem too(判断线段相交)
- hdu You can Solve a Geometry Problem too(判断两条线段相交)
- HDU 1086 You can Solve a Geometry Problem too(简单的线段相交)
- HDU 1086 You can Solve a Geometry Problem too(判断两条直线是否相交)
- 向量判断HDU 1086 线段交点 You can Solve a Geometry Problem too
- 【线段相交】(吉大模板):hdu 1086 You can Solve a Geometry Problem too
- HDU-#1086 You can Solve a Geometry Problem too(线段相交判定)
- hdu 1086 You can Solve a Geometry Problem too(求线段相交点个数 模板)
- hdu 1086 You can Solve a Geometry Problem too 线段相交
- 杭电hdu 1086 You can Solve a Geometry Problem too 线段相交
- HDU 1086 You can Solve a Geometry Problem too(判定线段相交 规范相交和非规范相交)
- HDU 1086 You can Solve a Geometry Problem too 线段相交
- hdu 1086 You can Solve a Geometry Problem too(线段相交点的个数)