Pagini recente » Cod sursa (job #2814712) | Cod sursa (job #1610818) | Cod sursa (job #2366463) | Cod sursa (job #3224568) | Cod sursa (job #1009430)
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct point
{
long long x,y,z;
point *q;
}*g[666013],*p;
long long n,v[113],i,j,k,s,h;
inline int hash(long long x)
{
return(int)(x*((float)(sqrt(5)+1)/2))%666013;
}
int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%lld%lld",&n,&s);
for(i=0;i<666013;++i)g[i]=NULL;
for(i=0;i<n;++i)scanf("%lld",&v[i]);
for(i=0;i<n;++i)
for(j=i;j<n;++j)
for(k=j;k<n;++k)
{
p=new point;
p->x=v[i];
p->y=v[j];
p->z=v[k];
h=hash(v[i]+v[j]+v[k]);
p->q=g[h];
g[h]=p;
}
for(i=0;i<n;++i)
for(j=i;j<n;++j)
for(k=j;k<n;++k)
{
h=v[i]+v[j]+v[k];
h=hash(s-h);
if(g[h]!=NULL)
{
printf("%lld %lld %lld %lld %lld %lld\n",v[i],v[j],v[k],g[h]->x,g[h]->y,g[h]->z);
return 0;
}
}
printf("-1\n");
return 0;
}