Pagini recente » Cod sursa (job #1018909) | Cod sursa (job #719401) | Cod sursa (job #450237) | Cod sursa (job #866273) | Cod sursa (job #2803782)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct trip {
int a, b, c;
friend ostream& operator <<(ostream& out, const trip& x) { return out << x.a << " " << x.b << " " << x.c; }
};
unordered_map <int, trip> r;
int main()
{
int n, x, s;
fin >> n >> s;
vector <int> v(n);
for(int i = 1; i <= n; i++)
fin >> x,
v[i - 1] = x;
for(int i : v)
for(int j : v)
for(int k : v)
r[i + j + k] = {i, j, k};
bool flag = true;
for(auto p : r) if(r.find(s - p.first) != r.end()) {
fout << p.second << " " << r[s - p.first];
flag = false;
break;
}
if(flag) fout << "-1";
return 0;
}