Cod sursa(job #2190996)
| Utilizator | Data | 1 aprilie 2018 12:01:38 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("permutari.in");
ofstream o("permutari.out");
int n, s[12];
bitset <12> viz;
void perm(int p)
{
if(p == n + 1)
{
for(int i = 1; i <= n; ++i)
o << s[i] << ' ';
o << '\n';
return;
}
for(int i = 1; i <= n; ++i)
if(not viz.test(i))
{
viz.set(i);
s[p] = i;
perm(p+1);
viz.reset(i);
}
}
int main()
{
f >> n;
perm(1);
return 0;
}
