-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathpermutari3.cpp
59 lines (53 loc) · 1.14 KB
/
permutari3.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
# include <fstream>
# include <algorithm>
# include <cstring>
# define LB(p) ((-p)&p)
# define NR 20
using namespace std;
ifstream f("permutari3.in");
ofstream g("permutari3.out");
int i,j,n,m,Q,t;
long long F[NR], D, X;
int p[NR], ap[NR], a[NR], sol[NR];
void factoriale (int n) {
F[0]=1; F[1]=1;
for (int i=2; i<=n; ++i)
F[i]=F[i-1] * i;
}
long long determinare () {
long long nrsol=0;
for (int i=1; i<=n; ++i) {
for (int j=1; j<a[i]; ++j)
if (ap[j]==0) nrsol+=F[n-i];
ap[a[i]]=1;
}
return nrsol+1;
}
void procesare (long long X) {
memset (sol, 0, sizeof(sol));
memset (ap, 0, sizeof(sol));
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j) {
if (ap[j]==0) {
if (X > F[n-i]) X-=F[n-i];
else {sol[i]=j; ap[j]=1; break;}
}
}
}
}
int main ()
{
f>>n;
for (i=1; i<=n; ++i) f>>a[i];
factoriale (n);
D=determinare (); //g<<D<<"\n";
f>>Q;
for (t=1; t<=Q; ++t) {
f>>X;
procesare (D+X);
for (i=1; i<=n; ++i)
g<<sol[i]<<" ";
g<<"\n";
}
return 0;
}