验证哥德巴赫猜想那到 帮忙看看哪有问题
var
n,i:integer;
function s(n:integer):boolean;
var
i:integer;
begin
for i:=2 to round(sqrt(n)) do
if n mod i=0 then s:=false else s:=true;
end;
begin
read(n);
for i:=2 to (n div 2+1) do
if s(i)and(s(n-i)) then writeln(i,'+',n-i);
end.
