Pagini recente » Cod sursa (job #592122) | Cod sursa (job #592107) | Cod sursa (job #469267) | Cod sursa (job #3355426) | Cod sursa (job #3361586)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ft(n) for(int i=1; i<=n; i++)
#define sp ' '
string file = "submultimi";
ifstream f(file + ".in");
ofstream g(file + ".out");
int n, k;
vector<int> v(20);
int main() {
f >> n;
for (int i = 1; i <= n; i += 1)
v[i] = i;
int nr = (1 << n);
for (int i = 1; i < nr; i += 1) {
bitset<20> x(i);
for (int j = 0; j < n; j += 1)
if (x[j] == 1)
g << v[j + 1] << ' ';
g << '\n';
}
return 0;
}