primes.0

PL/0源码

var
	numPrimesWanted,
	nextPrime;

procedure foo;
begin
end;

procedure GetNextPrime;
var
	candidateIsPrime;

	procedure bar;
	begin
	end;

	procedure TestCandidateIsPrime;
	var
		divisor;
	begin
		candidateIsPrime := 1;
		divisor := 2;
		while (divisor * divisor) <= nextPrime do begin
			if (nextPrime / divisor) * divisor = nextPrime then begin
				candidateIsPrime := 0;
				divisor := nextPrime;
			end;
			divisor := divisor + 1;
		end;
		call foo;
		call bar;
	end;

begin
	nextPrime := nextPrime + 1;
	call TestCandidateIsPrime;
	while candidateIsPrime = 0 do begin
		nextPrime := nextPrime + 1;
		call TestCandidateIsPrime;
	end;
end;

begin
	nextPrime := 1;
    numPrimesWanted := input;
	while numPrimesWanted > 0 do begin
		call GetNextPrime;
		output := nextPrime;
		numPrimesWanted := numPrimesWanted - 1;
    end;
end.