Const
n = 10;
m = 10;
type
Matrix = array[1..n, 1..m] of integer;
procedure EnterMas(var Mas: Matrix);
var i, j: integer;
begin
randomize;
for i := 1 to n do
for j := 1 to m do
Mas[i, j] := random(100);
end;
procedure GiveMas(var Mas: Matrix);
var i, j: integer;
begin
for i := 1 to n do
begin
for j := 1 to m do
begin
write(Mas[i, j], ' ');
end;
writeln;
end;
end;
function SumStroki(Mas: Matrix; i, k: integer): integer;
var
j, sum: integer;
begin
sum := 0;
for j := 1 to m do
Sum := Sum + Mas[i, j];
SumStroki := sum - k;
end;
function Element(var Mas: Matrix): integer;
var
i, j, count: integer;
begin
count := 0;
for i := 1 to n do
for j := 1 to m do
if Mas[i, j] > SumStroki(Mas, i, Mas[i, j]) then inc(count);
Element := count;
end;
var Mas: Matrix;
Sum, Max: integer;
begin
EnterMas(Mas);
GiveMas(Mas);
writeln('Кол-во особых элементов ', Element(Mas));
end.
Решение смотри во вложенном файле .xlsx.
Const n=10;
Var a:array[1..n] of integer;
i,k,j:integer;
Begin
Randomize;
For i:=1 to n do
Begin
A[i]:=Random(10);
Write(a[i],' ');
end;
Writeln;
For i:=1 to n do
Begin
If a[i] mod 3=0 then
Write(a[i],' ');
end;
for i:=1 to n-1 do
for j:=1 to n-i do
begin
if (a[j] > a[j+1]) then
begin
k:= a[j];
a[j] := a[j+1];
a[j+1] := k;
end;
end;
writeln;
for i:=1 to n do
write(a[i],' ');
readln;
<span> end.</span>
<em>// PascalABC.NET 3.2</em>
begin
var a:array[1..9] of integer;
var i:=1;
while i<=7 do begin
a[i]:=i*i+5;
a[i+1]:=Trunc(sqrt(a[i]));
a[i+2]:=a[i] div a[i+1];
i:=i+3
end;
for var j:=1 to 9 do Write(a[j],' ');
Writeln
end.
<u>Результат</u>
6 2 3 21 4 5 54 7 7