TJOI2018 Day2 T3

http://www.elijahqi.win/archives/3284
题意：多次求$\sum\limits_{i=1}^{n} i^k$

预处理伯努利数即可 复杂度$k^2$
伯努利数：$\sum\limits_{k=0}^{n}C_{n+1}^{k}\times B_k$
计算公式：$\sum\limits_{i=1}^{n} i^k=\frac{1}{k+1}\sum\limits_{i=1}^{k+1}C_{k+1}^{i}\times B_{k+1-i}\times (n+1)^i$

#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline ll read(){
    ll x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int mod=1e9+7;const int N=60;
ll n,a[N],cha[N];int T,k;
inline int inc(int x,int v){return x+v>=mod?x+v-mod:x+v;}
inline int dec(int x,int v){return x-v<0?x-v+mod:x-v;}
inline int ksm(ll b,int t){static ll tmp;b%=mod;
    for (tmp=1;t;b=b*b%mod,t>>=1) if (t&1) tmp=tmp*b%mod;return tmp;
}
int inv[N],c[N][N],b[N];
int main(){
    freopen("defile.in","r",stdin);
    freopen("defile.out","w",stdout);
    inv[1]=1;for (int i=2;i<=55;++i) inv[i]=(ll)(mod-mod/i)*inv[mod%i]%mod;
    T=read();for (int i=0;i<=55;++i) c[i][0]=1;b[0]=1;
    for (int i=1;i<=55;++i)
        for (int j=1;j<=i;++j) c[i][j]=inc(c[i-1][j],c[i-1][j-1]);
    for (int i=1;i<=52;++i){int sum=0;
        for (int j=0;j<i;++j) sum=inc(sum,(ll)c[i+1][j]*b[j]%mod);
        b[i]=(ll)-inv[i+1]*sum%mod;b[i]=(b[i]+mod)%mod;
    }
    while(T--){
        n=read();k=read();for (int i=1;i<=k;++i) a[i]=read();
        sort(a+1,a+k+1);ll ans=0;for (int i=1;i<=k;++i) cha[i]=a[i]-a[i-1];ll sum=0;
        for (int i=1;i<=k+1;++i){
            ans=0;ll mul=(n+1)%mod,mul1=mul;
            for (int j=1;j<=k+2;++j) {
            ans=inc(ans,(ll)c[k+2][j]*b[k+2-j]%mod*mul%mod);
            mul=mul*mul1%mod;}ans=ans*inv[k+2]%mod;
            for (int j=i;j<=k;++j) ans=dec(ans,ksm(a[j],k+1));sum=inc(sum,ans);
            n-=cha[i];for (int j=i;j<=k;++j) a[j]-=cha[i];
        }printf("%lld\n",sum);
    }
    return 0;
}