procedure SortByCount(a: Vector; kol: integer; var b: Vector); {Сортировка подсчетом} var i, j: integer; c: array[1..50] of integer;
begin for i := 1 to 50 do C[i] := 0; for j := 1 to kol do c[A[j]] := c[A[j]] + 1; for i := 2 to 50 do c[i] := c[i] + c[i - 1]; for j := kol downto 1 do begin b[c[a[j]]] := a[j]; c[a[j]] := c[a[j]] - 1 end end;
begin writeln('Исходный массив'); for i := 1 to n do write(a[i]:4); writeln; SortByCount(a, n, b); writeln('Отсортированный массив'); for i := 1 to n do write(b[i]:4); end.
Uses Crt; Var A,B:integer; P:real; C:boolean; Begin ClrScr; Write('Введите натуральное число: ');ReadLn(B); Write('A = ');ReadLn(A); P:=1; C:=false; B:=Abs(B); While B>0 do Begin P:=P*(B mod 10); if B mod 10 = A then C:=true; B:=B div 10 End; WriteLn('P = ',P); if C then WriteLn('Не верно') else WriteLn('Верно'); ReadLn End.
uses Crt; Var A:integer; Begin ClrScr; For A:= 100 to 999 do if ((A+1) mod 2 = 0)and((A+2) mod 3 = 0)and((A+3) mod 4 = 0)and((A+4) mod 5 = 0) then Write(A,' '); ReadLn; End.
uses Crt; Var A,B,C:integer; Begin ClrScr; Write('Введите натуральное число: ');ReadLn(B); Write('A = ');ReadLn(A); C:=0; While B<>0 do Begin if B mod 10 <> A then C:=C*10+B mod 10; B:=B div 10; End; While C<>0 do Begin B:=B*10+C mod 10; C:=C div 10 End; WriteLn(B); ReadLn; End.