Pagini recente » Cod sursa (job #1923930) | Cod sursa (job #2437319) | Cod sursa (job #133663) | Cod sursa (job #1640464) | Cod sursa (job #551040)
Cod sursa(job #551040)
#include<cstdio>
#include<algorithm>
int st[10];
int a[105];
int s,i,n;
int j,k,l,m,b;
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=1;j<=n;j++)
for(k=1;k<=n;k++)
for(l=1;l<=n;l++)
for(m=1;m<=n;m++)
for(b=1;b<=n;b++)
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[b]==s){
printf("%d %d %d %d %d %d",a[i],a[j],a[k],a[l],a[m],a[b]);
return 0;
}
printf("-1");
return 0;
}