Uses crt; var s:string; k,i,dl:integer; begin writeln('Введите строку: '); readln(s); k:=0; i:=1; dl:=length(s); while i<dl do begin if s[i]<>' ' then i:=i+1; if s[i]=' ' then i:=i+1; while s[i]=' ' do delete (s,i,1); if ((s[i]='?') or (s[i]='!') or (s[i]='.') or (s[i]=':') or (s[i]='-')or(s[i]=',')) and (s[i-1]=' ') then begin delete (s,i-1,1); end; dl:=length(s); end; writeln(s); 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.
Внимание! Если программа не работает, обновите версию!
begin
ReadlnString.ToWords.JoinIntoString(' ').Println
end.