Question

PASCAL全排列程序

输入n,求n的全排列...
pascal程序..谢~

Answer 1

var
a:Array[1..10] of integer;
i,j,p,n,q,t:integer;
begin
read(n);
for i:=1 to n do a[i]:=i;
while true do
begin
for i:=1 to n do write(a[i],' ');writeln;
for i:=n downto 2 do if a[i-1]<a[i] then break;
if a[i-1]<a[i] then p:=i-1 else break;{找到最靠后的可以交换的数 找不到就退出循环}
q:=0;
for i:=p+1 to n do if ((a[i]>a[p])and((q=0)or(a[i]<a[q]))) then q:=i;{找到另一个可以交换的最小的数}
t:=a[p];a[p]:=a[q];a[q]:=t;
for i:=p+1 to (p+n)div 2 do{交换前一个刚刚交换的数后的区间反转}
begin
t:=a[i];
a[i]:=a[p+n-i+1];
a[p+n-i+1]:=t;
end;
end;
end.

Answer 2

用深度优先算法
program sou1;
var a:array[1..100]of integer;n,i,x:integer;s:set of 1..100;
begin
readln(n);
i:=1;a[i]:=0;s:=[];
repeat
repeat
inc(a[i]);
until not(a[i]in s)or(a[i]>n);
if a[i]>n then begin i:=i-1;s:=s-[a[i]]; end
else
begin
s:=s+[a[i]];
if i=n then begin for x:=1 to n do write(a[x]);writeln;s:=s-[a[i]];end
else begin i:=i+1;a[i]:=0; end;
end;
until i<1;
end.

Answer 3

program form;
var n:longint;
a,x:array [0..100] of longint;
procedure print;
var i:longint;
begin
for i:=1 to n do write(a[i]);
writeln;
end;
procedure dfs(p:longint);
var i:longint;
begin
if p>n then print
else
begin
for i:=1 to n do
if x[i]=0 then
begin
x[i]:=1;
a[p]:=i;
dfs(p+1);
x[i]:=0;
a[p]:=0;
end;
end;
end;
begin
assign(input,'form.in');
assign(output,'form.out');
reset(input);
rewrite(output);
readln(n);
dfs(1);
close(input);
close(output);
end.
用递归

Answer 4

program sou1;
var a:array[1..100]of integer;n,i,x:integer;s:set of 1..100;
begin
readln(n);
i:=1;a[i]:=0;s:=[];
repeat
repeat
inc(a[i]);
until not(a[i]in s)or(a[i]>n);
if a[i]>n then begin i:=i-1;s:=s-[a[i]]; end
else
begin
s:=s+[a[i]];
if i=n then begin for x:=1 to n do write(a[x]);writeln;s:=s-[a[i]];end
else begin i:=i+1;a[i]:=0; end;
end;
until i<1;
end.
这个在我的编译器上是对的，所以应该是对的吧。

Answer 5

其实让别人教标程很没趣
自己是着有穷举作一下也不错！
只是时间会超！