HCKNO

CodeChefOpen on judge ↗

A hacker has N number to unlock the bank locker but the bank is very strict in the authentication. He wants to steal some money that requires knowledge of some basic maths. He is weak in mathematics but knows the pattern on how to unlock the locker. He calculates the maximum sum and a minimum sum of two numbers chosen from given N Numbers and takes an average to maximum and minimum. If average is

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