110010 = 32 + 16 + 2 = 50
1100 = 12
50 + 12 = 62 (всего тетрадей).
200 - <span>11001000</span>
489 - <span>111101001</span>
543 - <span>1000011111</span>
950 - <span>1110110110</span>
1025 - <span>10000000001</span>
{вот правильное решение я там забыл то чтобы подсчитывать число букв 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>
program crash;
var n, k: integer;
r: real;
begin
write('n = ');
readln(n);
k := 0;
r := 0;
while n > 0 do
begin
k := k + 1;
r := r + (n mod 10) / (k * k);
n := n div 10
end;
writeln('r = ', r:0:14);
readln
end.