 # 题目

## 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$ .

## 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 $x_1y_1x_2y_2x_3y_3x_4y_4$ . Thus each of these input lines represents two lines on the plane: the line through $(x_1,y_1)$ and $(x_2,y_2)$ and the line through $(x_3,y_3)$ and $(x_4,y_4)$ . The point $(x_1,y_1)$ is always distinct from $(x_2,y_2)$ . Likewise with $(x_3,y_3)$ and $(x_4,y_4)$ .

## 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” .

# 代码

-------------本文结束感谢您的阅读------------- 