![O(1)乘法与快速乘O(log) O(1)乘法与快速乘O(log)](https://image.shishitao.com:8440/aHR0cHM6Ly93d3cuaXRkYWFuLmNvbS9pLzNjZjg0MzhjNjRkYzFhOTIzOWU5ZTllMDUwNTc4Y2ZhMS5qcGc%3D.jpg?w=700&webp=1)
![O(1)乘法与快速乘O(log) O(1)乘法与快速乘O(log)](https://image.shishitao.com:8440/aHR0cHM6Ly93d3cuaXRkYWFuLmNvbS9pLzNjZjg0MzhjNjRkYzFhOTIzOWU5ZTllMDUwNTc4Y2ZhMi5qcGc%3D.jpg?w=700&webp=1)
//O(1)快速乘 inline LL quick_mul(LL x,LL y,LL MOD){ x=x%MOD,y=y%MOD; return ((x*y-(LL)(((long double)x*y+0.5)/MOD)*MOD)%MOD+MOD)%MOD; } //O(log)快速乘 inline LL quick_mul(LL a,LL n,LL m) { LL ans=0; while(n) { if(n&1) ans=(ans+a)%m; a=(a<<1)%m; n>>=1; } return ans; }
O(1) 的有误差的 , 在mod 很大的时候不推荐用