Function prime(x:integer):boolean; var t:boolean; d:integer; begin t := true; d := 2; while t and (d*d <= x) do begin if x mod d = 0 then t := false; d := d + 1 end; prime := t end;
function order(x:integer):boolean; var t:boolean; d:integer; begin d := -1; repeat t := x mod 10 > d; d := x mod 10; x := x div 10 until not t or (x = 0); order := t end;
var t:boolean; i,k,n:integer; begin t := false; read(k,n); for i := k to n do if prime(i) then if order(i) then begin write(i,' '); t := true end; if not t then write(0) end.
Код: 1) program Mas; var i,ne,ch,n:integer; a:array [1..1000] of integer; begin read(n); randomize; for i:=1 to n do begin a[i]:=random(80)+21;write(a[i],' ');//Распечатка массива, увидешь правильно ли программа выполняет функци end; for i:=1 to n do begin if a[i] mod 2=0 then ch:=ch+1 else ne:=ne+1; end;writeln; writeln('Нечетные=',Ne); writeln('Четные=',Ch); end. 2)const n = 10; var A: array [ 1 .. n ] of integer; i, znachenie, count: integer; sred_arifm, sum: real; begin for i:=1 to n do begin write('a[,'i,']=');readln(a[i]); end; write('Введите значение:');readln(znachenie); sum:=0;count:=0; for i:=1 to n do if a[i] > znachenie then begin inc(count); sum:=sum+a[i]; end; sred_arifm:=sum/count; write('Среднее арифметическое ... =',sred_arifm:3:2); end.
var
t:boolean;
d:integer;
begin
t := true;
d := 2;
while t and (d*d <= x) do
begin
if x mod d = 0 then
t := false;
d := d + 1
end;
prime := t
end;
function order(x:integer):boolean;
var
t:boolean;
d:integer;
begin
d := -1;
repeat
t := x mod 10 > d;
d := x mod 10;
x := x div 10
until not t or (x = 0);
order := t
end;
var
t:boolean;
i,k,n:integer;
begin
t := false;
read(k,n);
for i := k to n do
if prime(i) then
if order(i) then
begin
write(i,' ');
t := true
end;
if not t then
write(0)
end.