Pagini recente » Cod sursa (job #976342) | Cod sursa (job #2184723) | Cod sursa (job #676242) | Cod sursa (job #280654) | Cod sursa (job #2748283)
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_map>
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
struct triplet
{
int a, b, c;
};
int v[102];
unordered_map<int, triplet> hashh;
int n,suma, i, j, k, nr;
long long s;
int main()
{
fin >> n >> s;
for(i = 1; i <= n; ++i)
fin >> v[i];
for(i = 1; i <= n; ++i)
{
for(j = i; j <= n; ++j)
{
for(k = j; k <= n; ++k)
{
nr = v[i] + v[j] + v[k];
triplet sumof3;
sumof3.a = v[i];
sumof3.b = v[j];
sumof3.c = v[k];
hashh[nr] = sumof3;
}
}
}
for(i = 1; i <= n; ++i)
for(j = i; j <= n; ++j)
for(k = j; k <= n; ++k)
{
suma=v[i]+v[j]+v[k];
if(hashh.count(s-suma))
{
fout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[hashh[s-suma].a]<<" "<<v[hashh[s-suma].b]<<" "<<v[hashh[s-suma].c];
return 0;
}
}
fout <<-1;
return 0;
}