OvY2611

321

Mar 6th, 2017
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. {Implementarea metodei backtracking pentru generarea permutarilor de n
  2. elemente in varianta recursiva}
  3. type vec=array [1..30] of integer;
  4. var st:vect;
  5. n:integer;
  6.  
  7. procedure initializari;
  8. var i:integer;
  9. begin
  10. writeln('n=');readln(n);
  11. for i:=1 to 30 do st[i]:=0
  12. end;
  13.  
  14. procedure tpar(p:integer);
  15. var i:integer;
  16. begin
  17. for i:=1 to p do write(st[i]:4,' ');
  18. writeln
  19. end;
  20.  
  21. function valid(p:integer):boolean;
  22. var i:integer;
  23. ok:boolean;
  24. begin
  25. ok:=true;
  26. for i:=1 to p-1 do
  27. if st[i]=st[p] then ok:=false;
  28. valid:=ok
  29. end;
  30.  
  31. procedure bktr(p:integer);
  32. var val:integer;
  33. begin
  34. for val:=1 to n do begin
  35. st[p]:=val;
  36. if valid(p) then
  37. if p=n then tpar(p)
  38. else bktr(p+1)
  39. end
  40. end;
  41.  
  42. begin
  43. initializari;
  44. bktr(1);
  45. readln;
  46. end.
Add Comment
Please, Sign In to add comment