diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /cses/SortingAndSearching/SumOfTwoValues/main.cpp | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'cses/SortingAndSearching/SumOfTwoValues/main.cpp')
| -rw-r--r-- | cses/SortingAndSearching/SumOfTwoValues/main.cpp | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/cses/SortingAndSearching/SumOfTwoValues/main.cpp b/cses/SortingAndSearching/SumOfTwoValues/main.cpp new file mode 100644 index 0000000..292e8f8 --- /dev/null +++ b/cses/SortingAndSearching/SumOfTwoValues/main.cpp @@ -0,0 +1,29 @@ +#include<bits/stdc++.h> + +using namespace std; + +int main () { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int n, x; + cin >> n >> x; + vector<int> v(n); + for (auto &x : v) cin >> x; + map<int, int> mp; + pair<int, int> ans; + bool found = 0; + for (int i = 0; i < n; i++) mp[v[i]] = i + 1; + for (int i = 0; i < n; i++) { + if (mp.count(x - v[i]) && i + 1 != mp[x - v[i]]) { + ans.first = i + 1; + ans.second = mp[x - v[i]]; + found = 1; + break; + } + } + if (found) { + cout << ans.first << " " << ans.second; + } else { + cout << "IMPOSSIBLE"; + } +} |
