bzoj4589 FWT

FWT模板题

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
	int x=0;bool f=0;char c=getchar();
	for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
	for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
	return f?-x:x;
}
const int N=1<<16+5,P=1000000007;
int T,m,n,pr[N],pc,h[N];
bool vs[N];

inline void add(int &a,int b){
	((a+=b)>=P)?(a-=P):0;
}
inline int pw(int a,int k){
	int r=1;
	for (;k;a=(LL)a*a%P,k>>=1) if (k&1) r=(LL)r*a%P;
	return r;
}

void FWT(int A[],int n){
	for (int i=n>>1;i;i>>=1)
		for (int j=0;j<n;j+=i<<1)
			for (int k=j,t;k<j+i;k++)
				t=A[k],add(A[k],A[k+i]),add(t,P-A[k+i]),A[k+i]=t;
}
void IFWT(int A[],int n){
	for (int i=1;i<n;i<<=1)
		for (int j=0;j<n;j+=i<<1)
			for (int k=j,t;k<j+i;k++)
				t=A[k],add(A[k],A[k+i]),add(t,P-A[k+i]),A[k+i]=t;
	LL rn=pw(n,P-2);
	for (int i=0;i<n;i++) A[i]=A[i]*rn%P;
}

int main(){
	for (int i=2;i<N;i++){
		if (!vs[i]) pr[++pc]=i;
		for (int j=1;j<=pc&&i*pr[j]<N;j++){
			vs[i*pr[j]]=1;
			if (i%pr[j]==0) break;
		}
	}
	while (~scanf("%d%d",&T,&m)){
		for (n=1;n<=m;n*=2);
		memset(h,0,sizeof(int)*n);
		for (int i=1;i<=pc&&pr[i]<=m;i++) h[pr[i]]=1;
		FWT(h,n);
		for (int i=0;i<n;i++) h[i]=pw(h[i],T);
		IFWT(h,n);
		printf("%d\n",h[0]);
	}
	return 0;
}