Power Problem

CodeChefOpen on judge ↗

Mob is given the task to calculate the power of his class. Power of his class is the sum of strength of each student. Strength of a student $i$ is the number of students $j$ standing behind $i$ whose height is strictly greater than $i$ Mob is busy in exorcism, can you help him find the power of this class? ###Input: - First line will contain $T$, number of testcases. Then the testcases follow.

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