Răspuns:
program perfecte;
var m,n,temp:integer;
x: real;
begin
Write('m='); Read(m);
Write('n='); Read(n);
if m>n then begin temp:=m; m:=n; n:=temp end;
x:= Int(Sqrt(m));
if x*x < m then x:=x+1;
while (x*x<=n) do
begin
Write(x*x, ' ');
x:=x+1;
end;
end.
Explicație:
program prime;
var m,n,temp,x:integer;
function prim(z:integer):boolean;
var p,d:integer;
begin
p:=1;
for d:=3 to z div 2 do
begin
if z mod d = 0 then
begin p:=0; break; end;
end;
if p=0 then prim:=false
else prim:=true;
end;
begin
Write('m='); Read(m);
Write('n='); Read(n);
if m>n then begin temp:=m; m:=n; n:=temp end;
for x:=m to n do
begin
if prim(x) then Write(x,' ');
end;
end.