Const m = 10; var a: array[1..m+1] of integer; i, k: integer; begin write ('Исходный массив: '); for i := 1 to m do begin a[i] := random(100); write (a[i],'; '); end; writeln; write('Введите число: '); readln(k); for i:=m+1 downto 1 do begin a[i]:=a[i-1]; if a[i] mod 2=0 then begin a[i-1]:=k; break; end; end; write('Измененный массив: '); for i := 1 to m+1 do write (a[i],'; '); end.
// PascalABC.NET 3.1, сборка 1200 от 13.03.2016 function IsPrime(n:integer):boolean; begin if n<4 then Result:=True else begin var found:= (n mod 2 = 0); var p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n mod p = 0); p+=2 end; Result:=not found end end;
begin Writeln('k=',ArrRandom(ReadInteger('n='),1,999).Println. Where(x->IsPrime(x)).Count) end.
// PascalABC.NET 3.1, сборка 1200 от 13.03.2016 procedure IsPrime(n:integer; var res:boolean); begin if n<4 then res:=True else begin var found:= (n mod 2 = 0); var p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n mod p = 0); p+=2 end; res:=not found end end;
begin var a:=ArrRandom(ReadInteger('n='),1,999); a.Println; var k:=0; var prime:boolean; foreach var e in a do begin IsPrime(e,prime); if Prime then Inc(k) end; Writeln('k=',k) end.
m = 10;
var
a: array[1..m+1] of integer;
i, k: integer;
begin
write ('Исходный массив: ');
for i := 1 to m do
begin
a[i] := random(100);
write (a[i],'; ');
end;
writeln;
write('Введите число: ');
readln(k);
for i:=m+1 downto 1 do
begin
a[i]:=a[i-1];
if a[i] mod 2=0 then
begin
a[i-1]:=k;
break;
end;
end;
write('Измененный массив: ');
for i := 1 to m+1 do
write (a[i],'; ');
end.