Pagini recente » Cod sursa (job #2473142) | Cod sursa (job #2899799) | Cod sursa (job #2963325) | Cod sursa (job #2892155) | Cod sursa (job #3239120)
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("loto.in");
ofstream cout("loto.out");
int v[105];
struct sum
{
int a,b,c;
} val[3000005];
unordered_map<int,int>umap;
int main()
{
int n,s;
cin>>n>>s;
for(int i=1; i<=n; i++)
cin>>v[i];
bool ok=1;
for(int i=1; i<=n; i++)
for(int j=i; j<=n; j++)
for(int k=j; k<=n; k++)
{
int e=v[i]+v[j]+v[k];
umap[e]=1;
val[e]= {v[i],v[j],v[k]};
}
for(int i=1; i<=n; i++)
for(int j=i; j<=n; j++)
for(int k=j; k<=n; k++)
{
int x=s-(v[i]+v[j]+v[k]);
if(umap.find(x)!=umap.end())
{
ok=0;
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<val[x].a<<" "<<val[x].b<<" "<<val[x].c<<'\n';
return 0;
}
}
if(ok)
cout<<-1;
return 0;
}