Program fofgogjoj; var arr: array[1..1000] of byte; max_num, min_num: byte; i: byte; n,p:integer; begin randomize; Wriiteln('Введите число n'); Readln(n); for i := 1 to n do begin arr[i] := random(100); Write (arr[i]:3); end; max_num := arr[1]; for i := 2 to n do if arr[i] > max_num then begin max_num := arr[i]; end; Writeln; Writeln ('Max = ',max_num); min_num := arr[1]; for i := 2 to n do if arr[i] < min_num then begin min_num := arr[i]; end; Writeln; Writeln ('Min = ',min_num); P:=max_num*min_num; Writeln('Произведение равно:',p); end.
var
n, Num, i, j, t: integer;
Count: array[1..12] of integer;
Names: array[1..12] of integer;
begin
for i := 1 to 12 do
begin
Count[i] := 0;
Names[i] := i;
end;
ReadLn(N); { Считываем количество запросов}
for i := 1 to N do
begin
ReadLn(t); {считали очередной запрос}
Count[t] := Count[t] + 1;
end;
{Сортируем массивы Names и Count в порядке убывания значений массива Count}
for i := 12 downto 2 do
for j := 2 to i do
if Count[j - 1] < Count[j] then
begin
t := Count[j];
Count[j] := Count[j - 1];
Count[j - 1] := t;
t := Names[j];
Names[j] := Names[j - 1];
Names[j - 1] := t;
end;
for i := 12 downto 1 do
if Count[i] > 0 then
WriteLn(Names[i], ' ', Count[i]);
end.
Объяснение: