Pagini recente » Cod sursa (job #767667) | Cod sursa (job #374190) | Cod sursa (job #660416) | Cod sursa (job #134693) | Cod sursa (job #2892637)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct Triplet{
int x, y, z;
};
map <int, Triplet> v;
int main()
{
int n, s, nr[105];
fin>>n>>s;
for(int i = 0; i < n; i++)
fin>>nr[i];
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++)
for(int k = j; k < n; k++)
{
Triplet p;
int sum = 0;
p.x = i;
p.y = j;
p.z = k;
sum = nr[i] + nr[j] + nr[k];
v[sum] = p;
}
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++)
for(int k = j; k < n; k++)
{
int sum = 0;
sum = s - nr[i] - nr[j] - nr[k];
if(v.find(sum) != v.end())
{
fout<<nr[i]<<' '<<nr[j]<<' '<<nr[k]<<' '<<nr[v[sum].x]<<' '<<nr[v[sum].y]<<' '<<nr[v[sum].z]<<'\n';
return 0;
}
}
fout<<-1<<'\n';
return 0;
}