Magic Elements

CodeChefOpen on judge ↗

You are given an array A with size N and a number K. Let's call a position i (1 ≤ i ≤ N) valid if, after increasing Ai by K, it would be greater than the sum of all other elements in the array A. Determine the number of distinct valid positions. Input - The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. - The

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