Pagini recente » Cod sursa (job #2346056) | Cod sursa (job #175780) | Cod sursa (job #851664) | Cod sursa (job #1806) | Cod sursa (job #196843)
Cod sursa(job #196843)
#include <stdio.h>
#include <map>
using namespace std;
#define NMAX 102
#define mp make_pair
#define ff first
#define ss second
long int n;
long int v[NMAX];
map<int, int> h;
map<int, int> ex;
int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
long int i,j,k,s,nr,x,y,z;
scanf("%ld %ld",&n,&nr);
for (i=1;i<=n;i++) scanf("%ld ",&v[i]);
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
for (k=j;k<=n;k++)
{
s=v[i]+v[j]+v[k];
ex[s]=1;
h[s]=i*1000000+j*1000+k;
if (ex[nr-s]) {
x=h[nr-s]%1000;
y=(h[nr-s]/1000)%1000;
z=h[nr-s]/1000000;
// printf("%ld ",h[nr-s]);
printf("%ld %ld %ld %ld %ld %ld",v[i],v[j],v[k],v[x],v[y],v[z]);
return 0;
}
}
printf("-1");
return 0;
}