Cod sursa(job #3354654)
| Utilizator | Data | 19 mai 2026 17:33:32 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#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;
}