快速幂、快速幂求逆元

快速幂

int qmi(int a,int b,int p)
{
    int res = 1;
    while(b)
    {
        if(b&1) res = (long long)res * a % p;
        b>>=1;
        a = (long long)a * a % p;
    }
    return res;
}

快速幂求逆元

int qmi(int a,int b,int p)
{
    int res = 1;
    while(b)
    {
        if(b&1) res = (long long)res * a % p;
        b>>=1;
        a = (long long)a * a % p;
    }
    return res;
}

if(a%p) cout<<qmi(a,p-2,p)<<endl;
else cout<<"impossible"<<endl;