思路:考虑n的所有质因子,求其期望,再乘起来。
考虑dp数组,第一维表示当前是第几步,第二维表示当前因子的次数,然后每次对每种次数进行更新,次数高的可以向低的等概率转移。
const int N = 1e4+5;
ll n, k;
ll INV[65];
ll f[N][65];
ll cal(ll num, int cishu)
{
f(i, 0, cishu - 1)f[0][i] = 0;
f[0][cishu] = 1;
f(i,1,k)
f(j, 0, cishu)
{
f[i][j] = 0;
f(I, j, cishu)
f[i][j] = (f[i][j]+f[i - 1][I] * INV[I+1] % mod)%mod;
}
ll res = 0,tmp=1;
f(i, 0, cishu)
{
res = (res + f[k][i]*tmp) % mod;
tmp = tmp * num%mod;
}
return res;
}
int main()
{
//freopen("in.txt", "r", stdin);
while (cin >> n >> k)
{
ll ans = 1;
INV[1] = 1;
f(i, 1, 64)INV[i] = inv(i, mod);
for (ll i = 2;i*i <= n;i++)
{
if (n%i == 0)
{
int cot = 0;
while (n%i == 0)
{
cot++;
n /= i;
}
ans = ans * cal(i, cot) % mod;
}
}
if (n > 1)ans = ans * cal(n,1) % mod;
cout << ans << endl;
}
return 0;
}