Pagini recente » Cod sursa (job #1586585) | Cod sursa (job #1984953) | fmi-no-stress-2012/solutii/parantezare | Monitorul de evaluare | Cod sursa (job #919969)
Cod sursa(job #919969)
#include <string.h>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#define MAX 20
using namespace std;
int main() {
int n, i, j, st, k;
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
scanf("%d", &n);
int nr = pow(2,n);
nr = 2;
st = 1;
for (i=1; i<=n; i++) {
for (j=st; j<nr; j++) {
//cout<<"nr "<<j<<endl;
for (k=0; k<i; k++)
if (j&(1<<k))
cout<<k+1<<" ";
cout<<endl;
}
st = nr;
nr*=2;
}
return 0;
}