当前位置:网站首页>Quick power explanation

Quick power explanation

2022-06-13 00:56:00 -LM-

Fast power

Time complexity O(logn)
(a + b) modp=(a modp + b modp) modp
(a - b) modp = (a modp - b modp + p) modp
a * b modp = a modp * b modp

const long long mod=1e9+7; 
long long fastpow(long long x,long long y){
     
	x%=mod; 
	long long res=1; 
	while(y){
     
		if(y & 1) res=res*x%mod; 
		y>>=1;
		x=x*x%mod; 
	}
	return res; 
}
原网站

版权声明
本文为[-LM-]所创,转载请带上原文链接,感谢
https://yzsam.com/2022/02/202202280557174612.html