Super Line Segments

CodeChefOpen on judge ↗

You are given n points in 2 D plane. Let us represent the n points by p[1],p[2],....p[n]. No two points have same coordinates and no three points are colinear. Consider the set of lines L = {L : L is a line segment made by connecting (p[i],p[j]) for all 1 ≤ i,j ≤ n and i!=j} Two line segments L1 and L2 are said to be related if they intersect at a point which is not an end point of either of seg

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI