{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', '推荐 asdfg12622 的文章《模重复平方计算法》','https://www.xiaopingtou.net/article-55898.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
#include
#include
using namespace std;
int main()
{
int b,m,tmp; //tmp表示指数
while(cin>>b>>tmp>>m)
{
int base = 0, top = 0, node[100], a = 1;
while(tmp)
{
node[top++] = tmp%2;
tmp = tmp/2;
}
while(base
计算结果：
