The Chef and the Triangles

CodeChefOpen on judge ↗

The chef is fond of triangles. He has a task for you. You are given n point out of which only k are collinear. Find the number of triangles that can be formed from these n points. You have to perform the above task for a number of test cases. Input The first line of input contains the number of test cases, t. Then t lines follow each containing 2 space separated integers n and k. Output Th

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