Pagini recente » Cod sursa (job #1489986) | Cod sursa (job #2632172) | Cod sursa (job #1756912) | Cod sursa (job #263100) | Cod sursa (job #3166575)
#include <iostream>
#include <fstream>
using namespace std;
FILE *fin, *fout;
const int NMAX = 8;
bool used[NMAX + 1];
int perm[NMAX + 1];
void generate_permutation(int n, int index) {
if (index == n) {
for (int i = 0; i < n; i++)
fprintf(fout, "%d ", perm[i]);
fprintf(fout, "\n");
}
for (int i = 1; i <= n; i++) {
if (!used[i]) {
perm[index] = i;
used[i] = true;
generate_permutation(n, index + 1);
used[i] = false;
}
}
}
int main()
{
fin = fopen("permutari.in", "r");
fout = fopen("permutari.out", "w");
int n;
fscanf(fin, "%d", &n);
generate_permutation(n, 0);
fclose(fin);
fclose(fout);
return 0;
}