ac1101.pas

来自「这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码」· PAS 代码 · 共 37 行

program tju1101;
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) or (c>3) then break;
      while n mod prime[i]=0 do begin
        n:=n div prime[i];inc(c);
      end;
    end;
    if c+ord(n>1)>3 then writeln('Niu!') else writeln('Ruo...');
  until seekeof;
end.