题意:
问n个小于等于m的质数异或值为0的方案数。
题解:
FWT
F
W
T
裸题,将小于m的质数标为1,其它为0,然后
FWT
F
W
T
后快速幂。
orz:快速沃尔什变换学习小记
感觉是个很神奇的做法,特别是异或卷积。
code:
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
const LL mod=1000000007;
const LL inv2=(mod+1)>>1;
int n,m;
int prime[50010],pr=0;
bool v[50010];
void pre()
{
memset(v,true,sizeof(v));
pr=0;
for(int i=2;i<=50000;i++)
{
if(v[i]) prime[++pr]=i;
for(int j=1;j<=pr&&i*prime[j]<=50000;j++)
{
v[i*prime[j]]=false;
if(i%prime[j]==0) break;
}
}
}
LL a[100010];
int len;
LL pow(LL a,int b)
{
LL ans=1;
while(b)
{
if(b&1) ans=ans*a%mod;
a=a*a%mod;b>>=1;
}
return ans;
}
void fwt(LL *a,int l,int r)
{
if(l==r) return;
int mid=(l+r)/2,n=(r-l+1)>>1;
fwt(a,l,mid);fwt(a,mid+1,r);
for(int i=l;i<=mid;i++)
{
LL x=a[i],y=a[i+n];
a[i]=(x+y);a[i]=a[i]>=mod?a[i]-mod:a[i];
a[i+n]=(x-y)%mod;a[i+n]=a[i+n]<0?a[i+n]+mod:a[i+n];
}
}
void dwt(LL *a,int l,int r)
{
if(l==r) return;
int mid=(l+r)/2,n=(r-l+1)>>1;
dwt(a,l,mid);dwt(a,mid+1,r);
for(int i=l;i<=mid;i++)
{
LL x=a[i],y=a[i+n];
a[i]=(x+y);a[i]=a[i]>=mod?a[i]-mod:a[i];
a[i+n]=(x-y)%mod;a[i+n]=a[i+n]<0?a[i+n]+mod:a[i+n];
a[i]=a[i]*inv2%mod;a[i+n]=a[i+n]*inv2%mod;
}
}
int main()
{
pre();
while(scanf("%d %d",&n,&m)!=EOF)
{
len=1;while(len<=m) len<<=1;
memset(a,0,sizeof(a));
for(int i=1;i<=pr;i++)
if(prime[i]<=m) a[prime[i]]=1;
fwt(a,0,len-1);
for(int i=0;i<len;i++) a[i]=pow(a[i],n);
dwt(a,0,len-1);
printf("%lld\n",a[0]);
}
}