Lazy Aniket

CodeChefOpen on judge ↗

Aniket is the laziest person in his group. One day he got stuck while solving a problem, the problem stated that you have an arrangement of K stones of some weights and in this arrangement, there is a unique stone called Infinity stone. The uniqueness of Infinity stone is that the sum of weights of all the stones before it equals the sum of weights of all the stones after it. If Infinity stone 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