Antipodal Points
You are given a set of $N$ distinct points $P_1, P_2, P_3, \ldots, P_N$ on a $2$-D plane. A triplet $(i, j, k)$ is called a holy triplet if - $1 \leq i \lt j \lt k \leq N$ - $P_i$, $P_j$ and $P_k$ are non-collinear and - Any two of the points $P_i$, $P_j$ and $P_k$ are [antipodal](https://en.wikipedia.org/wiki/Antipodal_point) points of the circle that passes through all three of them. Two point
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.
Sign in to chat with the tutor and save your progress.
Sign in to start