← All problemsSign in

Convex Hull

CSESGeometryOpen on judge ↗

Given a set of n points in the two-dimensional plane, your task is to determine the convex hull of the points. Input The first input line has an integer n: the number of points. After this, there are n lines that describe the points. Each line has two integers x and y: the coordinates of a point. You may assume that each point is distinct, and the area of the hull is positive. Output First p

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