Wannafly模拟赛5 F Course

退役后刷的第一道题…

题解:

1. n!内某个因子a的指数:
   每次轮流除以a, 当前商+剩余贡献即可
   例:
   9! : 9 / 3 = 3; 3 / 3 = 1
   ans = 4

2. 对于[ka, ka + a - 1],
   阶乘中因子a的指数相同

---

定义$cal(i, n)是i!中因子n的指数$

$$ans = \sum_{i = 1}^{n ^ m}cal(i, n)\\=cal(n^m, n) + \sum_{i = 1} ^ {n ^m - 1} cal(i, n)\\=\sum_{i = 0}^{m-1}n^i+n * \sum_{i=1}^{n^{m-1}-1}cal(i*n, n)\\=\frac{n^m-1}{n-1}+n*(\sum_{i=1}^{n^{m-1}-1}i +\sum_{i=1}^{n^{m-1}-1} cal(i, n))\\=....\\=\frac{n^m-1}{n-1}+n^m*(\sum_{i=0}^{m-1}(n^i - 1)) * inv2$$

快速幂逆元搞一下(中间推导略了一部分)

代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const ll _2 = (mod + 1) >> 1;
ll qpow(ll a, ll b, ll c)
{
    ll res = 1 % c;
    while(b)
    {
        if(b & 1) res = res * a % c;
        a = a * a % c;
        b >>= 1;
    }
    return res;
}
int main()
{
    ll n, m;
    scanf("%lld%lld", &n, &m);
    ll x = (qpow(n, m, mod) + mod - 1) % mod * qpow(n - 1, mod - 2, mod) % mod;
    ll res = x + qpow(n, m, mod) * ((x - m) % mod + mod) % mod * _2 % mod;
    res = ((res + mod) % mod + mod) % mod;
    printf("%lld\n", res);
    return 0;
}