Pagini recente » Cod sursa (job #2806271) | Cod sursa (job #1760999) | template/preoni-2007 | Cod sursa (job #426103) | Cod sursa (job #268812)
Cod sursa(job #268812)
#include<stdio.h>
#define IN "loto.in","r",stdin
#define OUT "loto.out","w",stdout
#define Nmax 120
int n,s,sum;
int v[Nmax],sol[8];
bool ok=false;
void citire()
{
freopen(IN);
scanf("%d%d",&n,&s);
for(int i=1;i<=n;++i)
scanf("%d",&v[i]);
}
void afisare()
{
for(int i=1;i <= 6; ++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if(ok==true)
return;
if(k == 7)
{
// for(int i=1;i<=7;++i)
// printf("%d ",&sol[i]);
// printf("\n");
//printf("%d \n",sum);
if(sum == s)
{
afisare();
ok=true;
}
return ;
}
for(int i=1;i<=n;++i)
{
//printf("%d ",v[i]);
sum+=v[i];
sol[k]=v[i];
//printf("%d \n",sol[k]);
back(k+1);
sum-=v[i];
}
}
int main()
{
freopen(OUT);
citire();
back(1);
if(ok==false)
printf("-1\n");
return 0;
}