MAKING FRIENDS

CodeChefOpen on judge ↗

Chef has entered in his First Year and is seeking to make new friends. He has $N$ classmates. The $i$th classmate have **A[i]** candies. Chef also has $X$ candies. Chef being greedy he offers his friendship to only those classmates who have candies more than X. Help Chef to find out number of classmates to whom he can offer his friendship. ###Input: - First line will contain $N$ and $X$, numb

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