Akash and Equal Mean
CodeChefOpen on judge ↗
Akash goes to class everyday. His classes are held on the $9^{th}$ floor so he uses a lift. One day $N$ people get on the lift. However, since the lift can carry at most $N-2$ people, $2$ of them need to get off. Given an array $A$ of the weights of the $N$ people, Akash wonders how many ways of removing $2$ people exist such that the [mean](https://en.wikipedia.org/wiki/Arithmetic_mean) of weigh
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.
Sign in to chat with the tutor and save your progress.
Sign in to start