• Source
    1. program permutari;
    2. var i,j,k,n,aux:integer;
    3. a:array[1..100] of integer;
    4. procedure varf;
    5. begin k:=n;
    6. repeat k:=k-1
    7. until (k=0)or(a[k]<a[k+1])
    8. end;
    9. begin
    10. //writeln('dati n');readln(n);
    11. n:=4;
    12. for i:=1 to n do a[i]:=i;
    13. for i:=1 to n do write(a[i]); writeln;
    14. repeat
    15. varf;
    16. if k<>0 then
    17. begin
    18. j:=n+1;
    19. repeat
    20. j:=j-1
    21. until a[k]<a[j];
    22. aux:=a[k];a[k]:=a[j];a[j]:=aux;
    23. for i:=k+1 to (n+k) div 2 do
    24. begin
    25. aux:=a[i];
    26. a[i]:=a[n+k+1-i];
    27. a[n+k+1-i]:=aux
    28. end;
    29. for i:=1 to n do write(a[i]); writeln
    30. end
    31. until k=0;
    32. end.