Pagini recente » Cod sursa (job #371804) | Cod sursa (job #1194012) | Cod sursa (job #1439801) | Cod sursa (job #2966293) | Cod sursa (job #2892554)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int N, v[101], S;
int main()
{
fin>>N>>S;
unordered_map<int, tuple<int,int,int>> l;
for(int i=0;i<N;i++)
fin>>v[i];
for(int i=0;i<N;i++)
for(int j=i;j<N;j++)
for(int k=j; k<N;k++)
l[v[i]+v[j]+v[k]]=make_tuple(i,j,k);
for(int i=0;i<N;i++)
for(int j=i;j<N;j++)
for(int k=j; k<N;k++)
{
int suma= S-v[i]-v[j]-v[k];
if(l.find(suma)!=l.end())
{
tuple<int,int,int>tuplu=l[suma];
fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[get<0>(tuplu)]<<" "<<v[get<1>(tuplu)]<<" "<<v[get<2>(tuplu)];
return 0;
}
}
fout<<-1;
return 0;
}