Variance

CodeChefOpen on judge ↗

Yusuf is a very good friend of Chef. Since Chef like arrays so much, he gives Yusuf an array of $N$ elements, $A_1, A_2, A_3, ..., A_N$ and an integer $K$ and tell him to find an integer $X$ such that it satisfies the below equation, Here, $⌊s⌋$ denotes the floor function - the largest integer which does not exceed $s$. Since Yusuf is very busy in preparing for his semester exam. He gives this re

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