POJ 1269
来源:互联网 发布:点钞机升级软件 编辑:程序博客网 时间:2024/05/22 01:47
Intersecting Lines
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9103 Accepted: 4094
Description
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
Source
Mid-Atlantic 1996
最简单的计算几何,给你4个不重复的点,问你他们形成的两条直线是否相交,若相交输出交点。模拟去做即可。
#include <cstdio>#include <cmath>#include <algorithm>#include <iostream>#include <cstring>#include <map>#include <string>#include <stack>#include <cctype>#include <vector>#include <queue>#include <set>#include <utility>#include <cassert>using namespace std;///#define Online_Judge#define outstars cout << "***********************" << endl;#define clr(a,b) memset(a,b,sizeof(a))#define lson l , mid , rt << 1#define rson mid + 1 , r , rt << 1 | 1#define mk make_pair#define FOR(i , x , n) for(int i = (x) ; i < (n) ; i++)#define FORR(i , x , n) for(int i = (x) ; i <= (n) ; i++)#define REP(i , x , n) for(int i = (x) ; i > (n) ; i--)#define REPP(i ,x , n) for(int i = (x) ; i >= (n) ; i--)const int MAXN = 400000 + 150;const int sigma_size = 26;const long long LLMAX = 0x7fffffffffffffffLL;const long long LLMIN = 0x8000000000000000LL;const int INF = 0x7fffffff;const int IMIN = 0x80000000;#define eps 1e-8const int MOD = (int)1e9 + 7;typedef long long LL;const double PI = acos(-1.0);typedef double D;typedef pair<int , int> pi;///#pragma comment(linker, "/STACK:102400000,102400000")int main(){ double x1 , x2 ,x3 , x4 ,y1 , y2 , y3 , y4 , k1 , k2 , k3 , b1 , b2 , x , y; int n; cin >> n; printf("INTERSECTING LINES OUTPUT\n"); while(n--) { scanf("%lf%lf%lf%lf%lf%lf%lf%lf" , &x1 , &y1 , &x2 , &y2 , &x3 , &y3 , &x4 , &y4); k1 = x1 == x2 ? 2001 : (y2 - y1) / (x2 - x1) , k2 = x3 == x4 ? 2001 : (y4 - y3) / (x4 - x3) , k3 = x1 == x3 ? 2001 : (y3 - y1) / (x3 - x1);// cout << k1 << ' '<< k2 << endl; if(fabs(k1 - k2) < eps && fabs(k3 - k1) < eps)printf("LINE\n"); else if(fabs(k1 - k2 )< eps)printf("NONE\n"); else { b1 = y1 - k1 * x1 , b2 = y3 - k2 * x3;// printf("%lf %lf %lf %lf" , k1 , b1, k2 , b2); x = (b2 - b1) / (k1 - k2); y = k1 * x + b1; printf("POINT %.2lf %.2lf\n" , x , y); } } printf("END OF OUTPUT\n");return 0;}
- POJ 1269
- Poj 1269
- poj 1269
- POJ 1269
- POJ 1269
- Poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- poj 1269
- POJ 1269
- POJ 1269
- POJ 1269
- 网上转载的Ext.form.ComboBox,个人觉得很好很强大,困惑已久的数据加载问题终于搞懂!
- menu菜单栏的应用, 弹出对话框或退出当前activity
- Exercises4.1
- 《Linux命令行与shell脚本编程大全》 第十七章 学习笔记
- Android、iOS和Windows Phone中的推送技术
- POJ 1269
- 创意集中营
- PostMessage和Sendmessage区别
- hdu4552 怪盗基德的挑战书
- 指针数组和数组指针
- HDU_2055 An easy problem
- asp .net 和 ASP
- IT 认证考试--软考--(中级项目)嵌入式系统设计师2:考试大纲
- system3之:2 DHCP服务