Problem of the day
“Never” if they never meet.
“Point” if they meet at a point.
“Intersect” if they intersect each other.
For A = 1, B = 3, C = 5, D = 10
They will never meet as their paths have no common points.
The first line contains a single integer ‘T’ denoting the number of test cases to be run. Then the test cases follow.
The first line of each test case contains four space-separated integers representing A, B, C, D.
For each test case, print a string according to the above conditions.
Output for each test case will be printed in a separate line.
You are not required to print anything, it has already been taken care of. Just implement the function.
1 <= T <= 10^4
-10^6 <= A, B, C, D <= 10^9
Time Limit: 1 sec.
2
8 10 1 8
1 10 5 8
Point
Intersect
For the first test case,
Alex will walk from 8 to 10 and Bob will walk from 1 to 8, and they both will meet at 8.
So, the output will be Point.
For the second test case.
Alex will walk from 1 to 10 and Bob will walk from 5 to 8, so they will intersect each other as the paths have intersecting points.
So the output will be Intersect.
2
1 10 8 15
1 5 6 10
Intersect
Never