40分求助

#include<bits/stdc++.h>
using namespace std;
int a,b,p,ans;
unordered_map<int,int>h;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
inline int qpow(int x,int y,int p,int z=1){
    for(;y;y>>=1,x=1LL*x*x%p)if(y&1)z=1LL*z*x%p;
    return z;
}
inline int bsgs(int a,int b,int p){
    h.clear();
    int t=sqrt(p)+1;
    for(int z,i=0;i<t;++i){
        if(i)z=1LL*z*a%p;
        else z=b;
        h[z]=i;
    }
    a=qpow(a,t,p);
    for(int z,j,i=0;i<=t;++i){
        if(i)z=1LL*z*a%p;
        else z=1;
        j=h.count(z)?h[z]:-1;
        if(j>=0&&i*t-j>=0)return i*t-j;
    }
    return -1;
}
int exbsgs(int a,int b,int p){
    int d,k=0,z=1,ans;
    if(b==1)return 0;
    while((d=gcd(a,p))>1){
        if(b%d)return -1;
        ++k;b/=d;p/=d;z=1LL*z*(a/d)%p;
        if(z==b)return k;
    }
    ans=bsgs(a,b,p);
    return ans==-1?-1:ans+k;
}
int main(){
    while(cin>>a>>p>>b){
        if(!a)return 0;
        ans=exbsgs(a,b,p);
        if(~ans)cout<<ans<<endl;
        else cout<<"No Solution\n";
    }
}