Sort Sum

CodeChefOpen on judge ↗

You are given an array with $n$ elements, all of them being either $0$ or $1$. Let us define $f(i)$ as the result of sorting the array from position $1$ to position $i$. Compute $$\sum_{i=1}^{n}{f(i)}$$See the examples for clarification. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first contains $n$, the number of elements. - The second line co

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