Sum of Three Values
Submit solution
Points:
100 (partial)
Time limit:
2.0s
Memory limit:
256M
Author:
Problem type
Allowed languages
C++, Python
Sum of Three Values
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 there are no solutions, print "IMPOSSIBLE".
Constraints
\(1\leq n \leq 5000\)
\(1\leq x,a_i \leq 10^9\)
50/100 points for \(n \leq 300\).
Example
Input:
4 8
2 7 5 1
Output:
1 3 4
Comments
Poštovani,
u ovom zadatku testni primjeri nisu dobro namješteni, hvala na razumijevanju.
LP, admin