Лпнрэяуёс, нпокупс, лмбгкбуфсб, локдб, вфнбдб, рбрксфт, рскоуёс, уёусбеэ, сбекп, бмхбгку, вфлгб, иобл.
1)program
obnulenie;
var
a:array[1..100,1..100] of longint;
n,i,j,m,k,o:longint;
begin
read(n,m);
{}for i:=1 to
n do
for j:=1 to
m do
read(a[i,j]);
for i:=1 to
n do
for j:=1 to
m do
if a[i,j]=0
then for o:=1 to
m do a[i,o]:=0;
for i:=1 to
n do
begin
for j:=1 to
m do
write(a[i,j],'
');
writeln;
end;
end.
2)
<span>program obnulenie;
var a:array[1..100,1..100] of longint;
n,i,j,m,k:longint;
begin
read(n,m); {}
for i:=1 to n do
for j:=1 to m do
read(a[i,j]);</span><span>for i:=1 to n do
begin
for j:=1 to m do
if a[i,j]=0 then begin
for k:=1 to m do
a[i,k]:=0;
end;
end;</span><span>for i:=1 to n do
begin
for j:=1 to m do
write(a[i,j],' ');</span>writeln;<span>end;
end.</span> 3)<span>program zamena;
var a:array[1..100,1..100] of longint;
n,i,j,m,k,vr1,x1,x2,y1,y2,max,min:longint;
begin
read(n,m); {}
for i:=1 to n do
for j:=1 to m do
read(a[i,j]);
max:=-999999;
min:=999999;
for i:=1 to n do
begin
for j:=1 to m do
begin
if max<a[i,j] then begin max:=a[i,j];x1:=i; y1:=j end;
if min>a[i,j] then begin min:=a[i,j];x2:=i; y2:=j end;
end;
end;</span><span>vr1:=a[x1-1,y1];
a[x1-1,y1]:=a[x1,y1];
a[x1,y1]:=vr1;</span><span>vr1:=a[x2-1,y2];
a[x2-1,y2]:=a[x2,y2];
a[x2,y2]:=vr1;</span><span /><span>
for i:=1 to n do
begin
for j:=1 to m do
write(a[i,j]);
writeln;
end;
end.</span>
#include <iostream>
using namespace std;
int main()
{
int t;
long double n, s = 0, k = 1;
cin >> n >> t;
cout.precision(t);
while (k <= n)
{
s += 1 / (k * (k + 1));
k++;
}
cout << "Количество просуммированных элементов : " << n << endl;
cout << "Сумма : " << s << endl;
cout << "Разность суммы и 1 : " << (1 - s);
return 0;
}