Cod sursa(job #1922659)
Utilizator | Data | 10 martie 2017 18:18:18 | |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int v[20];
int main (){
int n;
fin >> n;
for (int i = 1; i <= n; ++i)
v[i] = i;
int nr_sub = 1<<n;
fout << n << "\n";
for (int i = 2; i < nr_sub; ++i){
int copie = i;
int indice = n;
while (copie!=1){
if (copie%2)
fout << v[indice] << " ";
copie = copie/2;
indice--;
}
fout << v[indice] << " ";
fout << "\n";
}
}