Pagini recente » Cod sursa (job #2313934) | Cod sursa (job #1630310) | Cod sursa (job #2747391) | Cod sursa (job #1764788) | Cod sursa (job #3354654)
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> solution(100, 0);
void back(int pos, set<int> domain) {
if(pos == n) {
for(int i = 0; i < n; i++) cout<<solution[i]<<" ";
cout << "\n";
return;
}
set<int> dom(domain.begin(), domain.end());
for(auto i : domain) {
solution[pos] = i;
dom.erase(i);
back(pos + 1, dom);
dom.emplace(i);
}
}
int main() {
std::ios::sync_with_stdio(false);
cin>>n;
set<int> domain;
for(int i = 1; i <= n; i++) domain.insert(i);
back(0, domain);
return 0;
}