Beautiful Circles

CodeChefOpen on judge ↗

An un-ordered triplet of circles $(C1, C2, C3)$ is called $\textbf{beautiful}$ if they satisfy the following property: Two of the circles in the triplet intersect at exactly $2$ points, and the other circle passes through $4$ points: - Centres of the two intersecting circles - Points of intersection of the two circles You are given N circles. Find the total number of beautiful triplets($C

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