Pagini recente » Cod sursa (job #1503768) | Cod sursa (job #899664) | Cod sursa (job #2130865) | Cod sursa (job #1329288) | Cod sursa (job #3354708)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("permutari.in");
ofstream cout ("permutari.out");
bool check(vector<int>& solution) {
return true;
}
void printSolution(vector<int>& solution) {
for (int x : solution) {
cout << x << ' ';
}
cout << endl;
}
void back(vector<int>& domain, vector<int>& solution) {
if (domain.size() == 0) {
printSolution(solution);
}
for (int i = 0; i < domain.size(); i++) {
int temp = domain[i];
solution.push_back(domain[i]);
domain.erase(domain.begin() + i);
back(domain, solution);
domain.insert(domain.begin() + i, temp);
solution.pop_back();
}
}
int main() {
int n;
cin >> n;
vector<int> domain(n);
vector<int> solution;
for (int i = 0; i < n; i++)
domain[i] = i + 1;
back(domain, solution);
return 0;
}