Pagini recente » Borderou de evaluare (job #2127493) | Borderou de evaluare (job #3347380) | Borderou de evaluare (job #3307054) | Borderou de evaluare (job #3338344) | Cod sursa (job #3355464)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void printSolution(vector<int> solution) {
for (int i = 0; i < solution.size(); i++) {
fout << solution[i] << " ";
}
fout << "\n";
}
void backtracking(int start, int stop, vector<int>& domain, vector<int>& solution) {
if (start == stop) {
printSolution(solution);
return;
}
for (int i = 0; i < domain.size(); i++) {
int tmp = domain[i];
solution.push_back(domain[i]);
domain.erase(domain.begin() + i);
backtracking(start + 1, stop, domain, solution);
solution.pop_back();
domain.insert(domain.begin() + i, tmp);
}
}
int main() {
int n;
fin >> n;
vector<int> domain(n);
vector<int> solution;
for (int i = 1; i <= n; i++) {
domain[i-1] = i;
}
backtracking(0, n, domain, solution);
}