Теория алгоритмов.

[Fantalia]

E7cM5kqbs8A.jpg

[Dvoishnik]

2 задание

sum:=0;
for i:=n downto 1 do 
  Begin 
   if Mas[i] = 0 then break;
   sum:=sum+Mas[i];
  end;

задание 3

For i:=1 to n do
 Begin
 sum:=0;
  For j:=1 to m do 
    if mas[i,j] <0 then 
      begin
       sum:=-1;
       break;
      end 
        else sum:=sum+mas[i,j];
  if sum =-1 then 
    writeln('в строке ',i,' есть отрицательные элементы') 
      else Writeln('сумма элементов строи ',i,' равна',sum) 
end;

[CMY_3]

uses
  crt;
var
  x_beg, x_end, x_delta, eps, s, p : real;
  n : integer;
begin
  clrscr;
  write('eps = '); readln(eps);
  write('x_beg = '); readln(x_beg);
  write('x_end = '); readln(x_end);
  write('x_delta = ');readln(x_delta);
  writeln('--------|---------|----');
  writeln('   x    |arcctg(x)| n  ');
  writeln('--------|---------|----');
  while x_beg<=x_end do begin
    s := -x_beg; p := -x_beg; n := 0;
    while abs(p)>=eps do begin
     p := p * (-sqr(x_beg)*(2*n+1)/(2*n+3));
     s := s + p;
     inc(n);
    end;
    s := pi/2 + s;
    writeln(x_beg:7:5,' | ',s:7:5,' | ',n-1);
    writeln('--------|---------|----');
    x_beg := x_beg + x_delta;
  end;
  readln;
end.