快速幂模板 #include<iostream> #include<csitdio> #include<algorithm> #define ll long long using namespace std; ll m=100007; ll quick_pow(ll a,ll b) { ll answer=1; while(b>0) { if(b&1) { answer*=a; answer%=m; } a*=a; a%=m; b>>=1; } return answer%m; } 谢谢阅读