Pagini recente » Cod sursa (job #1030640) | Cod sursa (job #1551369) | Cod sursa (job #1551244) | Cod sursa (job #2683791) | Cod sursa (job #822021)
Cod sursa(job #822021)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int main() {
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
int n, maxNum;
scanf("%d", &n);
maxNum = pow(2.0, n);
for(int num =1; num < maxNum; num++) {
for (int i = 0; i < n; i++) {
int mask = 1 << i;
if ( (mask & num) == mask)
printf("%d ", i + 1);
}
printf("\n");
}
return 0;
}