Pagini recente » Cod sursa (job #240080) | Cod sursa (job #405972) | Istoria paginii runda/oni18_d2 | Cod sursa (job #1519451) | Cod sursa (job #2702330)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int n, p[20], fr[20];
void permutari(int length) {
if (length == n + 1) {
for (int i = 1; i <= n; ++i) {
fout << p[i] << " ";
}
cout << '\n';
return;
}
for (int i = 1; i <= n; ++i) {
if (fr[i] == 0) {
p[length] = i;
fr[i] = 1;
permutari(length + 1);
fr[i] = 0;
}
}
}
int main() {
fin >> n;
permutari(1);
return 0;
}