Advent_of_Code_in_Pascal/permute_experiment.lpr at master · mikewarot/Advent_of_Code_in_Pascal · GitHub

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
program permute_experiment;
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.