Cod sursa(job #2416229)
| Utilizator | Data | 27 aprilie 2019 11:01:25 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n;
int c[20];
bool used[20];
void write() {
for(int i = 1; i <= n; i++)
out << c[i] << ' ';
out << '\n';
}
void gen(int pos) {
if(n < pos)
write();
else {
for(int i = 1; i <= n; i++) {
if(!used[i]) {
c[pos] = i;
used[i] = true;
gen(pos + 1);
c[pos] = 0;
used[i] = false;
}
}
}
}
int main()
{
in >> n;
gen(1);
in.close();
out.close();
return 0;
}
