Given the coordinates of the end points of two line segments and you have to check if they intersect or not.
The first line of input contains a single integer T denoting the number of test cases.
Then T test cases follow. Each test case consists of 2 lines.
The first line consists of 4 integers: x1, y1, x2, y2 where (x1,y1) and (x2,y2) are the end points of the first line segment.
The second line consists of 4 integers: x3, y3, x4, y4 where (x3,y3) and (x4,y4) are the end points of the second line segment.
Corresponding to each test case, in a new line, print 1 if the line segments intersect, otherwise print 0.
1 ≤ T ≤ 300
-1000000 ≤ xi,yi ≤ 1000000 1<=i<= 4
1 1 10 1
1 2 10 2
10 0 0 10
0 0 10 10
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.