版权声明:未经过同意不得转载 https://blog.csdn.net/qq_42500298/article/details/83090637
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n,d[3010],f[3010],g[3010],c[3010][3010],p[10000010],md=998244353;
int power(int x,int p)
{
int num=1;
while(p)
{
if (p&1)
num=(LL)num*x%md;
x=(LL)x*x%md;
p>>=1;
}
return num;
}
int main()
{
int num,i,j;p[0]=1;
scanf("%d",&n);
for(i=1;i<=n*n;++i)
{
p[i]=p[i-1]<<1;
if(p[i]>=md)
p[i]-=md;
}
for(i=0;i<=n;++i)
c[i][0]=1;
for(i=1;i<=n;++i)
{
for(j=1;j<=i;++j)
{
c[i][j]=c[i-1][j-1]+c[i-1][j];
if(c[i][j]>=md)
c[i][j]-=md;
}
}
for(i=1;i<=n;++i)
{
g[i]=p[i*(i-1)>>1];
scanf("%d",&d[i]);
for(j=1;j<i;++j)
{
g[i]-=(LL)c[i][j]*p[(i-j)*(i-j-1)>>1]%md*g[j]%md;
if(g[i]<0)
g[i]+=md;
}
}
for(i=1;i<=n;++i)
{
for(j=1;j<=i;++j)
{
num=f[i-j]+(LL)p[(i-j)*(i-j-1)>>1]*d[j]%md*j%md;
if (num>=md) num-=md;
f[i]+=(LL)num*c[i][j]%md*g[j]%md;
if (f[i]>=md) f[i]-=md;
}
printf("%d\n",(LL)f[i]*power(i,md-2)%md*power(p[i*(i-1)>>1],md-2)%md);
}
return 0;
}
来源:zr