Rihanna and Triangles

CodeChefOpen on judge ↗

Problem description. Rihanna wants to find the number of triangles that can be formed with n lines, no three lines are concurrent. But there are many sets of parallel lines in those lines. Input First line has integer T, the number of test cases In each test case 1st line has two integers n,m n represents the number of line and m represents the number of sets of parallel lines Next line con

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