Pagini recente » Cod sursa (job #346589) | Cod sursa (job #2653566) | Cod sursa (job #2107739) | Cod sursa (job #716364) | Cod sursa (job #2742362)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
struct sumede3{
int x,y,z;
};
unordered_map<int,sumede3> dict;
int main()
{
int n,v[101],s;
f>>n>>s;
for(int i=0;i<n;i++)
f>>v[i];
for(int i=0;i<n;i++)
for(int j=i;j<n;j++)
for(int k=j;k<n;k++)
{
sumede3 S;
S.x=v[i];
S.y=v[j];
S.z=v[k];
dict[v[i]+v[j]+v[k]]=S;
}
bool ok=0;
for(auto i=dict.begin();ok==0 && i!=dict.end();i++)
{
int rest=s-i->first;
if(dict.find(rest)!=dict.end())
{
g<<i->second.x<<' '<<i->second.y<<' '<<i->second.z<<' '<<dict[rest].x<<' '<<dict[rest].y<<' '<<dict[rest].z;
ok=1;
}
}
if(ok==0)g<<-1;
return 0;
}