1) 10000101(двоичная), 205(Восьмеричная), 85(шестнадцатеричная). 2)504(Десятеричная) 1 * 2^9 + 1 * 2^8 + 1 * 2^7 + ... + 1 * 2^4 + 0 + 0 + 0 3)770(Восьмеричная), 1F8(Шестнадцатеричная) 4)400(Десятичная) 5)510(десятичная) 6)42F(Шестнадцатеричная) 7)162464(Восьмеричная)
Удачи)
1.
var a:array [1..4, 1..4] of integer; i, j, max: integer;
Begin
for i := 1 to 4 do
begin
for j := 1 to 4 do
read(a[i][j]);
readln;
end;
max := a[1][1];
for i := 2 to 4 do
if max < a[i][i] then max := a[i][i];
writeln(max);
End.
2.
var a:array [1..5, 1..5] of integer; i, j, m, sum: integer;
Begin
for i := 1 to 5 do
begin
for j := 1 to 5 do
read(a[i][j]);
readln;
end;
readln(m);
sum := 0;
for i := 1 to 5 do
if (m - i > 0) and (m - i < 6) then
sum := sum + a[i][m - i];
writeln(sum);
End.
3.
Const N = 5;
var a:array [1..N, 1..N] of integer; i, j, max: integer;
Begin
for i := 1 to N do
begin
for j := 1 to N do
read(a[i][j]);
readln;
end;
max := a[1][N];
for i := 2 to N do
if (max < a[i][N + 1 - i]) then
max := a[i][N + 1 - i];
writeln(max);
End.
4.
Const N = 5;
var a:array [1..N, 1..N] of integer; i, j, count: integer; sum: real;
Begin
for i := 1 to N do
begin
for j := 1 to N do
read(a[i][j]);
readln;
end;
sum := 0;
count := 0;
for i := 1 to N do
if (a[5][i] mod 2 = 1) then
begin
sum := sum + a[5][i];
inc(count);
end;
sum := sum / count;
writeln(sum);
End.
5.
var a:array [1..4, 1..4] of integer; i, j, upper_sum, lower_sum: integer;
Begin
for i := 1 to 4 do
begin
for j := 1 to 4 do
read(a[i][j]);
readln;
end;
upper_sum := 0;
lower_sum := 0;
for i := 1 to 4 do
begin
for j := i + 1 to 4 do
upper_sum := upper_sum + a[i][j];
for j := 1 to i - 1 do
lower_sum := lower_sum + a[i][j];
end;
writeln(upper_sum);
writeln(lower_sum);
End.
Var
n,i,j,c:integer;
mas:array[1..999] of integer;
begin
readln(n);
for i:=1 to 2*n do
readln(mas[i]);
//Группируем массив в порядке возрастания
for i := 1 to 2*n-1 do<span>
for j := 1 to 2*n-i do
if mas[j] > mas[j+1] then
begin
c := mas[j];
mas[j] := mas[j+1];
mas[j+1] := c;
end;
writeln('Оптимальные пары:');
for i:=1 to 2*n do
begin
if i mod 2 = 1 then
write(mas[i],' и ');
if i mod 2 = 0 then
writeln(mas[i]);
end;
</span>end.
