Pagini recente » Cod sursa (job #991635) | Cod sursa (job #856853) | Cod sursa (job #1685546) | Cod sursa (job #158562) | Cod sursa (job #608499)
Cod sursa(job #608499)
#include <iostream>
#include <cstdio>
#include <vector>
#define U 666013
#define NMax 105
using namespace std;
vector <long long> Hash[U];
int N, S[7];
long long Sum, Sum2, V[NMax];
int Search (long long X)
{
int Key=X%U;
for (unsigned i=0; i<Hash[Key].size (); ++i)
{
if (X==Hash[Key][i])
{
return i;
}
}
return -1;
}
void Insert (long long X)
{
int Key=X%U;
if (Search (X)==-1)
{
Hash[Key].push_back (X);
}
}
int main()
{
freopen ("loto.in", "r", stdin);
freopen ("loto.out", "w", stdout);
scanf ("%d %d", &N, &Sum);
for (int i=1; i<=N; ++i)
{
scanf ("%lld", &V[i]);
}
for (int i=1; i<=N; ++i)
{
for (int j=i; j<=N; ++j)
{
for (int k=j; k<=N; ++k)
{
Insert (V[i]+V[j]+V[k]);
}
}
}
S[0]=-1;
for (int i=1; i<=N; ++i)
{
for (int j=i; j<=N; ++j)
{
for (int k=j; k<=N; ++k)
{
if (Search (Sum-V[i]-V[j]-V[k])!=-1)
{
S[0]=i;
S[1]=j;
S[2]=k;
Sum2=Sum-V[i]-V[j]-V[k];
break;
}
}
if (S[0]==i)
{
break;
}
}
if (S[0]==i)
{
break;
}
}
if (S[0]==-1)
{
printf ("-1\n");
return 0;
}
for (int i=1; i<=N; ++i)
{
for (int j=i; j<=N; ++j)
{
for (int k=j; k<=N; ++k)
{
if (V[i]+V[j]+V[k]==Sum2)
{
S[3]=i;
S[4]=j;
S[5]=k;
break;
}
}
if (S[3]==i)
{
break;
}
}
if (S[3]==i)
{
break;
}
}
for (int i=0; i<6; ++i)
{
printf ("%lld ", V[S[i]]);
}
printf ("\n");
return 0;
}