ac1081.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1081;
const
  maxprimes=4792;
var
  prime:array[1..maxprimes]of word;
  primes,n,i,c:longint;
procedure calprime;
  var
    i,j:word;
    p:boolean;
  begin
    for i:=2 to trunc(sqrt(maxlongint)) do begin
      p:=true;
      for j:=1 to primes do
        if i mod prime[j]=0 then begin
          p:=false;
          break;
        end;
      if p then begin
        inc(primes);prime[primes]:=i;
      end;
    end;
  end;
begin
  calprime;
  repeat
    read(n);c:=0;
    for i:=1 to primes do begin
      if sqr(prime[i])>n then break;
      if sqr(prime[i])=n then begin c:=1;break;end;
      if n mod prime[i]=0 then begin
        inc(c);if c=2 then break;
        if n div prime[i] mod prime[i]=0 then begin inc(c);break;end;
      end;
    end;
    if c=1 then writeln('It''s a MaoLaoDa number.') else writeln('It''s not a MaoLaoDa number.');
  until seekeof;
end.