Pagini recente » Cod sursa (job #3298645) | Cod sursa (job #1666575) | Cod sursa (job #1483336) | Cod sursa (job #2122176) | Cod sursa (job #3355062)
#include <bits/stdc++.h>
using namespace std;
vector<int> arr, path;
vector<bool> used;
ifstream f ("permutari.in");
ofstream g("permutari.out");
void backtrack() {
if (path.size() == arr.size()) {
for (int i = 0; i < path.size(); i++)
g << path[i] << ' ';
g <<'\n';
return;
}
for (int i = 0; i < arr.size(); i++) {
if (!used[i]) {
used[i] = true;
path.push_back(arr[i]);
backtrack();
used[i] = false;
path.pop_back();
}
}
}
int main() {
int n, x;
f >> n;
for (int i = 1; i <= n; i++) {
arr.push_back(i);
}
arr.resize(n);
used.resize(n, false);
backtrack();
}