【数学 组合计数 中国剩余定理 欧拉定理】luogu_2480 BZOJ_1951 古代猪文

题意

给出$n,q(1\le q,n\le 10^9)$，计算$q^{{\sum }_{d|n}{C}_n^d}mod999911659$

思路

因为$999911659$是个质数，根据欧拉定理得：$$q^{{\sum }_{d|n}{C}_n^d}\equiv q^{{\sum }_{d|n}{C}_n^{d}mod999911658}(mod999911659)$$
计算${\sum }_{d|n}{C}_n^{d}mod999911658$，
分解质因数$999911658=2\ast 3\ast 4679\ast 35617$。
设$a_1,a_2,a_3,a_4为{\sum }_{d|n}{C}_n^d$对$2,3,4679,35617$四个取模的结果，求解线性同余方程组：
$$\{\begin{array}{c}xmod2=a_1\\ xmod3=a_2\\ xmod4679=a_3\\ xmod35617=a_4\end{array}$$
即可得到${\sum }_{d|n}{C}_n^{d}mod999911658$的最小非负整数解，快速幂一下就好了。

代码

#include<cstdio>

int q, n, ans;
int m[] = {0, 2, 3, 4679, 35617}, a[5], fac[35618];

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

void init(int p) {
	fac[0] = 1;
	for (int i = 1; i < p; i++)
		fac[i] = fac[i - 1] * i % p;
}

long long C(int n, int m, int p) {
	if (n < m) return 0;
	return fac[n] * power(fac[m], p - 2, p) % p * power(fac[n - m], p - 2, p) % p;
}

long long lucas(int n, int m, int p) {
	if (!m) return 1;
	return C(n % p, m % p, p) * lucas(n / p, m / p, p) % p;
}

int main() {
	scanf("%d %d", &n, &q);
	if (q % 999911659 == 0) {
		printf("0");
		return 0;
	}
	for (int i = 1; i <= 4; i++) {
		init(m[i]);
		for (int j = 1; j * j <= n; j++) {
			if (n % j) continue;
			a[i] = (a[i] + lucas(n, j, m[i])) % m[i];
			if (n / j != j) a[i] = (a[i] + lucas(n, n / j, m[i])) % m[i];
		}
	}
	for (int i = 1; i <= 4; i++) {
		int M = 999911658 / m[i];
		ans = (ans + (long long)a[i] * M * power(M, m[i] - 2, m[i])) % 999911658;
	}
	printf("%d", power(q, ans, 999911659));
}