Pagini recente » Cod sursa (job #931356) | Cod sursa (job #1129073) | Cod sursa (job #734125) | Cod sursa (job #137222) | Cod sursa (job #2892825)
#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;
vector <long> v(n+1);
unordered_map<long, tuple<long,long,long>>dict;
fin >> n >> S;
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++)
if(get<0>(dict[S-v[i]-v[j]-v[k]]))
{
fout << get<0>(dict[S-v[i]-v[j]-v[k]]) << " " << get<1>(dict[S-v[i]-v[j]-v[k]]) << " " << get<2>(dict[S-v[i]-v[j]-v[k]]) << " " << v[i] << " " << v[j] << " " << v[k];
ok = true;
}
if(!ok)
fout << -1;
return 0;
}