Pagini recente » Cod sursa (job #686098) | Cod sursa (job #2944728) | Cod sursa (job #504759) | Cod sursa (job #1775641) | Cod sursa (job #1777301)
#include <cstdio>
#include <vector>
using namespace std;
vector <int> v[666017],v1[666017],v2[666017],v3[666017];
int n,x,x1,s,i,j,k,h,z,a[104];
bool ok;
int main()
{
freopen ("loto.in","r",stdin);
freopen ("loto.out","w",stdout);
scanf ("%d %d", &n, &s);
for (i=1;i<=n;i++)
scanf ("%d", &a[i]);
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
for (k=j;k<=n;k++)
{
x=a[i]+a[j]+a[k];
if (x<=s)
{
x1=x%666013;
z=v[x1].size();
for (h=0;h<z;h++)
if (v[x1][h]==x)
break;
if (h==z)
{
v[x1].push_back(x);
v1[x1].push_back(a[i]);
v2[x1].push_back(a[j]);
v3[x1].push_back(a[k]);
}
}
}
ok=false;
for (i=1;i<=n && ok==false;i++)
for (j=i;j<=n && ok==false;j++)
for (k=j;k<=n && ok==false;k++)
{
x=s-a[i]-a[j]-a[k];
if (x>=0)
{
x1=x%666013;
z=v[x1].size();
for (h=0;h<z;h++)
if (v[x1][h]==x)
break;
}
if (h<z)
{
ok=true;
printf ("%d %d %d %d %d %d", a[i],a[j], a[k], v1[x1][h], v2[x1][h], v3[x1][h]);
}
}
if (ok==false)
printf ("%d", -1);
return 0;
}