Pagini recente » Cod sursa (job #2163516) | Cod sursa (job #136426) | Cod sursa (job #1796270) | Cod sursa (job #189429) | Cod sursa (job #2892843)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <tuple>
#include <vector>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, S, dif;
tuple<int, int, int>tuplu;
unordered_map<int, tuple<int,int,int>>dict(1000001);
fin >> n >> S;
vector <int> v(n+1);
for(int i = 0; i < n; i++)
fin >> v[i];
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
for(int k = 0; k < n; k++)
dict[v[i]+v[j]+v[k]] = make_tuple(i, j, k);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
for(int k = 0; k < n; k++)
{
dif = S-v[i]-v[j]-v[k];
if(dict.find(dif) != dict.end())
{
tuplu = dict[dif];
fout << v[get<0>(tuplu)] << " " << v[get<1>(tuplu)] << " " << v[get<2>(tuplu)] << " " << v[i] << " " << v[j] << " " << v[k];
return 0;
}
}
fout << -1;
return 0;
}