SDOI2013 随机数生成器 BSGS+数论

题解：
按照$X_n$的递推式，得到$X_n$的通项公式，移项后得到
$$a^{n-1}\equiv (X_n+b\ast inv(a-1))\ast inv(X_1+b\ast inv(a-1))(modp)$$

这就是一个BSGS的模板了
注意特判a = 0或1的情况。

#include<cstdio>
#include<cstring>
#include<cmath>
typedef long long LL;

struct MAP{
	#define key (H % MOD)
	static const LL MOD = 999983, MAXN = 50005;
	int fir[MOD + 5], nxt[MAXN], num[MAXN], val[MAXN], cnt;
	void clear(){memset(fir, -1, sizeof(fir)); cnt = 0;}
	void Insert(int H, int t){
		for(int i = fir[key]; i != -1; i = nxt[i])
			if(val[i] == H){num[i] = t; return;}
		num[cnt] = t, val[cnt] = H, nxt[cnt] = fir[key], fir[key] = cnt++;
	}
	int found(int H){
		for(int i = fir[key]; i != -1; i = nxt[i])
			if(val[i] == H) return num[i];
		return -1;
	}
	#undef key
}Hash;

inline int read(){
	int k = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9'){k = k*10 + ch - '0'; ch = getchar();}
	return k * f;
}

int Pow(int a, int b, int p){
	int ans = 1;
	while(b){
		if(b & 1) ans = 1ll * ans * a % p;
		b >>= 1, a = 1ll * a * a % p;
	}
	return ans;
}

int BSGS(int a, int b, int p){ //a^x = b(mod p)
	int m = ceil(sqrt(p)); Hash.clear();
	for(int j = 0; j < m; j++){
		int t = (LL)b * Pow(a, j, p) % p;
		Hash.Insert(t, j);
	}
	a = Pow(a, m, p);
	if(!a) return !b ? 1 : -1;
	for(int i = 1; i <= m; i++){
		LL P = Pow(a, i, p), k = Hash.found(P);
		if(k != -1) return i * m - k + 1;
	}
	return -1;
}

int main(){
	freopen("in.txt", "r", stdin);
	int T = read(), inv, B, ans;
	while(T--){
		int p = read(), a = read(), b = read(), x1 = read(), t = read();
		if(x1 == t){puts("1"); continue;}
		if(a == 0){if(t == b) puts("2"); else puts("-1"); continue;}
		if(a == 1 && b == 0){puts("-1"); continue;}
		if(a == 1){
			inv = Pow(b, p - 2, p);
			ans = (1ll * (t - x1) * inv % p + p) % p;
			printf("%d\n", ans + 1);
			continue;
		}
		
		inv = 1ll * b * Pow(a - 1, p - 2, p) % p;
		B = 1ll * (t + inv) * Pow(x1 + inv, p - 2, p) % p;
		ans = BSGS(a, B, p);
		printf("%d\n", ans);
	}
	return 0;
}