-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sum_of_Two_Values.cpp
51 lines (50 loc) · 968 Bytes
/
Sum_of_Two_Values.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <iostream>
#include <vector>
#include <unistd.h>
#include <unistd.h>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <sstream>
#include <set>
#include <unordered_set>
#include <cstring>
#include <string.h>
#include <queue>
using namespace std;
#define mid(s, e) (s + (e - s) / 2)
#define ALL(x) (x).begin(), (x).end()
#define endl '\n'
#define MAXE(vec) *max_element(ALL(vec))
#define MINE(vec) *min_element(ALL(vec))
#define valid(a, b, c) (a >= b && a < c ? 1 : 0)
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
#define ll long long
void solve()
{
ll n, x, nb;
cin >> n >> x;
map<ll, ll> mp;
vector<ll> numbers(n);
for (int i = 0; i < n; i++){
cin >> numbers[i];
}
for (int i = 0; i < n; i++){
if (mp[x - numbers[i]])
{
cout << mp[x - numbers[i]] << " " << i + 1 << endl;
return;
}
mp[numbers[i]] = i + 1;
}
cout << "IMPOSSIBLE\n";
}
int main(void)
{
ll t;
t = 1;
while (t--)
solve();
}