BZOJ4589 Hard Nim

造一个序列，凡是第m以内的素数项为1，否则为0，对这个序列求生成函数，相当于做n次异或卷积后求0次项的系数

异或卷积嘛，普通卷积是一个sigma i+j=k，异或卷积就是sigma i^j=k

求异或卷积用fwht

fwht请看picks博客

这题fwht之后做快速幂，然后再fwht回来即可

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<bitset>
#include<map>
using namespace std;
#define MAXN 1010
#define MAXM 50010
#define ll long long
#define eps 1e-8
#define INF 1000000000
#define MOD 1000000007
int p[MAXM],tot;
bool np[MAXM];
int n,m;
ll a[MAXM*2];
ll b[MAXM*2];
ll ni2;
void su(){
	int i,j;
	np[1]=1;
	for(i=2;i<MAXM;i++){
		if(!np[i]){
			p[++tot]=i;
		}
		for(j=1;j<=tot&&p[j]*i<MAXM;j++){
			np[p[j]*i]=1;
			if(!(i%p[j])){
				break;
			}
		}
	}
}
ll mi(ll x,ll y){
	ll re=1;
	while(y){
		if(y&1){
			re=re*x%MOD;
		}
		x=x*x%MOD;
		y>>=1;
	}
	return re;
}
void fwht(ll *x,int l,int r,int f){
	int i;
	if(l==r){
		return ;
	}
	int mid=l+r>>1;
	fwht(x,l,mid,f);
	fwht(x,mid+1,r,f);
	if(f==1){
		for(i=0;i<=mid-l;i++){
			ll X=x[l+i],Y=x[mid+1+i];
			x[l+i]=(X+Y)%MOD;
			x[mid+1+i]=(X-Y+MOD)%MOD;
		}
	}else{
		for(i=0;i<=mid-l;i++){
			ll X=x[l+i],Y=x[mid+1+i];
			x[l+i]=((X+Y)%MOD)*ni2%MOD;
			x[mid+1+i]=((X-Y+MOD)%MOD)*ni2%MOD;
		}
	}
}
int main(){
	int i;
	su();
	ni2=mi(2,MOD-2);
	while(scanf("%d%d",&n,&m)!=EOF){
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(i=1;i<=tot;i++){
			if(p[i]<=m){
				a[p[i]]=1;
			}
		}
		int M=m;
		for(m=1;m<=M;m<<=1){
			
		}
		b[0]=1;
		fwht(a,0,m-1,1);
		fwht(b,0,m-1,1);
		while(n){
			if(n&1){
				for(i=0;i<m;i++){
					b[i]=b[i]*a[i]%MOD;
				}
			}
			for(i=0;i<m;i++){
				a[i]=a[i]*a[i]%MOD;
			}
			n>>=1;
		}
		fwht(b,0,m-1,-1);
		printf("%lld\n",b[0]);
	}
	return 0;
}

/*

*/