English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.
The problem statement has been automatically translated from Russian. If the statement is not clear, or you have any comments about it, please contact me. Anyway, I hope that someday I will fix the translation manually.

Point of intersection of straight lines

Two straight lines are given on the plane. Each straight line is defined by a pair of points through which it passes. It is required to determine whether these lines intersect and find the coordinates of the intersection point.

Input data

The coordinates of two different points through which the first straight line passes are entered first, and then the coordinates of two more different (but perhaps coinciding with the first two) points through which the second straight line passes. The coordinates of each point are integers, modulo no more than 1000.

Output data

If the lines do not intersect, print one number 0. If the lines match, output 2. If the lines intersect at exactly one point, then print first the number 1, and then two real numbers - the coordinates of the intersection point with six correct signs after the point.

Examples
Input data
0 0 1 1
1 0 -1 2
Output data
1  5.0000000E-0001  5.000000E-0001

This problem on informatics

algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)