Pascal计算素数

如题
2025-02-23 17:42:24
推荐回答(1个)
回答1:

var L,R,i,s:integer;
function prime(x:integer):integer;
var i:integer;
begin
if x<2 then exit 0;
for i:=2 to trunc(sqrt(x)) do
if x mod i=0 then exit(0);
exit(1);
end;
begin
readln(L,R);
s:=0;
for i:=L to R do
inc(s,prime(i));
writeln(s);
end.