Function IsPrime(n:LongInt):Boolean; var p:LongInt; found:Boolean; begin found:= (n Mod 2 = 0); p:=3; while (not found) and (sqr(p)<=n) do begin found:=(n Mod p = 0); p:=p+2 end; IsPrime:=(not found) or (p = 2) end;
var i:integer; begin i:=101; WriteLn('Таблица простых трехзначных чисел'); repeat if IsPrime(i) then Write(i,' '); i:=i+2 until i>999; Writeln end.