Pagini recente » Cod sursa (job #1201468) | Cod sursa (job #1898339) | Cod sursa (job #1837807) | Cod sursa (job #531514) | Cod sursa (job #2894906)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fcin("loto.in");
ofstream fcout("loto.out");
struct elemente {
int x, y, z;
};
int v[100], n, s, val;
unordered_map <int, elemente> sume;
int main()
{
fcin>>n>>s;
for(int i=0; i<n; i++)
fcin>>v[i];
for(int i=0; i<n; i++)
for(int j = i; j<n; j++)
for(int k=j; k<n; k++)
sume[v[i]+v[j]+v[k]] = {v[i], v[j], v[k]};
for(int i=0; i<n; i++)
for(int j=i; j<n; j++)
for(int k=j; k<n; k++)
{
int val = s - (v[i]+v[j]+v[k]);
if(sume.count(val) > 0) {
fcout<<v[i]<<" "<<v[j]<<" "<<v[k]<< " "<<sume[val].x << " " << sume[val].y << " " << sume[val].z << '\n';
fcin.close();
fcout.close();
return 0;
}
}
fcout<<-1;
fcin.close();
fcout.close();
return 0;
}