// 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.
Вариант 1 var str:string; A,B,i:integer; begin write('введите ваш текст'); readln(str); for i:=1 to length(str) do begin if (str[i]='А')or (str[i]='а') then a:=a+1; if (str[i]='Б')or (str[i]='б') then B:=b+1; end; if (A+B)=0 then write('нет таких букв') else write ('A= ',A,' Б= ',b); end.
вариант 3 var str:string; A,B,i:integer; begin write('введите ваш текст'); readln(str); i:=1; while i<=length(str) do begin if (str[i]='А')or (str[i]='а') then delete(str,i,1); i:=i+1; end; write(str); end.
begin
var a := MatrGen(10, 10, (i,j) -> Ln(Abs((i+1)*(j+1))));
a.Println(7, 4)
end.