Hull Sum

CodeChefOpen on judge ↗

Chef prepares the following problem for a programming contest: You are given N points with integer coordinates (-1000 ≤ xi, yi ≤ 1000). No two points collide and no three points are collinear. For each of the 2N-1 non-empty subsets of points, find the size (the number of points) of its convex hull. Print the sum of those sizes. Chef has already prepared some tests for his problem, including a te

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