拉格朗日插值

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

思路：答案是k+1次，所以需要k+2个点，套模板好了，运用前后缀积降低复杂度

#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 inv[50008],a[50008],p[50008],q[50008],w,res,n,k;
ll gmod(ll a,ll b)
{
    ll res=1;
    while(b)
    {
        if(b&1) res=res*a%mod;
        b>>=1,a=a*a%mod;
    }
    return res;
}
void init(int n)
{
    inv[1]=1;
    FOR(i,2,n)  inv[i]=(mod-mod/(ll)i)*inv[mod%i]%mod;
}
ll sum(ll n)
{
    if(n<=k+2) return a[n];
    p[0]=q[k+3]=1,w=1,res=0;n%=mod;
    FOR(i,1,k+2) p[i]=p[i-1]*(ll)(n-i)%mod;
    FOL(i,k+2,1) q[i]=q[i+1]*(ll)(n-i)%mod;
    FOR(i,2,k+2) w=w*(ll)(1-i)%mod; w=gmod(w,mod-2);
    FOR(i,1,k+2)
    {
        res=(res+a[i]*p[i-1]%mod*q[i+1]%mod*w%mod)%mod;
        w=w*(ll)(i-k-2)%mod*inv[i]%mod;
    }
    return (res+mod)%mod;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    init(50002);
    while(t--)
    {
        sl(n),sl(k);
        FOR(i,1,k+2) a[i]=(a[i-1]+gmod(i,k))%mod;
        printf("%lld\n",sum(n));
    }
    return 0;
}