Pagini recente » Cod sursa (job #1224630) | Cod sursa (job #1663729) | Clasament simulare-cartita-31a | Cod sursa (job #576507) | Cod sursa (job #613932)
Cod sursa(job #613932)
#include<cstdio>
const int N = 17;
int n;
bool sol[N];
void read()
{
freopen ( "submultimi.in" , "r" , stdin );
freopen ( "submultimi.out" , "w" , stdout );
scanf ( "%d" , &n );
}
void afisare()
{
int ok=0;
for (int i=1 ; i<=n ; ++i )
{
if (sol[i])
{
printf("%d " , i);
ok = 1;
}
}
if (ok) printf("\n");
}
void bkt(int p)
{
if(p-1 == n)
{
afisare();
return;
}
sol[p] = false;
bkt(p+1);
sol[p] = true;
bkt(p+1);
}
void solve()
{
bkt(1);
}
int main()
{
read();
solve();
return 0;
}