-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmy_permute.pas
124 lines (102 loc) · 2.06 KB
/
my_permute.pas
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
unit my_permute;
interface
procedure permute(ValueCount,N : integer; var Dst : Array of integer);
function Factorial(N : integer): int64;
implementation
procedure permute(ValueCount,N : integer; var Dst : Array of integer);
var
i,j,k : integer;
a,b,z : integer;
q : array[1..100] of integer;
p : array[1..100] of integer;
available : set of byte;
pcount : integer;
begin
pCount := ValueCount;
a := N-1;
z := a;
for b := 2 to PCount do
begin
j := z div b; k := z mod b;
q[(Pcount+1)-b] := k;
z := j;
end;
q[PCount] := 0;
// for b := 1 to PCount do
// write(q[b],' ');
available := [1..PCount];
for i := 1 to PCount do
begin
k := q[i]+1;
j := 0;
repeat
inc(j);
if j in available then dec(k);
until k=0;
p[i] := j;
available := available - [j];
end;
// Write('Output : ');
for i := 1 to PCount do
begin
// Write(p[i],' ');
dst[i-1] := p[i];
end;
// Writeln;
end; // permute
function Factorial(N : integer): int64;
var
z : int64;
begin
z := 1;
while n > 1 do
begin
z := z * n;
dec(n);
end;
Factorial := z;
end;
(*
var
i,j,k : integer;
a,b,z : integer;
q : array[1..10] of integer;
p : array[1..10] of integer;
available : set of byte;
pcount : integer;
begin
Write('How many to permute? :'); ReadLn(Pcount);
for a := 0 to 100 do
begin
z := a;
for b := 2 to PCount do
begin
j := z div b; k := z mod b;
q[(Pcount+1)-b] := k;
z := j;
end;
q[PCount] := 0;
for b := 1 to PCount do
write(q[b],' ');
available := [1..PCount];
for i := 1 to PCount do
begin
k := q[i]+1;
j := 0;
repeat
inc(j);
if j in available then dec(k);
until k=0;
p[i] := j;
available := available - [j];
end;
Write('Output : ');
for i := 1 to PCount do
Write(p[i],' ');
Writeln;
end;
readln;
end.
*)
initialization
end. // initialization