HDU 1086 You can Solve a Geometry Problem too(判断两线段是否相交)跨立实验
来源:互联网 发布:黑龙江网络教育 编辑:程序博客网 时间:2024/05/18 11:28
You can Solve a Geometry Problem too
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7028 Accepted Submission(s): 3398
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
20.00 0.00 1.00 1.000.00 1.00 1.00 0.0030.00 0.00 1.00 1.000.00 1.00 1.00 0.0000.00 0.00 1.00 0.000
Sample Output
13
#include <stdio.h>//author:XXYYstruct Point{double x1,y1;double x2,y2;}p[110];int jug(Point a,Point b){double x=b.y1-(b.x1*(a.y1-a.y2)+(a.x1*a.y2-a.x2*a.y1))/(a.x1-a.x2);double y=b.y2-(b.x2*(a.y1-a.y2)+(a.x1*a.y2-a.x2*a.y1))/(a.x1-a.x2);if(x*y>0)return 0;//题意说明该题两线段相交构成十字,不会出现T字return 1;}int main(){int n,i,j,num;while(scanf("%d",&n),n){for(i=0;i<n;i++)scanf("%lf%lf%lf%lf",&p[i].x1,&p[i].y1,&p[i].x2,&p[i].y2);num=0;for(i=0;i<n-1;i++){for(j=i+1;j<n;j++)if(jug(p[i],p[j])&&jug(p[j],p[i]))num++;}printf("%d\n",num);}return 0;}
0 0
- HDU 1086 You can Solve a Geometry Problem too(判断两线段是否相交)跨立实验
- HDU 1086 You can Solve a Geometry Problem too 判断任意两线段是否相交
- HDU ACM 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(判断线段是否相交,非规范相交)
- hdu1086 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 (计算几何 判断线段相交)
- You can Solve a Geometry Problem too----判断两线段是否相交
- HDU 1086 You can Solve a Geometry Problem too (判断线段交叉,线段跨立)
- hdu You can Solve a Geometry Problem too(判断两条线段相交)
- You can Solve a Geometry Problem too (hdu1086)几何,判断两线段相交
- hdoj-1086-You can Solve a Geometry Problem too 判断线段是否相交
- 杭电 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
- [ACM] hdu You can Solve a Geometry Problem too (线段是否相交及交点个数)
- UVA_11300Spreading the Wealth
- bool和BOOL 的区别
- 停止指尖,先思考后编程
- 传统方法在网页中运行exe
- Wireshark查看
- HDU 1086 You can Solve a Geometry Problem too(判断两线段是否相交)跨立实验
- SqlServer2008r2卸载
- Turn your Session into FlushMode.COMMIT/AUTO or remove 'readOnly' marker from transaction definition
- 计算几何的直线、线段的相交判断
- Android SDK Manager(正常更新)
- 数组的归并排序(不使用辅助空间,循环)
- 【环境配置】配置git
- 常用Maven插件
- Maven生命周期