Pagini recente » Cod sursa (job #1941365) | Cod sursa (job #2151402) | Cod sursa (job #429556) | Cod sursa (job #2522581) | Cod sursa (job #2855510)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char* x) { cout << '\"' << x << '\"'; }
void __print(const string& x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V>& x) { cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}'; }
template<typename T>
void __print(const T& x) { int f = 0; cout << '{'; for (auto& i : x) cout << (f++ ? "," : ""), __print(i); cout << "}"; }
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << ", "; _print(v...); }
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
int n;
vector<int> a, ans;
bool ok(){
unordered_map<int,bool> m;
for(int i=0; i<ans.size(); i++){
if(m[ans[i]]) return false;
m[ans[i]]=true;
}
return true;
}
void backt(int x){
if(x==n){
for(int& i:ans) cout<<i<<" ";
cout<<nl;
}
else{
for(int i=0; i<n; i++){
ans.emplace_back(a[i]);
if(ok()) backt(x+1);
ans.pop_back();
}
}
}
void solve()
{
cin>>n;
a.resize(n);
iota(a.begin(),a.end(),1);
backt(0);
}
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
freopen("permutari.in", "r", stdin);
freopen("permutari.out", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
// int t;
// cin >> t;
for(int tt=1; tt<=t; tt++){
// cout<<"#Case "<<t<<nl;
solve();
}
return 0;
}