Pagini recente » Cod sursa (job #2607600) | Cod sursa (job #2246818) | Cod sursa (job #1682810) | Cod sursa (job #1744937) | Cod sursa (job #2842300)
#include <bits/stdc++.h>
using namespace std;
FILE *fin, *fout;
const int NMAX = 9;
int n;
int v[NMAX], f[NMAX];
void bkt(int poz) {
if(poz == n) {
for(int i = 0; i < n; i++)
fprintf(fout, "%d ", v[i]);
fprintf(fout, "\n");
} else {
for(int i = 1; i <= n; i++) {
if(f[i] == 0) {
v[poz] = i;
f[i] = 1;
bkt(poz + 1);
f[i] = 0;
}
}
}
}
int main() {
fin = fopen("permutari.in", "r");
fout = fopen("permutari.out", "w");
fscanf(fin, "%d", &n);
bkt(0);
fclose(fin);
fclose(fout);
return 0;
}