Sum3

CodeChefOpen on judge ↗

You're given an array 'a' of N distinct integers. Let's consider a triple ( i, j, k ), 0 Input The first line of input contains an integer N (3 Output Output each of the possible sums in increasing order with the number of triples that generate them. The format should be: s[i] : ways[i] (s[i] = value of the i-th sum, ways[i] = number of triples that generate it) Example Input: 4 -1 2 3 4 Out

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