← All problemsSign in

Connect Coordinate

Recently a renowned scientist, Chef discovered a planet. Total trees on planet are $N$ and are denoted by $X$ and $Y$ coordinates. Chef defined strength of a tree of the planet as the number of distinct subsets of remaining trees whose [convex hull](https://en.wikipedia.org/wiki/Convex_hull) can enclose the tree completely and strictly inside it. More formally, let $S(x)$ be strength of tree $

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

Sign in to chat with the tutor and save your progress.

Sign in to start