После всех вычислении получается ответ 4
{вот правильное решение я там забыл то чтобы подсчитывать число букв a}
<span>var </span><span><span> s</span>: string;</span><span><span>
i</span>, id, len, max, count,q: byte;</span>
begin
<span>
q:=0;
readln(s);</span><span><span>
len </span>:= length(s);</span><span><span>
max </span>:= 0;</span><span><span>
id </span>:= 0;</span>
<span><span> count </span>:= 0;</span><span>
for i:=1 to len do </span><span>
if s[i] <> ' ' then</span><span><span> count </span>:= count + 1</span><span>
else begin</span><span>
if count > max then begin</span><span><span>
max
</span>:= count;</span><span><span>
id </span>:= i - count;</span><span>
end;</span><span><span>
count </span>:= 0</span><span>
end;</span>
<span>
if count > max then begin </span><span><span>
max </span>:= count;</span><span><span>
id </span>:= i - count;</span><span>
end<span>;
</span></span>
<span> for i:=id to id+max do</span><span>
if s[i] = 'a' then begin</span><span><span> q:=q+1; s</span>[i] := 'b';</span>
<span>
writeln(s,' ' , q);</span>
end;
<span>end<span>.
</span></span>
перекодирование<span> — Повторное кодирование в другом коде.</span>
Program asd;
Const n=30;
var M:array[1..n] of integer;
i,k,s:integer;
BEGIN
Writeln('Заполните массив: ');
For i:=1 to n do
begin
Readln(M[i]);
end;
s:=0;
For i:=1 to n do
begin
If (M[i] mod 2=0) then
begin
inc(k);
s:=s+M[i];
end;
If (s mod 2=2) and (k mod 2=0) then
Writeln('Верно.')
else Writeln('Не верно');
end;
<span>END.</span>