Pagini recente » Cod sursa (job #469350) | Cod sursa (job #305471) | Cod sursa (job #579242) | Borderou de evaluare (job #1330342) | Cod sursa (job #307667)
Cod sursa(job #307667)
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.