hdu1086【线段相交】
来源:互联网 发布:vb lg 编辑:程序博客网 时间:2024/06/05 15:03
You can Solve a Geometry Problem too
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10524 Accepted Submission(s): 5198
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.
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.
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
计算几何详解
代码:
#include <iostream>#include <string>#include <cstring>#include <cstdio>#include <cmath>#include <cstdlib>#include <algorithm>#include <queue>#include <map>#include <sstream>#define Maxn 100005using namespace std;struct edge{ double x1, y1, x2, y2;} Edge[105];bool solve(edge a, edge b){ if ( ((a.x1 - a.x2) * (a.y1 - b.y1) - (a.x1 - b.x1) * (a.y1 - a.y2)) * ((a.x1 - a.x2) * (a.y1 - b.y2) - (a.x1 - b.x2) * (a.y1 - a.y2)) > 0) return 0; if ( ((b.x1 - b.x2) * (b.y1 - a.y1) - (b.x1 - a.x1) * (b.y1 - b.y2)) * ((b.x1 - b.x2) * (b.y1 - a.y2) - (b.x1 - a.x2) * (b.y1 - b.y2)) > 0) return 0; return 1;}int main(){ int N; while (cin >> N, N) { for (int i = 0; i < N; i++) { scanf("%lf%lf%lf%lf", &Edge[i].x1, &Edge[i].y1, &Edge[i].x2, &Edge[i].y2); } int ans = 0; for (int i = 0; i < N; i++) for (int j = i + 1; j < N; j++) { if (solve(Edge[i], Edge[j])) ans++; } cout << ans << endl; }}
- HDU1086--线段相交
- hdu1086(线段相交)
- hdu1086【线段相交】
- hdu1086判读线段相交
- HDU1086-线段相交点个数
- 专题:计算几何学 线段相交 hdu1086
- HDU1086(判断两线段是否相交)
- HDU1086:You can Solve a Geometry Problem too(线段相交模板)
- You can Solve a Geometry Problem too (hdu1086)几何,判断两线段相交
- hdu1086 You can Solve a Geometry Problem too (判断两线段是否相交)
- hdu1086(线段交点)
- hdu1086
- HDU1086
- hdu1086
- hdu1086
- 线段相交
- 线段相交
- 线段相交
- nodejs爬取豆瓣top250电影信息
- 使用 C++11 智能指针时要避开的 10 大错误
- 【蓝桥杯题解】兰顿蚂蚁
- P1102 ——结构体两级排序
- Python之numpy学习
- hdu1086【线段相交】
- JQuery获取浏览器窗口的可视区域高度和宽度,滚动条高度
- phpMyAdmin一些中文编码问题
- 《数学建模竞赛入门与提高》读书笔记
- 2016年终总结
- Codeforces 762A k-th divisor
- 华夏学院到新洲的大巴车发车时刻表及乘车地点
- vuforia6.2 在unity中图片识别播放视频流程
- 24点为什么一共1820种组合