Pagini recente » Istoria paginii runda/test_competition/clasament | Istoria paginii runda/vali_tigan/clasament | Cod sursa (job #2439058) | Istoria paginii runda/jjjj | Cod sursa (job #2577071)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int N, fr[26], v[18];
void gen(int lg, int v[18]) {
if (lg == N + 1) {
for (int i = 1; i <= N; ++i) {
g << v[i] << " ";
}
g << "\n";
return;
}
for (int i = 1; i <= N; ++i) {
if (fr[i] == 0) {
v[lg] = i;
fr[i] = 1;
gen(lg + 1, v);
fr[i] = 0;
}
}
}
int main() {
f >> N;
gen(1, v);
f.close();
g.close();
return 0;
}