BZOJ3157: 国王奇遇记 & 3516: 国王奇遇记加强版

令[S_i=sum_{k=1}^n k^i m^k]我们有[egin{eqnarray*}(m-1)S_i & = & mS_i - S_i \& = & sum_{k=1}^n k^i m^{k+1} - sum_{k=1}^n k^i m^k \& = & sum_{k=2}^{n+1} (k-1)^i m^k - sum_{k=1}^n k^i m^k \& = & n^i m^{n+1} + sum_{k=1}^n m^kig( (k-1)^i - k^iig) \& = & n^i m^{n+1} + sum_{k=1}^n igg( sum_{j=1}^{i-1} (-1)^{i-j}{i choose j}k^j m^k igg) \& = & n^i m^{n+1} + sum_{j=0}^{i-1} (-1)^{i-j}{i choose j} S_jend{eqnarray*}]直接按照这条式子(O(m^2))递推即可。

P.S. 来自http://taorunz.logdown.com/posts/193397-bzoj3157

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const LL mod=1000000007;
inline LL sqr(LL num){return num*num;}
LL mexp(LL a,LL b,LL p){return b?sqr(mexp(a,b>>1,p))%p*((b&1)?a:1)%p:1;}
LL fac[1100],facinv[1100],powm1[1100];
LL C(LL n,LL r){return fac[n]*facinv[r]%mod*facinv[n-r]%mod;}
LL n,m,s[1100];
int main(int argc, char *argv[])
{
    cin>>n>>m;
    if(m==1){cout<<n*(n+1)/2%mod<<endl;return 0;}
    fac[0]=1;for(int i=1;i<=m;i++)fac[i]=fac[i-1]*i%mod;
    facinv[m]=mexp(fac[m],mod-2,mod);facinv[0]=1;
    for(int i=m-1;i>=1;i--)facinv[i]=facinv[i+1]*(i+1)%mod;
    powm1[0]=1;for(int i=1;i<=m;i++)powm1[i]=powm1[i-1]*-1;
    s[0]=((mexp(m,n+1,mod)-m)%mod+mod)%mod*mexp(m-1,mod-2,mod);
    for(int i=1;i<=m;i++)
    {
        s[i]=mexp(n,i,mod)*mexp(m,n+1,mod)%mod;
        for(int j=0;j<i;j++)s[i]=((s[i]+powm1[i-j]*C(i,j)*s[j])%mod+mod)%mod;
        s[i]=s[i]*mexp(m-1,mod-2,mod)%mod;
    }
    cout<<s[m]<<endl;
    return 0;
}