拉格朗日插值

通用模板

拉格朗日插值

给出$n+1$个$x$互不相同点$(x_i,y_i)$, 可以唯一确定一个$n$次多项式

即: $f(x)=\sum _{i=0}^n{a}_i\cdot x^i$ 的系数$a_0,a_1,a_2,\cdots ,a_n$唯一确定

把 $a_0,a_1,a_2,\cdots ,a_n$当作未知数, 带入$n+1$个$(x_i,y_i)$得到

$\{\begin{array}{l}{a}_0\cdot (x_0{)}^0+a_1\cdot (x_0{)}^1+\cdots +a_n\cdot (x_0{)}^n=y_0\\ a_0\cdot (x_1{)}^0+a_1\cdot (x_1{)}^1+\cdots +a_n\cdot (x_1{)}^n=y_1\\ a_0\cdot (x_2{)}^0+a_1\cdot (x_2{)}^1+\cdots +a_n\cdot (x_2{)}^n=y_2\\ ⋮\\ a_0\cdot (x_n{)}^0+a_1\cdot (x_n{)}^1+\cdots +a_n\cdot (x_n{)}^n=y_n\end{array}$

矩阵形式:

$\left(\begin{array}{ccccc}1& x_0& (x_0{)}^2& \cdots & (x_0{)}^n\\ 1& x_1& (x_1{)}^2& \cdots & (x_1{)}^n\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ 1& x_n& (x_n{)}^2& \cdots & (x_n{)}^n\end{array}\right)\left(\begin{array}{c}{a}_0\\ a_1\\ a_2\\ ⋮\\ a_n\end{array}\right)=\left(\begin{array}{c}{y}_0\\ y_1\\ y_2\\ ⋮\\ y_n\end{array}\right)$

用高斯消元可以在$O(n^3)$内得到$a_0,a_1,a_2,\cdots ,a_n$

构造多项式: $l_i(x)=\{\begin{array}{l}1(x=x_i)\\ 0(x=x_j\bigcap i̸=j)\end{array}$

**那么: **$f(x)=\sum _{i=0}^n{l}_i(x)\cdot y_i$

令: $l_i(x)=\frac{(x-x_0)(x-x_1)\cdots (x-x_{i-1})(x-x_{i+1})\cdots (x-x_n)}{(x_i-x_0)(x_i-x_1)\cdots (x_i-x_{i-1})(x_i-x_{i+1})\cdots (x_i-x_n)}=\frac{\prod _{j=0\bigcap j̸=i}^n(x-x_j)}{\prod _{j=0\bigcap j̸=i}^n(x_i-x_j)}$

//(x[0],y[0]),……,(x[n],y[n])    n+1个点
//插出n次多项式, 返回带入x0的值
ll lagrange(int x[],int y[],int n,int x0)
{
    ll res=0;
    for(int i=0;i<=n;++i)
    {
        ll fz=1,fm=1;
        for(int j=0;j<=n;++j)
        {
            if(j==i)continue;
            fz=md(fz*(x0-x[j]));
            fm=md(fm*(x[i]-x[j]));
        }
        (res+=y[i]*fz%mod*qpow(fm,mod-2)%mod)%=mod;
    }
    return res;
}

自然幂和

求: $\sum _{i=1}^n{i}^k$

//快速幂

const int __=1e5+5;
int pk[__+5],num[__+5],sum[__+5];

//线性筛: pk[i]=qpow(i,k)%mod
void powk(int k)
{
    num[0]=0,pk[1]=sum[1]=1;
    for(int i=2;i<=k+1;++i)pk[i]=0;
    for(int i=2;i<=k+1;++i)
    {
        if(!pk[i])
        {
            num[++num[0]]=i;
            pk[i]=qpow(i,k);
        }
        for(int j=1;j<=num[0] && i*num[j]<=__;++j)
        {
            int &p=num[j];
            pk[i*p]=1ll*pk[i]*pk[p]%mod;
            if(!(i%p))break;
        }
        sum[i]=(sum[i-1]+pk[i])%mod;
    }
}

//预处理: fac[]阶乘, inv[]逆元, facinv[]阶乘逆元

//(x[i]=x+i,y[i])    n+1个x连续的点
//插出n次多项式, 返回带入x0的值
ll pre[__],saf[__];

ll lagrange(int x,int y[],int n,int x0)
{
    pre[0]=x0-x,saf[n]=x0-x-n;
    for(int i=1;i<=n;++i)
    {
        pre[i]=md(pre[i-1]*(x0-x-i));
        saf[n-i]=md(saf[n-i+1]*(x0-x-n+i));
    }
    ll res=0;
    for(int i=0;i<=n;++i)
    {
        ll fz=1;
        if(i!=0)fz=md(fz*pre[i-1]);
        if(i!=n)fz=md(fz*saf[i+1]);
        ll fm=md(facinv[i]*facinv[n-i]);
        if((n-i)&1)fm=mod-fm;
        (res+=md(y[i]*md(fz*fm)))%=mod;
    }
    return res;
}

int main()
{
    init();
    int _;for(sf("%d",&_);_;--_)
    {
        ll n;int k;
        sf("%lld%d",&n,&k);
        powk(k);
        pf("%lld\n",lagrange(0,sum,k+1,n%mod));
    }
    return 0;
}

复杂度: $O(q\cdot k)$