program _611A;
uses crt;
type
TArr = array[1..50] of integer;
var
A : TArr;
n : byte;
procedure FillArray(var x : TArr; size : byte);
var
i : byte;
begin
for i := 1 to size do begin
write('x[',i,']=');
readln(x[i]);
end;
writeln;
end;
function IsIncluds(x : TArr; size : byte) : boolean;
var
i,j,k : integer;
include : boolean;
begin
include := true;
i := 1;
while (i<=n-3)and(include) do begin
include := false;
j := x[i];
while (j<=x[i+1]) and not(include) do begin
k := x[i+2];
while (k<=x[i+3]) and not(include) do
if j=k then inc(include)
else inc(k);
inc(j);
end;
inc(i,2);
end;
IsIncluds := include;
end;
begin
clrscr;
repeat
write('n='); readln(n);
if odd(n) then begin
writeln('N doljno bit" chetnim !');
delay(2000);
clrscr;
end;
until not(odd(n));
FillArray(A, n);
writeln(IsIncluds(A, n));
readln;
end.
Задача на массив. |