Pagini recente » Cod sursa (job #2940778) | Cod sursa (job #40450) | Cod sursa (job #2492426) | Cod sursa (job #2599896) | Cod sursa (job #642815)
Cod sursa(job #642815)
#include <cstdio>
#include <list>
using namespace std;
int n ;
void solve() {
scanf("%d", &n);
int maxim = 1<<n;
for (int i = 1; i < maxim; ++i) {
int ss = 1;
bool done = false;
for (int j = 0; ss <= i && j < n; ++j, ss = 1<<j) {
if (i & ss) {
if (! done) {
printf("%d", j + 1);
done = true;
} else {
printf(" %d", j + 1);
}
}
}
printf("\n");
}
}
int main() {
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
solve();
return 0;
}