Pagini recente » Cod sursa (job #2920926) | Cod sursa (job #1212203) | Cod sursa (job #2757691) | Cod sursa (job #2533102) | Cod sursa (job #1026063)
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int n;
int solution[10], freq[10];
void afisareSolutie(){
int i;
for(i = 1; i <= n - 1; ++i)
printf("%d ", solution[i]);
printf("%d\n", solution[i]);
}
void backtrack(int k) {
if (k > n) {
afisareSolutie();
} else {
for(int i = 1; i <= n; ++i) {
solution[k] = i;
if (freq[i] == 0) {
freq[i] = 1;
backtrack(k + 1);
freq[i] = 0;
}
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
scanf("%d", &n);
backtrack(1);
}