Pagini recente » Cod sursa (job #3268607) | Cod sursa (job #37927) | Cod sursa (job #3247762) | Cod sursa (job #48515) | Cod sursa (job #821989)
Cod sursa(job #821989)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
void printSubsets(int num, int n) {
int mask;
// cout << num << " " << n << endl;
// cout <<" ! ";
for (int i = 0; i < n; i++) {
int mask = 1 << i;
if ( (mask & num) == mask) {
cout << i + 1 << " ";
}
}
mask = 1 << (n - 1);
if ( (mask & num) == mask) {
cout << (n - 1) + 1;
}
cout << endl;
}
int main() {
int n, maxNum, num = 0;
in >> n;
maxNum = pow(2.0, n);
while (num < maxNum - 1) {
num++;
printSubsets(num, maxNum);
}
return 0;
}