Pagini recente » Cod sursa (job #788385) | Cod sursa (job #3354722) | Monitorul de evaluare | Borderou de evaluare (job #1596292) | Cod sursa (job #3354733)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void backtrack(int step, int n, vector<int>& sol, vector<bool>& visited) {
if (step == n) {
for (auto elem : sol) {
fout << elem << " ";
}
fout << '\n';
return;
}
for (int i = 1; i <= n; i++) {
if (visited[i]) continue;
sol[step] = i;
visited[i] = true;
backtrack(step + 1, n, sol, visited);
visited[i] = false;
}
}
int main() {
int n;
fin >> n;
vector<int> sol(n);
vector<bool> visited(n, false);
backtrack(0, n, sol, visited);
fin.close();
fout.close();
return 0;
}