HDU1086(计算几何)
来源:互联网 发布:长兴广电网络客服电话 编辑:程序博客网 时间:2024/06/07 05:05
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1086
You can Solve a Geometry Problem too
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8452 Accepted Submission(s): 4125
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
题意:给你N个点,求交点个数。
分析:水题一枚,就不多说了。
#include <iostream>#include <stdio.h>#include <string.h>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <algorithm>using namespace std;const double pi = acos(-1.0);const int INF = 0x3f3f3f3f;struct Line{ double x1,y1,x2,y2;}node[105];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 cnt = 0; for (int i=0; i<n; i++) { for (int j=i+1; j<n; j++) { if (solve(node[i], node[j])) cnt++; } } printf ("%d\n",cnt); } return 0;}
0 0
- HDU1086(计算几何)
- hdu1086+You can Solve a Geometry Problem too(计算几何,计算线段交点个数)
- ACM-计算几何之You can Solve a Geometry Problem too——hdu1086
- hdu1086 You can Solve a Geometry Problem too 计算几何求线段交点个数,快速排斥实验+跨立实验
- You can Solve a Geometry Problem too (hdu1086)几何,判断两线段相交
- hdu1086(线段交点)
- hdu1086
- HDU1086
- hdu1086
- hdu1086
- 专题:计算几何学 线段相交 hdu1086
- POJ2318(计算几何)
- poj1939(计算几何)
- POJ1265Area(计算几何)
- sicily_1012 (计算几何)
- Intersection (计算几何)
- 计算几何(一)
- 计算几何(草稿)
- YTU-OJ- 复数类--重载运算符2+
- 线程私有数据STD
- eclipse导入jar包
- YTU-OJ-矩阵求和--重载运算符
- fzu 2056 暴力
- HDU1086(计算几何)
- 第十周阅读项目(4):继承与派生
- YTU-OJ-复数类--重载运算符3+
- IOS TableView的Cell高度自适应,UILabel自动换行适应
- [LeetCode]Repeated DNA Sequences Total
- xfire调用Web Service源码,两种方式可用
- 四、FPGA之序列信号发生器
- poj 3255 Roadblocks(无向图次短路 SPFA)
- YTU-OJ-复数类--对象转换