蓝桥杯算法提高-JOE的算数-题解(C++代码)快速幂算法
**时间复杂度O（logn）**```cpp#includeusingnamespacestd;intmain(){longlonga,b,c;cin>>a>>b>>c;longlongsum=1;a%=c;while(b){if(b%2)sum=(sum*a)%c;b/=2;a=(a*a)%c;}c
蓝桥杯算法提高-JOE的算数-题解(C++代码)
```cpp#includeusingnamespacestd;longlonga,b,mod;longlongksm(longlonga,longlongb,longlongmod){longlongret=1;while(b){if(b&1)ret=ret*a%mod;a=(a*a)%mod;b>
蓝桥杯算法提高-JOE的算数-题解（C++代码）快速幂+快速乘
此题单纯快速幂就可以解决，要是数据再大些就需要加上快速乘了。```#include#includeusingnamespacestd;longlongquick_m(longlonga,longlongb,longlongc){longlongret=1;while(b){if(b&1){ret=(a