51Nod 1773 A国的贸易 - FWT

FWT入门题

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define N 1100000
#define mod 1000000007
#define i2 500000004ll
#define lint long long
#define gc getchar()
using namespace std;
int ans[N],dp[N],pri[N],notp[N];
inline int inn()
{
    int x,ch;while((ch=gc)<'0'||ch>'9');
    x=ch^'0';while((ch=gc)>='0'&&ch<='9')
        x=(x<<1)+(x<<3)+(ch^'0');return x;
}
inline int fwt(int *a,int n)
{
    for(int i=1;i<n;i<<=1)
        for(int j=0,p=i<<1;j<n;j+=p)
            for(int k=0,x,y;k<i;k++)
                x=a[j+k],y=a[j+k+i],a[j+k]=(x+y)%mod,a[j+k+i]=(x-y+mod)%mod;
    return 0;
}
inline int ufwt(int *a,int n)
{
    for(int i=1;i<n;i<<=1)
        for(int j=0,p=i<<1;j<n;j+=p)
            for(int k=0,x,y;k<i;k++)
                x=a[j+k],y=a[j+k+i],a[j+k]=i2*(x+y)%mod,a[j+k+i]=i2*(x-y+mod)%mod;
    return 0;
}
inline int tms(int *a,int *b,int n)
{
    for(int i=0;i<n;i++) a[i]=(lint)a[i]*b[i]%mod;return 0;
}
int a[N],b[N];
int main()
{
    int k=inn(),m=inn(),n=(1<<k);
    for(int i=0;i<n;i++) a[i]=inn();
    for(int i=0;i<k;i++) b[1<<i]=1;b[0]=1;
    fwt(a,n),fwt(b,n);
    for(;m;m>>=1,tms(b,b,n)) if(m&1) tms(a,b,n);
    ufwt(a,n);
    for(int i=0;i<n;i++) printf("%d ",a[i]);
    return !printf("\n");
}