1
Program p3_243;
uses crt;
function Factorial(n: word): LongInt;
begin
if n=0 then Factorial := 1 else Factorial := n*Factorial(n-1);
end;
function f(x:real; n: integer):real;
begin
f:= exp((n+1)*ln(-1)) * (exp((2*n-1)*ln(x))/Factorial(2*n+1));
end;
const eps = 0.0001;
Var
b,x,Sum,an:real;
n:word;
Begin
n:=0;
a:=1;
b:=2;
Sum := 0.0;
repeat
inc(n);
an := f(a);
Sum := Sum+an;
until abs(an)<eps;
writeLn(' Sum=',Sum);
readLn;
end.
2
Program P3_3;
uses crt;
const b = 2; eps = 0,000035;
var x,xk: real;
Begin
a:=-1;
i:=1;
repeat
xk := a;
x := 0.2 * tan(3.8 * xk);
if (x - xk <= eps) and (x<=b) and (i mod 3 = 0) then
writeln((i/3):2 :0,' корень = ',x:7 :3);
a:=x;
inc(i);
until (x - xk > exp) or (x>b);
i:=i-1;
writeln('Количество итераций = ',i);
readln;
end.
3
Program P3_123;
Uses Crt;
Var a, b, e, fa, fc, c: Real;
Begin ClrScr;
e : = 0.00005;
a := 0.4; b:=1;
fa : = 1.3*a + sqrt(a) +exp(3/2 *ln(x)) -2.46 ;
While Abs (a – b) > e do
Begin c : = (a + b)/2;
fc : = 1.3*c + sqrt(c) +exp(3/2 *ln(x)) -2.46 ;
If fc * fa < 0 Then b : = c
Else Begin a : = c; fa : = fc; end;
end;
Writeln (‘Корень уравнения равен ’, a : 6 : 3);
Readkey;
End
4
Program p4_132;
uses crt;
const m =8;
var EV: array[1..m, 1..m] of integer; i,j,min:integer; min_array: array[1..m] of integer;
Begin
for i:=1 to m do
for j:=1 to m do begin
write('Введите EV[',i,',',j,']: ');
readln(ev[i,j]);
end;
for i:=1 to m do begin
min:=0;
for j:=1 to m do
if (i<=j) then
if (ev[i,j] < min) then
min = ev[i,j];
min_array[i]:=min;
end;
for i:=1 to m do
Writeln('Min[',i,'] = ',min_array[i]);
end.
5
Program P4_43;
uses crt;
const m = 4; n = 2;
var b: array[1..m, 1..n] of integer; i,j, max,maxi,maxj:integer; flag : boolean;
Begin
For i:=1 to m do
For j:=1 to n do begin
write('Введите B[,'i,',',j,']: ');
readln(b[i,j]);
if (b[i,j]<0) then max = b[i,j];
end;
for i:=1 to m do
for j:=1 to n do
if (b[i,j]<0) and (b[i,j]>max) then begin
max := b[i,j];
maxi:=i;
maxj:=j;
end;
Writeln('Ответ: B[',maxi,',',maxj,] = ',max);
end.
6
Program P;
uses crt;
const m = 2; n = 3;
var b: array[m..n] of integer; i,j, max:integer;
Begin
For i:=1 to m do
For j:=1 to n do begin
write('Введите B[,'i,',',j,']: ');
readln(b[i,j]);
end;
max := b[1,1];
for i:=1 to m do
for j:=1 to n do
if (b[i,j]>max) then
max := b[i,j];
Writeln('Ответ: ',max);
end.
Пожалуйсто хоть к какой-то из них напишите алгоритм. Спасибо ...)
)))
