Cod sursa(job #2908820)
Utilizator | Data | 6 iunie 2022 00:36:38 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int n, p, pw2[16];
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int main()
{
f >> n;
p = 1 << n;
pw2[0] = 1;
for (int i = 1; i <= n; i++) pw2[i] = pw2[i - 1] << 1;
for(int i = 1; i < p; i++){
for(int j = 0; j <= n; j++)
if(pw2[j] & i) g << j + 1 << ' ';
g << '\n';
}
return 0;
}