Ответ:
const g = 5; v = 7;
var a: array[1..g,1..v] of integer;
i,j,maxj,minj,p:integer;
begin
writeln('Массив: ');
for i:=1 to g do
begin
for j:=1 to v do
begin
a[i,j]:=random(90)+10;
write(a[i,j]:4)
end;
writeln
end;
for i:=1 to g do
begin
maxj:=1;
minj:=1;
for j:=1 to v do
begin
if a[i,j]>a[i,maxj] then maxj:=j;
if a[i,j]<a[i,minj]then minj:=j;
end;
p:=a[i,maxj];
a[i,maxj]:=a[i,minj];
a[i,minj]:=p;
end;
writeln;
writeln('Преобразованный массив: ');
for i:=1 to g do
begin
for j:=1 to v do write(a[i,j]:4);
writeln
end;
end.
Объяснение:
Первые два вчера писал: znanija.com/task/1944982
В третьем не уверен в самом алгоритме...
var
a, b, x, y, z : real;
begin
read (a, b, c, x, y);
if ((a <= x) and (b <= y)) or ((a <= y) and (b <= x))
or ((a <= x) and (b <= z)) or ((a <= z) and (b <= x))
or ((a <= z) and (b <= y)) or ((a <= y) and (b <= z)) then writeln ('YES') else writeln ('NO');
end.
Const
n = 10;
var
i, j: integer;
a: array[1..n, 1..n] of integer;
begin
for i := 1 to n do
for j := 1 to n do
if i = j then a[i, i] := n - i + 1
else a[i, j] := 0;
writeln;
for i := 1 to n do
begin
for j := 1 to n do write(a[i, j]:4);
writeln
end
end.
10 0 0 0 0 0 0 0 0 0
0 9 0 0 0 0 0 0 0 0
0 0 8 0 0 0 0 0 0 0
0 0 0 7 0 0 0 0 0 0
0 0 0 0 6 0 0 0 0 0
0 0 0 0 0 5 0 0 0 0
0 0 0 0 0 0 4 0 0 0
0 0 0 0 0 0 0 3 0 0
0 0 0 0 0 0 0 0 2 0
0 0 0 0 0 0 0 0 0 1