Cod sursa(job #2576562)
Utilizator | Tigoan Matei-Daniel TigoanMatei | Data | 6 martie 2020 20:27:12 |
---|---|---|---|
Problema | Submultimi | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n, k;
bool fol[20];
int sol[20];
int main()
{
in >> n;
for(int mask = 1; mask < (1 << n); mask ++)
{
for(int i = 0; i < n; ++ i)
if(mask & (1 << i))
{
out << i + 1 << " ";
}
out << '\n';
}
return 0;
}