Pagini recente » Cod sursa (job #198563) | Cod sursa (job #1386016) | Cod sursa (job #3135099) | Cod sursa (job #3132174) | Cod sursa (job #70168)
Cod sursa(job #70168)
#include<stdio.h>
int n,s,a[100];
void read()
{
int i;
scanf("%d%d",&n,&s);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
}
void solve()
{
int i,j,k,l,m,o;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
for(k=0;k<n;k++)
for(l=0;l<n;l++)
for(m=0;m<n;m++)
for(o=0;o<n;o++)
if(a[i]+a[j]+a[k]+a[l]+a[m]+a[o]==s)
{
printf("%d %d %d %d %d %d\n",a[i],a[j],a[k],a[l],a[m],a[o]);
return;
}
printf("-1\n");
}
int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);
read();
solve();
return 0;
}