← All problemsSign in

Polygon Relationship

CodeChefRating 1460Open on judge ↗

You are given a strictly convex polygon with $N$ vertices (numbered $1$ through $N$). For each valid $i$, the coordinates of the $i$-th vertex are $(X_i, Y_i)$. You may perform the following operation any number of times (including zero): - Consider a *parent polygon*. Initially, this is the polygon you are given. - Draw one of its *child polygons* ― a simple non-degenerate polygon such that eac

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