伯努利数模板

题目链接：http://www.51nod.com/Challenge/Problem.html#!#problemId=1228

思路：就是一个伯努利数板子而已

#pragma GCC optimize(2)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
ll n,k,c[2008][2008],inv[2008],b[2008],tmp,ans;
void init()
{
    FOR(i,1,2005)
    {
        FOR(j,1,i-1) c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
        c[i][0]=c[i][i]=1;
    }
    inv[1]=1;
    FOR(i,2,2005)  inv[i]=(mod-mod/i)*inv[mod%i]%mod;
    b[0]=1;
    FOR(i,1,2000)
    {
        b[i]=0;
        FOR(j,0,i-1) b[i]=(b[i]+c[i+1][j]*b[j]%mod)%mod;
        b[i]=(b[i]*(-inv[i+1])%mod+mod)%mod;
    }
}
ll sum(ll n,ll k)
{
    n++;n%=mod;tmp=n;
    ans=0;
    FOR(i,1,k+1)
    {
        ans=(ans+c[k+1][i]*b[k+1-i]%mod*n%mod)%mod;
        n=n*tmp%mod;
    }
    ans=ans*inv[k+1]%mod;
    return ans;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    init();
    while(t--)
    {
        sl(n),sl(k);
        printf("%lld\n",sum(n,k));
    }
    return 0;
}