Problem
对于数字串 S , S[l] 表示串 S 的第 l 个数字( l 从 1 开始标记)。
F(j, i)=(Σil=jS[l])
对于每个 i ,求 Σij=1F(j, i)
限制条件
T ≤ 5
N ≤ 50000
k ≤ 100
解题思路
模拟暴力求每一项的结果:
第一项: (S1)k
第二项: (S1+S2)k+(S2)k
第三项: (S1+S2+S3)k+(S2+S3)k+(S3)k
…
这样的复杂度将达到 O(N2×logK) ,即使通过预处理出 45 万数(最大前缀和)的 K 次结果,复杂度仍将有 O(N2)
考虑前缀和表示结果
第一项: (Pre1−Pre0)k
第二项: (Pre2−pre0)k+(Pre2−Pre1)k
第三项: (Pre3−Pre0)k+(Pre3−Pre1)k+(Pre3−Pre2)k
…
将其展开:
第一项: C0kPrek1+C1kPrek−11(−Pre0)1+...+CkkPre01(−Pre0)k
第二项: C0kPrek2+C1kPrek−12(−Pre0−Pre1)1+...+CkkPre02(−Pre0−Pre1)k
第三项: C0kPrek3+C1kPrek−13(−Pre0−Pre1−Pre2)1+...+CkkPre03(−Pre0−Pre1−Pre2)k
将 Pre0+Pre1+...+Prej 记作 PPrevj ,预处理出所有的 PPrevj 。
对每一项乘法求解的复杂度为 O(K) 。整体复杂度为 O(N×K)
//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;
#define pi acos(-1)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+10;
const int maxx=1e6+100;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}
inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}
void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;
LL C[105][105];
char s[maxn];
int a[maxn],t,k,n;
LL sum[maxn],S[maxn][105],T[maxn][105],ans[maxn];
void init()
{
for (int i = 0; i < 105; i++)
{
for (int j = 0; j <= min(105, i); j++)
{
if (j == 0) C[i][j] = 1;
else
C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod;
}
}
}
inline void inv(LL &x,LL y)
{
x=(x+y)%mod;
}
void solve()
{
scan_d(n),scan_d(k);
scanf("%s",s+1);
FOR(1,n,i)
a[i]=s[i]-'0';
sum[0]=0;
FOR(1,n,i)
sum[i]=(sum[i-1]+a[i])%mod;
//S[i][j] ->sum[i]^j
FOR(0,n,i)
S[i][0]=1LL;
FOR(1,n,i)
FOR(1,k,j)
S[i][j]=(S[i][j-1]*sum[i])%mod;
//T[i][j] ->sigma(p=1-j)S[p][j]
FOR(0,k,i)
T[0][i]=S[0][i];
FOR(1,n,i)
FOR(0,k,j)
T[i][j]=(T[i-1][j]+S[i][j])%mod;
me(ans,0);
FOR(1,n,i)
FOR(0,k,j)
{
if(j%2==0)
{
inv(ans[i],C[k][j]*S[i][k-j]%mod*T[i-1][j]%mod);
}
else
{
inv(ans[i],-C[k][j]*S[i][k-j]%mod*T[i-1][j]%mod);
}
if(ans[i]<0)
ans[i]+=mod;
}
FOR(1,n,i)
{
if(i!=n)
cout<<ans[i]<<" ";
else cout<<ans[i]<<endl;
}
}
int main()
{
//freopen( "in.txt" , "r" , stdin );
init();
scan_d(t);
W(t--)
solve();
}