pascal哥德巴赫猜想,能通过的有加分

2026-01-11 05:54:43
推荐回答(1个)
回答1:

var a:array[2..30000]of boolean;
i,j,k,n:integer;
begin
readln(n);
fillchar(a,sizeof(a),1);
for i:=2 to 10 do
if a[i] then
begin
j:=i*2;
while j<=n do
begin a[j]:=false; inc(j,i) end;
inc(i);
end;
for i:=2 to n div 2 do
begin
j:=i;
while (not a[j])or(not a[i*2-j]) do dec(j);
writeln(i*2,'=',j,'+',i*2-j);
if i mod 20=1 then readln;
end;
end.