Pagini recente » Cod sursa (job #2093137) | Cod sursa (job #1341834) | Cod sursa (job #1512670) | Cod sursa (job #62302) | Cod sursa (job #70396)
Cod sursa(job #70396)
#include<stdio.h>
int n,o;
long a[101],q[101],s,max;
void citire()
{
freopen("loto.in","r",stdin);
scanf("%d%ld", &n, &s);
for (int i=0; i<n; i++)
{
scanf("%lld", &a[i]);
if (a[i]>max)
max=a[i];
}
fclose(stdin);
}
void listare()
{
o=1;
freopen("loto.out","w",stdout);
for (int i=1; i<=6; i++)
printf("%ld ", q[i]);
fclose(stdout);
}
void back(int w, long suma)
{
if (w>6)
{
if (suma==0)
listare();
}
else
{
for (int i=0; i<n; i++)
{
q[w]=a[i];
suma-=a[i];
if (s>=0)
back(w+1,suma);
else break;
if (o==1)
break;
suma+=a[i];
}
}
}
void radx(long max,long zero[101],long n)
{
long z,u,j;
int unu[101];
for (long i=0; i<max; i++)
{
z=-1;
u=-1;
for (j=0; j<n; j++)
{
//l=zero[j] >> i;
if (((zero[j] >> i) &1)==0)
zero[++z]=zero[j];
else unu[++u]=zero[j];
}
u=-1;
for (j=z+1; j<n; j++)
zero[j]=unu[++u];
}
}
int nr_pasi(long max1)
{
int pas=0;
while (max1>0)
{
++pas;
max1>>=1;
}
return pas;
}
void foruri()
{
}
int main()
{
citire();
o=0;
max=nr_pasi(max);
radx(max,a,n);
back(1,s);
//foruri();
return 0;
}