Not First Question

CodeChefOpen on judge ↗

Cypher team is playing a game in which there are 3 buckets and each bucket have A, B and C number of balls respectively that are numbered from 1 to A, 1 to B and 1 to C. Now they have to select 3 distinct balls, one from each bucket and your task is to tell them that in how many ways they can choose balls. Input: The first line of the input contains an integer T denoting the number of test cases

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