The Election Conundrum

CodeChefOpen on judge ↗

Bunty is competing this time in an election. He knows that if he can cover the maximum number of the booth out of total $N$ booths during the promotion then he might win the election. But he can only travel in a path of a circular figure whose boundary (the circumference) consists of points equidistant from a fixed point (the centre). He is wondering about the maximum number of unique boot

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