Для целочисленной квадратной матрицы найти элементы, кратные К

program Project1;
 
{$APPTYPE CONSOLE}
 
uses
  SysUtils;
  const n=10;
  var i,j,sum,sum1:integer;
  mas:array[1..n, 1..n] of integer;
begin
  { TODO -oUser -cConsole Main : Insert code here }
 
  Randomize;
  For i:=1 to n do
  For j:=1 to n do
  mas[i,j]:=Random(100)-50;
 
 
  For i:=1 to n do
  begin
    For j:=1 to n do
    begin
    Write(mas[i,j]);
    Write(' ');
    end;
  Writeln;
  Writeln;
  end;
 
 
For j:=1 to 10 do
begin
For i:=1 to n do
sum:=sum+mas[i,j];
For i:=1 to n do
If mas[i,j]>sum then
sum1:=sum1+mas[i,j];
end;
 
Writeln;
Write(sum1);
Readln;
 
end.

program Project1;
 
{$APPTYPE CONSOLE}
 
uses
  SysUtils;
  const n=10;
  var i,j,k,kr,ni,nj:integer;
  mas:array[1..n, 1..n] of integer;
begin
  { TODO -oUser -cConsole Main : Insert code here }
 
  Write('BBeguTe K.');
  Writeln;
  Write('K=');
  Readln(k);
 
  Randomize;
  For i:=1 to n do
  For j:=1 to n do
  mas[i,j]:=Random(100)-50;
 
  Write('Ha4aJlbHa9 MaTpuLLa:');
  Writeln;
  Writeln;
  For i:=1 to n do
  begin
    For j:=1 to n do
    begin
    Write(mas[i,j]);
    Write(' ');
    end;
  Writeln;
  Writeln;
  end;
 
  Write('4ucJla kpaTHbIe 4ucJly K:');
  Writeln;
  Writeln;
 
  For i:=1 to n do
  For j:=1 to n do
  If k mod mas[i,j]=0 then
  begin
  Write(mas[i,j]);
  Write(' ');
    If mas[i,j]>kr then
    begin
    kr:=mas[i,j];
    ni:=i;
    nj:=j;
    end;
  end;
    Writeln;
    Writeln;
 
    mas[ni,nj]:=mas[10,1];
    mas[10,1]:=kr;
 
   Write('HoBa9 MaTpuLLa:');
   Writeln;
   Writeln;
   For i:=1 to n do
   begin
      For j:=1 to n do
      begin
      Write(mas[i,j]);
      Write(' ');
      end;
    Writeln;
    Writeln;
    end;
Readln;
 
end.

program Project1;
 
{$APPTYPE CONSOLE}