-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path50 Generate all permutation.cpp
133 lines (103 loc) · 2.14 KB
/
50 Generate all permutation.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
/** Which of the favors of your Lord will you deny ? **/
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define PII pair<int,int>
#define PLL pair<LL,LL>
#define F first
#define S second
#define ALL(x) (x).begin(), (x).end()
#define READ freopen("alu.txt", "r", stdin)
#define WRITE freopen("vorta.txt", "w", stdout)
#ifndef ONLINE_JUDGE
#define DBG(x) cout << __LINE__ << " says: " << #x << " = " << (x) << endl
#else
#define DBG(x)
#endif
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p);
template <class T>
ostream &operator <<(ostream &os, vector<T>&v);
template <class T>
ostream &operator <<(ostream &os, set<T>&v);
inline void optimizeIO()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const int nmax = 2e5+7;
vector<int>v;
vector<bool>inPermutaion;
int n;
vector<int>permutation;
void generate()
{
if((int)permutation.size()==n)
{
cout<<permutation<<endl;
return;
}
for(int i=0;i<n;i++)
{
if(inPermutaion[i]) continue;
inPermutaion[i] = true;
permutation.push_back(v[i]);
generate();
inPermutaion[i] = false;
permutation.pop_back();
}
}
void generate_using_stl()
{
permutation.clear();
permutation = v;
cout<<"STL"<<endl;
do{
cout<<permutation<<endl;
}while(next_permutation(ALL(permutation)));
}
int main()
{
optimizeIO();
while(true)
{
cin>>n;
v = vector<int>(n);
inPermutaion = vector<bool>(n,false);
for(int i=0; i<n; i++)
cin>>v[i];
generate();
generate_using_stl();
}
return 0;
}
/**
**/
template<class T1, class T2>
ostream &operator <<(ostream &os, pair<T1,T2>&p)
{
os<<"{"<<p.first<<", "<<p.second<<"} ";
return os;
}
template <class T>
ostream &operator <<(ostream &os, vector<T>&v)
{
os<<"[ ";
for(int i=0; i<v.size(); i++)
{
os<<v[i]<<" " ;
}
os<<" ]";
return os;
}
template <class T>
ostream &operator <<(ostream &os, set<T>&v)
{
os<<"[ ";
for(T i:v)
{
os<<i<<" ";
}
os<<" ]";
return os;
}