Pagini recente » Teoria jocurilor: numerele Sprague Grundy | Cod sursa (job #1518927) | Cod sursa (job #2031168) | Cod sursa (job #1274809) | Cod sursa (job #24742)
Cod sursa(job #24742)
#include<stdio.h>
int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
long n=0,i,j,k,l,o,p,s=0,ok=0,x[101];
scanf("%ld %ld",&n,&s);
for(i=1;i<=n;i++)
scanf("%ld",&x[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(o=1;o<=n;o++){
for(p=1;p<=n;p++){
if(x[i]+x[j]+x[k]+x[l]+x[o]+x[p]==s)
{
printf("%ld %ld %ld %ld %ld %ld",x[i],x[j],x[k],x[l],x[o],x[p]);
ok=1;
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(ok)
break;
}
if(!ok)
printf("-1");
return 0;
}