Pagini recente » Cod sursa (job #2496746) | simulare_oji_hlo_liceu_intermediari | Istoria paginii utilizator/arctos | Cod sursa (job #214748) | Cod sursa (job #2004060)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <cmath>
#define ll long long
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
const int NMax = 1e6 + 5;
const int inf = 1e9 + 5;
int T,N;
int main() {
in>>N;
int lim = 1<<N;
for (int u=0;u < lim;++u) {
for (int i=1;i <= N;++i) {
if ((1<<(i-1)) & u) {
out<<i<<' ';
}
}
out<<'\n';
}
in.close();out.close();
return 0;
}