ac1154.pas

某牛人写的acm.tongji.edu.cn上大部分ac的代码,仅供学习研究,请不要用来作弊

program tju1154;
const
  divisor=9901;
var
  m,n:longint;
function p(a,b:longint):longint;
  begin
    if b=1 then
      p:=a
    else if odd(b) then
      p:=sqr(p(a,b shr 1)) mod divisor*a mod divisor
    else
      p:=sqr(p(a,b shr 1)) mod divisor;
  end;
begin
  repeat
    read(m,n);
    m:=p(2,m)-1;
    if m<0 then inc(m,divisor);
    writeln(p(m,n));
  until seekeof;
end.