Codeforces 1097 D Makoto and a Blackboard [概率+dp]

Codeforces 1097 D Makoto and a Blackboard

题目链接
题意：给定一个数$n$，每次操作可以把$n$等概率变成它的因数之一。求$k$次操作之后$n$的期望。

题解

每个质因子的贡献是分开的，比如质因子$p$，当前幂次为$p^k$，那么它会等概率变成$p^0\dots p^k$，于是直接对于每个质因子分开dp，$f[i][j]$表示到第$i$轮，幂次为$k$的概率。则$f[i][j]={\sum }_{k\ge j}f[i-1][k]\cdot \frac{1}{k+1}$，显然可以前缀和优化。于是总复杂度为$O(k\cdot \sum 质因数幂次)$.

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 10005, mod = 1000000007;
ll inv[maxn], n, k;
ll modpow(ll a, int b) {
	ll res = 1;
	for (; b; b >>= 1) {
		if (b & 1) res = res * a % mod;
		a = a * a % mod;
	}
	return res;
}
ll dv[maxn], ex[maxn], s[maxn], res = 1;
int main() {
	scanf("%lld%lld", &n, &k); ll m = n; int cnt = 0, all = 0;
	for (ll i = 2; i * i <= m; i++) if (m % i == 0) {
		++cnt, dv[cnt] = i;
		for (; m % i == 0; m /= i) ++ex[cnt], ++all;
	}
	if (m > 1) ++cnt, dv[cnt] = m, ++ex[cnt], ++all;
	inv[1] = 1;
	for (int i = 2; i < maxn; i++) inv[i] = mod - (ll)mod / i * inv[mod % i] % mod;
	for (int i = 1; i <= cnt; i++) {
		memset(s, 0, sizeof(s));
		s[ex[i]] = 1;
		for (int j = 1; j <= k; j++)
			for (int l = ex[i]; l >= 0; l--) s[l] = (s[l + 1] + s[l] * inv[l + 1]) % mod;
		ll mul = 1, sum = 0;
		for (int j = 0; j <= ex[i]; j++, (mul *= dv[i]) %= mod)
			sum = (sum + mul * s[j]) % mod;
		res = res * sum % mod;
	}
	printf("%lld\n", res);
	return 0;
}