Pagini recente » Cod sursa (job #1612202) | Cod sursa (job #2575674) | Cod sursa (job #2314378) | Cod sursa (job #3217806) | Cod sursa (job #1803392)
#include <cstdio>
using namespace std;
int v[10000];
int main()
{
int n,s,i,j,k,l,m,o,min1,max1;
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
scanf("%d%d", &n, &s);
max1=0;
min1=1000000000;
for (i=1;i<=n;i++) {
scanf("%d", &v[i]);
if (v[i]<min1)
min1=v[i];
if (v[i]>max1)
max1=v[i];
}
if (s<min1*6 || s>max1*6)
printf("-1");
else {
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
for (k=1;k<=n;k++)
for (l=1;l<=n;l++)
for (m=1;m<=n;m++)
for (o=1;o<=n;o++)
if (v[i]+v[j]+v[k]+v[l]+v[m]+v[o]==s)
printf("%d %d %d %d %d %d\n", v[i], v[j], v[k], v[l], v[m], v[o]),i=j=k=l=m=o=10000;
}
return 0;
}