Что определяет для массива x[1..n] следующий алгоритм r: = 0; for k: = 1 to n do if x[k]

Количество элементов массива, меньших T
ответ: 5

ответ: 32

(1+2+2+2+2+2)*2+2
(1+2+2+2+2)*2+2+2+2
(1+2+2+2)*2+2+2+2+2+2
(1+2+2)*2+2+2+2+2+2+2+2
((1+2+2)*2+2)*2
((1+2+2)*2)*2+2+2
(1+2)*2+2+2+2+2+2+2+2+2+2
((1+2)*2+2+2+2)*2
((1+2)*2+2+2)*2+2+2
((1+2)*2+2)*2+2+2+2+2
((1+2)*2)*2+2+2+2+2+2+2
(((1+2)*2)*2)*2
(1)*2+2+2+2+2+2+2+2+2+2+2+2
((1)*2+2+2+2+2+2)*2
((1)*2+2+2+2+2)*2+2+2
((1)*2+2+2+2)*2+2+2+2+2
((1)*2+2+2)*2+2+2+2+2+2+2
(((1)*2+2+2)*2)*2
((1)*2+2)*2+2+2+2+2+2+2+2+2
(((1)*2+2)*2+2+2)*2
(((1)*2+2)*2+2)*2+2+2
(((1)*2+2)*2)*2+2+2+2+2
((1)*2)*2+2+2+2+2+2+2+2+2+2+2
(((1)*2)*2+2+2+2+2)*2
(((1)*2)*2+2+2+2)*2+2+2
(((1)*2)*2+2+2)*2+2+2+2+2
(((1)*2)*2+2)*2+2+2+2+2+2+2
1)*2)*2+2)*2)*2
(((1)*2)*2)*2+2+2+2+2+2+2+2+2
1)*2)*2)*2+2+2)*2
1)*2)*2)*2+2)*2+2+2
1)*2)*2)*2)*2+2+2+2+2

Var N : Integer;

Procedure GoGo(a : Integer; s : String);
Begin
  If a<=24 then
    If a=24 then
    Begin
      Inc(N);
      Writeln(s);
    end
      else
      Begin
        GoGo(a+2,s+'+2');
        GoGo(a*2,'('+s+')*2');
      end;
end;

Begin
  N:=0;
  GoGo(1,'1');
  Writeln('N = ',N);
end.

1)
Program graph1;
uses graph;
var  gd,gm,error,a,b: integer;   x,y:real;
begin
gd:=detect;
initgraph(gd,gm,'');
error:=graphresult;
if error <> grOk then begin
write ('Ошибка: ', grapherrormsg(error));
readln; halt;
end;
while(x<=100) do begin
y:=cos(x*x);
a:=round(x*100);
b:=round(y*100);
PutPixel(a,b+300,15);
x:=x+0.001;
end;

readln;
closegraph;
end.

closegraph;
end.
2)
Program graph1;
uses graph;
var  gd,gm,error,a,b: integer;   x,y:real;
begin
gd:=detect;
initgraph(gd,gm,'');
error:=graphresult;
if error <> grOk then begin
write ('Ошибка: ', grapherrormsg(error));
readln; halt;
end;
while(x<=100) do begin
y:=1/(x*x+1);
a:=round(x*100);
b:=round(y*100);
PutPixel(a,b+300,15);
x:=x+0.001;
end;

readln;
closegraph;
end.