Автор: asdfg

asdfg — Mon, 24 Feb 2020 15:49:49 +0000

тот же вариант,но без функции (она там на самом деле не нужна):

program Matrix75;

var
  m, n, i, j: integer;
  a, a1: array [1..10, 1..10] of real;

begin
  read(m, n);
  for i := 1 to m do
    for j := 1 to n do read(a[i, j]);
  
  for i := 1 to m do
    for j := 1 to n do 
      if ((i = 1) or (a[i, j] > a[i - 1, j])) and
         ((j = 1) or (a[i, j] > a[i, j - 1])) and
         ((i = m) or (a[i, j] > a[i + 1, j])) and
         ((j = n) or (a[i, j] > a[i, j + 1])) and
         ((j = n) or (i = m) or (a[i, j] > a[i + 1, j + 1])) and
         ((j = 1) or (i = m) or (a[i, j] > a[i + 1, j - 1])) and
         ((j = n) or (i = 1) or (a[i, j] > a[i - 1, j + 1])) and
   ((j = 1) or (i = 1) or (a[i, j] > a[i - 1, j - 1]))
        then
        a1[i, j] := 999;
  for i := 1 to m do
    for j := 1 to n do if a1[i, j] = 999 then a1[i, j] := -1 * a[i, j] else a1[i, j] := a[i, j];
  
  for i := 1 to m do
  begin
    writeln;
    for j := 1 to n do print(a1[i, j]);
  end;
end.

program Matrix75;

var

m, n, i, j: integer;

a, a1: array [1..10, 1..10] of real;

begin

read(m, n);

for i := 1 to m do

for j := 1 to n do read(a[i, j]);

for i := 1 to m do

for j := 1 to n do

if ((i = 1) or (a[i, j] > a[i - 1, j])) and

((j = 1) or (a[i, j] > a[i, j - 1])) and

((i = m) or (a[i, j] > a[i + 1, j])) and

((j = n) or (a[i, j] > a[i, j + 1])) and

((j = n) or (i = m) or (a[i, j] > a[i + 1, j + 1])) and

((j = 1) or (i = m) or (a[i, j] > a[i + 1, j - 1])) and

((j = n) or (i = 1) or (a[i, j] > a[i - 1, j + 1])) and

((j = 1) or (i = 1) or (a[i, j] > a[i - 1, j - 1]))

then

a1[i, j] := 999;

for i := 1 to m do

for j := 1 to n do if a1[i, j] = 999 then a1[i, j] := -1 * a[i, j] else a1[i, j] := a[i, j];

for i := 1 to m do

begin

writeln;

for j := 1 to n do print(a1[i, j]);

end;

end.

Автор: asdfg

asdfg — Sun, 23 Feb 2020 17:56:58 +0000

program Matrix75;
type Matrix = array [1..10,1..10] of real;
var
m,n,i,j:integer;
a,a1:Matrix;
function F(a:Matrix; i,j:integer): boolean;
begin
F:= false;
if ((i=1) or (a[i,j]>a[i-1,j])) and
((j=1) or(a[i,j]>a[i,j-1])) and
((i=m) or (a[i,j]>a[i+1,j])) and
((j=n) or(a[i,j]>a[i,j+1])) and
((j=n) or (i=m) or (a[i,j]>a[i+1,j+1])) and
((j=1) or (i=m) or (a[i,j]>a[i+1,j-1])) and
((j=n) or (i=1) or (a[i,j]>a[i-1,j+1])) and
((j=1) or (i=1) or (a[i,j]>a[i-1,j-1])) 
 then F:=true;
end;
begin
read (m,n);
  for i:=1 to m do
  for j:=1 to n do read (a[i,j]);
  
   for i:=1 to m do//доп.блок для того чтобы не менять числа в исходном наборе
   for j:=1 to n do if F (a,i,j) then a1[i,j]:=999;//помечаем число,а не изменяем сразу,т.к
                                                   //оно еще участвует в сравнениях
   
   for i:=1 to m do
   for j:=1 to n do if a1[i,j]=999 then a1[i,j]:=-1*a[i,j] else a1[i,j]:=a[i,j];
   
   for i:=1 to m do begin
   writeln;
   for j:=1 to n do print (a1[i,j]);
   end;
end.

program Matrix75;

type Matrix = array [1..10,1..10] of real;

var

m,n,i,j:integer;

a,a1:Matrix;

function F(a:Matrix; i,j:integer): boolean;

begin

F:= false;

if ((i=1) or (a[i,j]>a[i-1,j])) and

((j=1) or(a[i,j]>a[i,j-1])) and

((i=m) or (a[i,j]>a[i+1,j])) and

((j=n) or(a[i,j]>a[i,j+1])) and

((j=n) or (i=m) or (a[i,j]>a[i+1,j+1])) and

((j=1) or (i=m) or (a[i,j]>a[i+1,j-1])) and

((j=n) or (i=1) or (a[i,j]>a[i-1,j+1])) and

((j=1) or (i=1) or (a[i,j]>a[i-1,j-1]))

then F:=true;

end;

begin

read (m,n);

for i:=1 to m do

for j:=1 to n do read (a[i,j]);

for i:=1 to m do//доп.блок для того чтобы не менять числа в исходном наборе

for j:=1 to n do if F (a,i,j) then a1[i,j]:=999;//помечаем число,а не изменяем сразу,т.к

//оно еще участвует в сравнениях

for i:=1 to m do

for j:=1 to n do if a1[i,j]=999 then a1[i,j]:=-1*a[i,j] else a1[i,j]:=a[i,j];

for i:=1 to m do begin

writeln;

for j:=1 to n do print (a1[i,j]);

end;

end.

Комментарии: Решаем задачи Абрамян на Паскале. Matrix75

Автор: asdfg

Автор: asdfg