Pagini recente » Cod sursa (job #329678) | Cod sursa (job #2672535) | Cod sursa (job #3201771) | Cod sursa (job #1515010) | Cod sursa (job #3123285)
#include <iostream>
#include <vector>
using namespace std;
int N;
void back(int idx, vector<bool>& visited, vector<int>& perm) {
if (idx == N) {
for (int idx = 0; idx < N; idx++) {
if (idx > 0) {
cout << " ";
}
cout << perm[idx] + 1;
}
cout << "\n";
return;
}
for (int no = 0; no < N; no++) {
if (!visited[no]) {
perm[idx] = no;
visited[no] = true;
back(idx + 1, visited, perm);
visited[no] = false;
}
}
}
int main() {
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
cin >> N;
vector<bool> visited(N, false);
vector<int> perm(N, 0);
back(0, visited, perm);
return 0;
}