2. Популярное до сих пор в школах решение на TurboPascal 7.01 (1983г.)
uses Crt; const nn=100; var i,n,min:integer; a:array[1..nn] of integer; begin ClrScr; Randomize; Write('n='); Read(n); min:=100; for i:=1 to n do begin a[i]:=Random(101)-50; Write(a[i],' '); if a[i]<min then min:=a[i] end; Writeln; for i:=1 to n do if a[i]<0 then a[i]:=a[i]*min; for i:=1 to n do Write(a[i],' '); Writeln; ReadKey end.
a: array of integer = (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -555);
begin
foreach s: integer in a do
if (s mod 2 = 0) and (s > 0) then
write(s, ' ');
end.