(有任何问题欢迎留言或私聊 && 欢迎交流讨论哦
目录
题目:传送门
给定长度为n的数组a,定义一次操作为:
1. 算出长度为n的数组s,使得si= (a[1] + a[2] + … + a[i]) mod 1,000,000,007;
2. 执行a = s;
现在问k次操作以后a长什么样。
输入描述:
第一行两个整数n,k(1 <= n <= 2000, 0 <= k <= 1,000,000,000);
第二行n个整数表示a数组(0 <= ai<= 1,000,000,000)。
输出描述:
一行n个整数表示答案。
思路:
非常类似Codeforces837:传送门
AC代码:
#include<bits/stdc++.h>
#define caseT int _T;scanf("%d",&_T);for(int q=1; q<=_T; ++q)
#define mm1(a) memset((a),-1,sizeof((a)))
#define mm0(a) memset((a),0,sizeof((a)))
#define mmx(a) memset((a),0x3f,sizeof((a)))
#define ka getchar()
#define lowbit(x) (x)&(-(x))
#define fuck(x) cout<<"* "<<x<<"\n"
#define test printf("***\n")
#define iis std::ios::sync_with_stdio(false)
#define MP make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
const int M = 4100005;
const int X = 999983;
const int INF = 1e9;
const double eps = 1e-8;
const double PI = acos(-1.0);
const LL mod = 1e9 + 7;
const LL md = 1e9 + 7;
const int maxn = 1e5 + 10;
LL ar[maxn],sum[maxn];
const int N = 100007;
LL f[N];
long long quickpow(long long a,long long b,long long m)
{
long long ans=1;
while (b!=0)
{
if (b%2==1)
{
ans=ans*a%m;
b--;
}
a=a*a%m;
b=b/2;
}
return ans;
}
//数据范围较小的组合数
long long yes(long long n,long long m)
{
if (n<m)
{
return 0;
}
if (m>n-m)
{
m=n-m;
}
long long s1=1,s2=1;
long long i;
for (i=1;i<=m;i++)
{
s1=s1*(n-i+1)%md;
s2=s2*i%md;
}
return s1*quickpow(s2,md-2,md)%md;
}
//Lucas定理
long long lucas(long long n,long long m){
if (m==0)
{
return 1;
}
return (lucas(n/md,m/md)*yes(n%md,m%md)%md);
}
int main(){
int n;
int m;
while(~scanf("%d %d",&n,&m)){
for(int i=1;i<=n;++i){
scanf("%lld",&ar[i]);
}
if(m==0){
for(int i=1;i<=n;++i){
if(i!=n)printf("%lld ",ar[i]);
if(i==n)printf("%lld\n",ar[i] );
}
continue;
}
sum[1]=1;
LL ans=0;
for(int i=2;i<=n;++i){
ans=lucas(m+i-2LL,i-1LL)%mod;
sum[i]=ans;
}
for(int i=1;i<=n;++i){
ans=0;
for(int j=1;j<=i;++j){
ans=(ans+(sum[j]*ar[i+1-j])%mod)%mod;
}
if(i!=n) printf("%lld ",ans );
else printf("%lld\n",ans );
}
}
return 0;
}