Quipex

4.15

Apr 7th, 2016
121
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Pascal 0.71 KB | None | 0 0
  1. //Задание 4.15 Кучеренко
  2. const m = 4;
  3.  
  4. Begin
  5.  
  6.   var
  7.     n: integer;
  8.   var
  9.     T: array[0..100,0..100] of integer;
  10.   write('Vvedite n: ');
  11.   readln(n);
  12.  
  13.   writeln('Vvedite dannie v massive T(', m, ',', n, '):');
  14.   var i, j: integer;
  15.   for i := 0 to m-1 do
  16.   begin
  17.     for j := 0 to n-2 do
  18.       read(T[i][j]);
  19.     readln(T[i][n-1]);
  20.   end;
  21.  
  22.   var max: integer;
  23.   if m > n then
  24.     max := m
  25.   else max := n;
  26.  
  27.  
  28.   var maxPositive: integer;
  29.   maxPositive := 0;
  30.   for i := 0 to max do
  31.     if T[i][i] > 0 then
  32.       if T[i][i] > maxPositive then
  33.         maxPositive := T[i][i];
  34.        
  35.   writeln('Naibolshij polozhitelnij element glavnoj diagonali = ', maxPositive);
  36.  
  37. end.
Advertisement