gdbhgch.pas

关于课件 好多种结构的算法 等等 大家自己看吧

program gdbhanshu(input,output);
var
  n,p,q,j,count:integer;
  flagp,flagq:boolean;
procedure sushu(x:integer;var flag:boolean);
  var
    i:integer;
  begin
    i:=2;
    flag:=true;
    while (i<=round(sqrt(x))) and flag do
      begin
        if x mod i =0 then flag:=false;
        i:=i+1;
      end;
  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;
        sushu(p,flagp);
        sushu(q,flagq);
      until (flagp and flagq);
      writeln(n:6,'=',p:3,'+',q:3);
    end;
   end.