Program gt; var n,q,a1,a2,a3,a4,a5,a6,a7,a8,a9,a0:integer; begin read(n); a0:=0;a1:=0; a2:=0;a3:=0; a4:=0;a5:=0; a6:=0;a7:=0; a8:=0;a9:=0; while n>0 do begin q:=n mod 10; n:=n div 10; if(q=0)then a0:=a0+1; if(q=1)then a1:=a1+1; *********************** *********************** if(q=9)then a9:=a9+1; end; if(a0>1)or(a1>1)or....(a9>1)then writeln('yes')else writeln('no'); end. буз массива как-то так получиться
{вот правильное решение я там забыл то чтобы подсчитывать число букв 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>.