Cod sursa(job #1500409)
| Utilizator | Data | 11 octombrie 2015 21:52:52 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
#define MAXN 17
int n, m, St[MAXN];
bitset<MAXN> used;
void output(int k){
for(int i=1; i<=k; ++i)
fout<<St[i]<<" ";
fout<<'\n';
}
void bkt(int k){
if(k==n+1)
return;
for(int i=St[k-1]+1; i<=n; ++i){
St[k]=i;
output(k);
bkt(k+1);
}
}
int main()
{
fin>>n;
bkt(1);
return 0;
}
