Greedy Students
Rafid is teaching his students plane geometry. Today they are talking about convex polygons. A [convex polygon](https://en.wikipedia.org/wiki/Convex_polygon) is a simple non-degenerate polygon such that each of its internal angles is strictly smaller than $180^\circ$. Rafid drew $N$ points (numbered $1$ through $N$) on a blackboard (a two-dimensional plane) and told each student to choose some of
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