Pagini recente » Cod sursa (job #2881200) | Cod sursa (job #2505473) | Cod sursa (job #3233752) | Cod sursa (job #3142226) | Cod sursa (job #2803801)
#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 v[105];
int main()
{
int n, x, s;
fin >> n >> s;
for(int i = 1; i <= n; i++)
fin >> v[i];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
r[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++) {
x = s - v[i] - v[j] - v[k];
if(r.count(x) > 0) {
fout << r[x] << " " << r[s - x];
return 0;
}
}
fout << "-1";
return 0;
}