Pagini recente » Cod sursa (job #895646) | Cod sursa (job #2358630) | Cod sursa (job #2685995) | Cod sursa (job #2930072) | Cod sursa (job #1220427)
#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <fstream>
using namespace std;
#define inf 0xfffffff
#define MOD 1999999973
int n;
int main() {
freopen("submultimi.in","r",stdin);
freopen("submultimi.out","w",stdout);
scanf("%d", &n);
for (int i = 1; i < (1 << n); i++) {
for (int j = 0; j < n; j++)
if (i & (1<<j)){
printf("%d ", j+1);
}
printf("\n");
}
return 0;
}