prim8_2.pas

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

program example8_2(input,output);
const n=100;
var
  s:set of 1..n;
  next,mul:integer;
begin
 s:=[2..n];
 next:=2;
 repeat
  while not(next in s) do
    next:=next+1;
  write(next:4);
  mul:=next;
  while mul<=n do
   begin
    s:=s-[mul];
    mul:=mul+next;
   end;
 until s=[];
 writeln;
end.