链接
题解
a n s i = ∑ j = 1 i ( k − 1 + j − i j − i ) ans_i = \sum_{j=1}^i \binom{k-1+j-i}{j-i} ansi=j=1∑i(j−ik−1+j−i)
预处理 f i = ( k − 1 + i i ) f_i = \binom{k-1+i}{i} fi=(ik−1+i),然后 O ( n 2 ) O(n^2) O(n2)计算即可
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
#define mod 1'000'000'007ll
ll f[maxn], n, k, a[maxn], b[maxn], inv[2020];
int main()
{
ll i, j;
n=read(), k=read();
rep(i,1,n)a[i]=read();
inv[1]=1;
rep(i,2,n)inv[i]=inv[mod%i]*(mod-mod/i)%mod;
f[0]=1;
rep(i,1,n)f[i]=f[i-1]*(k-1+i)%mod*inv[i]%mod;
rep(i,1,n)rep(j,i,n)
{
(b[j]+=f[j-i]*a[i])%=mod;
}
rep(i,1,n)printf("%lld ",b[i]);
return 0;
}