Sum of Three Values

CSESSorting and SearchingOpen on judge ↗

You are given an array of n integers, and your task is to find three values (at distinct positions) whose sum is x. Input The first input line has two integers n and x: the array size and the target sum. The second line has n integers a_1,a_2,\dots,a_n: the array values. Output Print three integers: the positions of the values. If there are several solutions, you may print any of them. If the

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