Cod sursa(job #1796501)
| Utilizator | Data | 3 noiembrie 2016 15:57:48 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n, i, j, c, p, k, m;
int v[20];
int main(){
fin>>n;
m = (1<<n)-1;
//luam toate subm,ultimile de la 1 pana la 2^n - 1
for(i=1;i<=m;i++){
//reprezentarea in baza 2 a lui i este o submultime
j = n;
while (v[j] == 1) {
v[j] = 0;
j--;
}
v[j] = 1;
for (j=1;j<=n;j++)
if (v[j] == 1)
fout<<j<<" ";
fout<<"\n";
}
return 0;
}
