poj 1269 Intersecting Lines
来源:互联网 发布:java开发流程图 编辑:程序博客网 时间:2024/06/06 20:26
We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect in a line because they are on top of one another (i.e. they are the same line), 3) intersect in a point. In this problem you will use your algebraic knowledge to create a program that determines how and where two lines intersect.
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.
Input
The first line contains an integer N between 1 and 10 describing how many pairs of lines are represented. The next N lines will each contain eight integers. These integers represent the coordinates of four points on the plane in the order x1y1x2y2x3y3x4y4. Thus each of these input lines represents two lines on the plane: the line through (x1,y1) and (x2,y2) and the line through (x3,y3) and (x4,y4). The point (x1,y1) is always distinct from (x2,y2). Likewise with (x3,y3) and (x4,y4).
Output
There should be N+2 lines of output. The first line of output should read INTERSECTING LINES OUTPUT. There will then be one line of output for each pair of planar lines represented by a line of input, describing how the lines intersect: none, line, or point. If the intersection is a point then your program should output the x and y coordinates of the point, correct to two decimal places. The final line of output should read "END OF OUTPUT".
Sample Input
50 0 4 4 0 4 4 05 0 7 6 1 0 2 35 0 7 6 3 -6 4 -32 0 2 27 1 5 18 50 3 4 0 1 2 2 5
Sample Output
INTERSECTING LINES OUTPUTPOINT 2.00 2.00NONELINEPOINT 2.00 5.00POINT 1.07 2.20END OF OUTPUT
题意: 判断两条线是平行,共线,还是相交;
#include<iostream>#include<cstdio>#include<cmath>using namespace std;const double eps=1e-8;struct point {double x,y;};struct vector{point start,end;};point p;double multi(point p1,point p2,point p0){return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);}int Across(vector v1,vector v2){if(max(v1.start.x,v1.end.x)>=min(v2.start.x,v2.end.x)&&max(v2.start.x,v2.end.x)>=min(v1.start.x,v1.end.x)&&max(v1.start.y,v1.end.y)>=min(v2.start.y,v2.end.y)&&multi(v2.start,v1.end,v1.start)*multi(v1.end,v2.end,v1.start)>=0&&multi(v1.start,v2.end,v2.start)*multi(v2.end,v1.end,v2.start)>=0)return 1;return 0;}int intersection(vector u,vector v){p.x=(multi(v.end,u.end,u.start)*v.start.x-multi(v.start,u.end,u.start)*v.end.x)/(multi(v.end,u.end,u.start)-multi(v.start,u.end,u.start));p.y=(multi(v.end,u.end,u.start)*v.start.y-multi(v.start,u.end,u.start)*v.end.y)/(multi(v.end,u.end,u.start)-multi(v.start,u.end,u.start));return 0;}vector a,b;int main(){int n;while(cin>>n){printf("INTERSECTING LINES OUTPUT\n");for(int i=0;i<n;i++){cin>>a.start.x>>a.start.y>>a.end.x>>a.end.y>>b.start.x>>b.start.y>>b.end.x>>b.end.y;if(fabs(multi(a.start,a.end,b.start))<eps&&fabs(multi(a.start,a.end,b.end))<eps)printf("LINE\n");else if((a.end.x-a.start.x)*(b.end.y-b.start.y)==(a.end.y-a.start.y)*(b.end.x-b.start.x))printf("NONE\n");else{intersection(a,b);printf("POINT %.2f %.2f\n",p.x,p.y);p.x=0.0,p.y=0.0;}}printf("END OF OUTPUT\n");}return 0;}
0 0
- POJ 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- poj 1269 Intersecting Lines
- POJ 1269 Intersecting Lines
- 128 Largest Number (自定义比较函数排序)
- sql求解两个时间差
- 【计服15】实验三参考代码
- DFS与BFS的区别、用法、详解?
- centos7安装后windows启动菜单修复
- poj 1269 Intersecting Lines
- 利用Disk Genius分区工具给电脑硬盘进行分区详细图文教程
- 基于Solr的空间搜索学习笔记
- Android程序去除标题栏
- 160. Intersection of Two Linked Lists
- PHP——函数_学习笔记
- 自定义拦截器没有加载
- HDU 4587 (割点)
- C/C++用new、delete分配回收堆中空间