program p1528;

var n,m:longint;

function divisor(n:longint):longint;
  var i,t:longint;
begin
  t:=1;
  for i:=2 to round(sqrt(n)) do
    if n mod i=0 then begin
      t:=t+i;
      if i*i<>n then t:=t+n div i;
    end;
  divisor:=t;
end;

begin
  read(n);
  writeln('PERFECTION OUTPUT');
  while n<>0 do begin
    write(n:5,'  ');
    m:=divisor(n);
    if m=n then writeln('PERFECT')
    else if m>n then writeln('ABUNDANT')
      else writeln('DEFICIENT');
    read(n);
  end;
  writeln('END OF OUTPUT');
end.

• 大牛们，帮帮我吧~~~ (0) xiaobai 2004-06-06 21:38:21
  • Re:大牛们，帮帮我吧~~~ (9) dexter 2004-06-06 23:21:16
    • 1是PERFECT吧？ (0) xiaobai 2004-06-11 18:45:18
      • Re:1是DEFICIENT (0) PC0400322032 2004-07-09 04:42:01
        • 就是那1，害我wrong了好多次。。。 (0) lailai 2005-06-28 12:44:38