洛谷 P1226 题解

也是快速幂模版

看完请点赞，谢谢

记得用 long long !

//LG1226 快速幂模版 21-08-18#includeusing namespace std;long long quick_pow(long long a,long long b,long long p){long long t;if (b==2)t=a*a%p;elseif (b==1 || b==0)t=1;else{t=yu(a,b/2,p);t=t*t%p;}if (b%2==1)t=t*a%p;return t;}int main(){int a,b,p;cin>>a>>b>>p;cout<<a<<'^'<<b<<" mod "<<p<<'=';cout<<yu(a,b,p)<<endl;}