Pagini recente » Cod sursa (job #125801) | Borderou de evaluare (job #1569172) | Cod sursa (job #532947) | Cod sursa (job #1365847) | Cod sursa (job #2892829)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <tuple>
#include <vector>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int main()
{
int n;
long S, dif;
unordered_map<long, tuple<long,long,long>>dict(1000001);
fin >> n >> S;
vector <long> 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(v[i], v[j], v[k]);
bool ok = false;
for(int i = 0; i < n && !ok; i++)
for(int j = 0; j < n && !ok; j++)
for(int k = 0; k < n && !ok; k++)
{
dif = S-v[i]-v[j]-v[k];
if(get<0>(dict[dif]))
{
fout << get<0>(dict[dif]) << " " << get<1>(dict[dif]) << " " << get<2>(dict[dif]) << " " << v[i] << " " << v[j] << " " << v[k];
ok = true;
}
}
if(!ok)
fout << -1;
return 0;
}