Cod sursa(job #2499404)
Utilizator | Data | 26 noiembrie 2019 00:31:22 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
#include <vector>
using namespace std;
int N;
inline bool isBitSet(int mask, int value) {
return mask & (1 << (value - 1));
}
int main() {
freopen("submultimi.in", "r", stdin);
freopen("submultimi.out", "w", stdout);
scanf("%d", &N);
for (int mask = 1; mask < (1 << N); mask++) {
for (int elem = 1; elem <= N; elem++) {
if (isBitSet(mask, elem)) {
printf("%d ", elem);
}
}
printf("\n");
}
return 0;
}