prime.pas

来自「pl/x的编译器」· PAS 代码 · 共 43 行

//find prime number between s to b

program

integer s  ,b

begin

procedure findPrime(integer small,big)

integer i,j,k,c,t

begin
	i:=small;

	for i from small to big
	do
		j:=2;
		if(i>=3) then

			k:=i/2+1;
			c:=0;

			for j from 2 to k
			do
				if i=(i/j)*j then //由于没有提供取余运算，只能这样了~_~
					c:=c+1
				end		
			end;
			
			if c=0 then
				write i
			end	
		end
	end
end

read s;
read b;

call findPrime s b

end.