Program Zeidel;
uses crt;
const n=2;
var f,x,w: array [1..n] of real;
eps,d,e,g:real;
i,k,m,fin,mis: integer;
procedure snur;
begin
f[1]:= ln(x[1]+4);
f[2]:= x[2]*x[2]+3*x[1]-4;
end;
begin
clrscr;
write ('Vvedite pervonachalnuju pogreshnost ');
readln(eps);
clrscr;
writeln('Vvedite pervonachalnoe priblijenie ');
for i:=1 to n do begin
write ('x[',i,']='); readln (x[i]);
end;
k:=0; d:=0.5; fin:=1; mis:=1;
repeat
inc(k);
d:=-d;
gotoxy(4,60);
writeln(k,' - e priblijenie');
e:=0;
for i:=1 to n do begin
snur;
x[i]:=x[i]+f[i];
end;
for i:=1 to n do e:=e+f[i]*f[i];
e:=sqrt(e);
g:=e;
w[round(1.5+d)]:=e;
gotoxy(5,60);
write('Tekuschaja nevjazka ');
writeln(g:3:3);
delay(100);
if (w[round(1.5-d)]-w[round(1.5+d)]<0) and (k<9)
then begin
mis:=0;
fin:=0;
end;
if e>eps then
for i:=1 to n do x[i]:=x[i]+f[i]
else begin
fin:=0;
for i:=1 to n do x[i]:=x[i]+eps;
end;
clrscr;
gotoxy(1,1);
for i:=1 to n do writeln ('x[',i,']=',x[i]:3:2);
until (fin=0) or (k>1000);
if mis=1 then begin
writeln ('Okonchatelnii otvet: ');
writeln('Tochnost udovletvoritelnaja');
end
else writeln('Process rashoditsja');
readkey;
end.