这是一篇关于计算几何的编程问题，要求编写程序判断输入的两组点定义的两条直线是否相交，如何相交，并给出相交点坐标。输入包含多组数据，每组数据由四个点的坐标组成，输出包括线条关系和可能的交点坐标。问题中涵盖了直线平行、重合和相交三种情况的判断，并提供了示例输入和输出。
Intersecting Lines
| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 19286 | Accepted: 8196 |
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 betwee
最低0.47元/天 解锁文章
106
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
