省队集训day6 A

code：

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#define maxn 262146
#define mod 950009857
#define g 7
using namespace std;
typedef long long int64;
char ch;
int n,m,k,x,N,len,rev[maxn];
int64 a[maxn],b[maxn],c[maxn],wwn[2][maxn],wn,w,t1,t2; 
bool ok;
void read(int &x){
    for (ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=1;
    for (x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());
    if (ok) x=-x;
}
void read(int64 &x){
    for (ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') ok=1;
    for (x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());
    if (ok) x=-x;
}
int re(int v){
    int t=0;
    for (int i=0;i<len;i++) t<<=1,t|=v&1,v>>=1;
    return t;
}
int64 ksm(int64 a,int64 b){
    int64 t=1;
    for (;b;b>>=1){if (b&1) t=t*a%mod; a=a*a%mod;}
    return t;
}
void ntt(int64 *a,int op){
    for (int i=0;i<N;i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
    for (int s=2;s<=N;s<<=1){
        wn=wwn[op][s];
        for (int i=0;i<N;i+=s){
            w=1;
            for (int j=i;j<i+(s>>1);j++,w=w*wn%mod){
                t1=a[j],t2=w*a[j+(s>>1)]%mod;
                a[j]=(t1+t2)%mod,a[j+(s>>1)]=((t1-t2)%mod+mod)%mod;
            }   
        }
    }
    if (op==1){
        int64 x=ksm(N,mod-2);
        for (int i=0;i<N;i++) a[i]=a[i]*x%mod;
    }
}
int main(){
    read(n),read(m),read(k),N=1;
    for (int i=0;i<n;i++) read(a[i]);
    for (int i=1;i<=m;i++) read(x),b[x]++;
    while (N<(n<<1)) len++,N<<=1;
    for (int i=0;i<N;i++) rev[i]=re(i);
    for (int i=1;i<=len;i++) wwn[0][1<<i]=ksm(g,(mod-1)/(1<<i));
    for (int i=1;i<=len;i++) wwn[1][1<<i]=ksm(wwn[0][1<<i],mod-2);
    for (;k;k>>=1){
        ntt(b,0);
        if (k&1){
            ntt(a,0);
            for (int i=0;i<N;i++) a[i]=a[i]*b[i]%mod;
            ntt(a,1);
            for (int i=n;i<N;i++) a[i]=0;
        }
        for (int i=0;i<N;i++) b[i]=b[i]*b[i]%mod;
        ntt(b,1);
        for (int i=n;i<N;i++) b[i]=0;
    }
    for (int i=0;i<n;i++) printf("%lld ",a[i]);
    puts("");
    return 0;
}