Pagini recente » Cod sursa (job #2550087) | Diferente pentru tree-decompositions intre reviziile 76 si 75 | Cod sursa (job #2036015) | Cod sursa (job #2047941) | Cod sursa (job #1743661)
#include <stdio.h>
using namespace std;
int n;
void solve()
{
int limita = 1 << n;
for(int i = 1 ; i < limita ; i++)
{
for(int j = 1 ; j < n ; j++)
if(i & ( 1 << j-1))
printf("%d ",j);
printf("\n");
}
}
void read()
{
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d ",&n);
solve()
}
int main()
{
read();
return 0;
}