VAR i, j, k: Integer; a, b: Array [1..5] of Array [1..5] of Integer; BEGIN For i := 1 to 5 do For j := 1 to 5 do Read(a[i][j]);
k := 1; For i := 1 to 5 do If (Odd(i)) then For j := 5 downto 1 do begin b[i][j] := a[((k-1) div 5)+1][((k-1) mod 5)+1]; Inc(k); End Else For j := 1 to 5 do begin b[i][j] := a[((k-1) div 5)+1][((k-1) mod 5)+1]; Inc(k); End;
For i := 1 to 5 do begin For j := 1 to 5 do Write(b[i][j]:2, ' '); Writeln; End; END.
VAR mx, ind: Integer; n, m, i, j: Integer; b: Array of Integer; a: Array of Array of Integer; BEGIN Read(n); SetLength(a, n+1); For i := 1 to n do SetLength(a[i], n+1);
For i := 1 to n do For j := 1 to n do Read(a[i][j]);
SetLength(b, n+1); For i := 1 to n do b[i] := a[i][i];
mx := b[1]; ind := 1; For i := 2 to n do If (mx < b[i]) then begin mx := b[i]; ind := i; End;
Write('Макс. элемент гл. диагонали - B[',ind,'] = ', mx); END.
Или намного проще (если нужен только ответ): VAR mx, ind, el: Integer; n, m, i, j: Integer; BEGIN Read(n);
// Присваем макс. элементу самое минимальное число, // которое точно не встретится в массиве mx := -999999999;
For i := 1 to n do For j := 1 to n do begin Read(el); If (i <> j) then Continue; If (mx < el) then begin mx := el; ind := i; End; End;
Write('Макс. элемент гл. диагонали - B[',ind,'] = ', mx); END.
