求逆元的3种方法

//扩展欧几里得求逆元 O(log n)
void Exgcd(ll a, ll b, ll &x, ll &y) {
    if (!b) x = 1, y = 0;
    else Exgcd(b, a % b, y, x), y -= a / b * x;
}
//快速幂求逆元 O (log n)
ll fpm(ll x, ll power, ll mod) {
    x %= mod;
    ll ans = 1;
    for (; power; power >>= 1, (x *= x) %= mod)
    	if(power & 1) (ans *= x) %= mod;
    return ans;
}
//线性递推求逆元  O(n)
void t(){
	inv[1] = 1;
	for(int i = 2; i < p; ++ i)
    	inv[i] = (p - p / i) * inv[p % i] % p;
}