lab12 Unit

unit Unit1;

interface

const
Nmax = 5;
Mmax = 5;
type
matr = array[1..Nmax, 1..Mmax] of integer;
str = array[1..Mmax] of integer;

procedure input(var f:TextFile; const n, m: byte; var A:matr; var X:str);
procedure output(var g: TextFile; const n, m: byte; const X: str; var A: matr);
procedure provA(const n, m: byte; const A: matr; var flagA: boolean; var ii, jj: byte);
procedure provX(const m: byte; const X: str; var flagX: boolean; var ii: byte);
procedure proverka(const n, m: byte; const A: matr; var flag: boolean);
procedure sum(const n, m: byte; var A: matr; var X: str);
implementation
 procedure input(var f: TextFile; const n, m: byte; var A: matr; var X: str);
var
i, j: integer;
begin
  for i := 1 to n do
   begin
    for j := 1 to m do
    read(f,A[i, j]);
    readln(f);
    end;
   readln(f);
   for j := 1 to m do
  read(f,X[j]);
  end;
  procedure output(var g: TextFile; const n, m: byte; const X: str; var A: matr);
  var
i, j: integer;
begin
 for i := 1 to n do
   begin
   for j := 1 to m do
   write(g,A[i, j]:5);
   writeln(g,' ');
    end;
   writeln(g,'Заданные элементы X');
   for j := 1 to m do
  write(g, X[j]);
end;
procedure provA(const n, m: byte; const A: matr; var flagA: boolean; var ii, jj: byte);

var

i, j: byte;

begin
flagA := False;
i := 1;
while (i <=n) and not flagA do
    begin
      j := 1;
     while (j <= m) and not flagA do
      begin
      if (abs(A[i, j]) > 10) then
     begin
      ii := i; jj := j; flagA := True;
    end;
    inc(j);
    end;
   inc(i);
   end;
end;
procedure provX(const m: byte; const X:str; var flagX: boolean; var ii: byte);
var
i: byte;
begin
  flagX := False;
  i := 1;
   while (i <=m) and not flagX do
   begin
   if (abs(X[i]) > 10) then
   begin
    ii := i; flagX := True;
   end;
  inc(i);
  end;
end;
 procedure proverka(const n, m: byte; const A: matr; var flag: boolean);
var
i, j: byte;
s1, s2: integer;
begin
flag := false;
 s1 := 0; s2 := 0;
 for i := 1 to 2 do
   begin
   for j := 1 to m do
    s1 := s1 + A[i, j];
   end;
   for i := n downto n - 1 do
   begin
    for j := 1 to m do
   s2 := s2 + A[i, j];
   end;
   if s1 < s2 then flag := true;
 end;
 procedure sum(const n, m: byte; var A: matr; var X: str);
var
i, j: byte;
begin
 for i := 1 to n do
  for j := 1 to m do
  A[i, j] := A[i, j] + X[j];
end;
end.