Pagini recente » Cod sursa (job #593875) | Cod sursa (job #2710190) | Cod sursa (job #1366502) | Cod sursa (job #2215579) | Cod sursa (job #202256)
Cod sursa(job #202256)
#include<stdio.h>
#include<map>
using namespace std;
int num[101];
int main(void)
{
freopen("loto.in", "r", stdin);
freopen("loto.out", "w", stdout);
int n, s;
scanf("%d", &n);
scanf("%d", &s);
for(int i=0;i<n;++i)
{
scanf("%d", &num[i]);
}
map<int, int> sume;
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
for(int k=0;k<n;++k)
{
int suma = num[i]+num[j]+num[k];
sume[suma] = i*100000 + j*1000 + k;
int sp = s-suma;
if(sp < 0)
continue;
map<int, int>::iterator iter = sume.find(sp);
if(iter != sume.end())
{
int b = iter->second;
int i1 = b / 100000;
b %= 100000;
int i2 = b / 1000;
b %= 1000;
int i3 = b;
printf("%d %d %d %d %d %d\n", num[i], num[j], num[k], num[i1], num[i2], num[i3]);
return 0;
}
}
}
}
printf("-1\n");
return 0;
}