POJ 3243 扩展BSGS

code:

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;

const int N = (1 << 16) + 10;

ll p, b, n;

ll FastPowMod(ll a, ll b, ll mod){
	ll ret = 1 % mod;
	while(b){
		if(b & 1) ret = ret * a % mod;
		if(ret == 0) return ret;
		a = a * a % mod;
		b >>= 1;
	}
	return ret;
}

struct Bj{
	ll v;
	int id;
	bool operator < (const Bj &rhs) const{
		return v == rhs.v ? id < rhs.id : v < rhs.v;
	}
}R[1000100];

int findL(int r, ll v){
	int l = 0, h = r - 1;
	while(l <= h){
		int m = (h + l) >> 1;
		if(R[m].v == v) return R[m].id;
		if(R[m].v > v) h = m - 1;
		else l = m + 1;
	}
	return -1;
}
ll extend_gcd(ll a, ll b, ll &x, ll &y){
	if(b == 0){
		x = 1;
		y = 0;
		return a;
	}
	ll d = extend_gcd(b, a % b, y, x);
	y -= a / b * x;
	return d;
}
ll inv(ll a, ll b, ll p){
	ll e, x, y;
	extend_gcd(a, p, x, y);
	e = x * b % p;
	return e < 0 ? e + p : e;
}
ll BSGS(ll b, ll l, ll r, ll phi, ll p){
	ll m = ceil(sqrt((double)p));
	for(int i = 0; i <= m; ++i){
		R[i].v = i ? R[i - 1].v * b % p : 1 % p;
		R[i].id = i;
	}
	sort(R, R + m + 1);
	int cnt = 1;
	for(int i = 1; i <= m; ++i) if(R[i].v != R[i - 1].v) R[cnt++] = R[i];
	ll bm = FastPowMod(b, phi - m, p);
	ll tmp = inv(l, r, p);
	ll ans = -1;
	for(int i = 0; i <= m; ++i){
		int pos = findL(cnt, tmp);
		if(~pos){
			ans = pos + i * m;
			break;
		}
		tmp = tmp * bm % p;
	}
	return ans;

}

ll gcd(ll a, ll b){
	return b == 0 ? a : gcd(b, a % b);
}

ll getPhi(ll x){
	ll ret = x;
	for(ll i = 2; i * i <= x; ++i){
		if(x % i == 0){
			while(x % i == 0) x /= i;
			ret = ret / i * (i - 1);
		}
	}
	if(x > 1) ret = ret / x * (x - 1);
	return ret;
}
void solve(){
	ll d, ret = 1 % p;
	ll cnt = 0;
	for(ll i = 0; i <= 35; ++i, ret = ret * b % p) if(ret == n){
		printf("%lld\n", i);
		return;
	}
	ll D = 1 % p;
	while((d = gcd(b, p)) != 1){
		if(n % d){
			puts("No Solution");
			return;
		}
		n /= d;
		p /= d;
		D = b / d * D % p;
		++cnt;
	}
	ll phi = getPhi(p);
	//ll R = (n * FastPowMod(b, phi - cnt,p)) % p; 
	//ll m = ceil(sqrt((double)p));
	ll ans = BSGS(b, D, n, phi, p);
	if(~ans == 0){
			puts("No Solution");
			return;
		}
	printf("%lld\n", ans + cnt);
}
int main(){
	//freopen("in.txt", "r", stdin);
	while(~scanf("%lld%lld%lld", &b, &p, &n), p + b + n){
		solve();
	}

	return 0;
}