Cod sursa(job #307667)
Utilizator | Stanescu Simona Simona14 | Data | 24 aprilie 2009 17:13:57 |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
var s:array[1..100] of integer;
n:integer;
procedure back(k:integer);
var i,j:integer;ok:boolean;
begin
for i:=1 to n do begin
s[k]:=i;
ok:=true;
{nu e binr daca s[k] se mai afla in solutie}
for j:=1 to k-1 do
if s[k]=s[j] then ok:=false;
if ok then
if k=n then begin for j:=1 to k do write(s[j],' ');
writeln;
end
else back(k+1);
end;
end;
begin {programul principal}
read(n);
back(1)
end.