{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 calmnet 的文章《快速指数算法》','https://www.xiaopingtou.net/article-56323.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
c=0;//c是指数的部分结果，终值为指数m
d=1;//d是中间结果，终值为所求结果
for(int i=k;i>=0;i--)
{
c=2*c;
d=(d*d)mod n;
if(bi==1)
{
c=c+1;
d=(d*a)mod n;
}
}
return d;
LL QuickPower(LL x,LL y)
{
LL re;
for(re=1;y;y=y/2,x=x*x%md)
if(y&1) re=re*x%md;
return re;
}