gdbhansh.pas

来自「关于课件 好多种结构的算法 等等 大家自己看吧」· PAS 代码 · 共 35 行

program gdbhanshu(input,output);
var
  n,p,q,j,count:integer;
  flagp,flagq:boolean;
function sushu(x:integer):boolean;
  var
    i:integer;
  begin
    i:=2;
    while (i<=round(sqrt(x))) and flag do
      begin
        if p mod i =0 then flag:=false;
        i:=i+1;
      end;
    sushu:=flag;
  end;
begin {*   main  program  *}
  n:=2;
  while (n<=3) and (n mod 2=0) do
    begin
         write('Please input a number>3 and number mod 2=0: ');
         readln(n);
    end;
  p:=1;
  while (p<round(n/2)) do
    begin
      repeat
        p:=p+1;
        q:=n-p;
        flagp:=sushu(p);
        flagq:=sushu(q);
      until (flagp and flagq);
      writeln(n:6,'=',p:3,'+',q:3);
    end;
   end.