NTT很容易爆int
先打个求原根的程序(貌似NTT的题原根都是3)
code:
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const ll maxn = 110;
ll p[maxn],pn;
void div(ll x)
{
ll t=sqrt(x*1.0); pn=0;
for(ll i=2;i<=t;i++)
{
if(x%i==0)
{
p[++pn]=i;
while(x%i==0)x/=i;
}
}
if(x>1)p[++pn]=x;
}
ll pow(ll x,ll k,ll mod)
{
x%=mod;
ll nowk=0,ret=1;
ll tmp=x,tmpk=1;
while(nowk!=k)
{
if(tmpk&k)
{
nowk|=tmpk;
ret=ret*tmp%mod;
}
tmp=tmp*tmp%mod; tmpk<<=1;
}
return ret;
}
void get_g(ll n)
{
div(n-1);
for(ll i=2;i<n;i++)
{
bool flag=true;
for(ll j=1;j<=pn;j++)
{
ll t=(n-1)/p[j];
if(pow(i,t,n)==1){ flag=false; break; }
}
if(flag)
{
ll j=n-1,temp=0;
while(!(j&1)){ j>>=1;temp++; }
printf("%I64d %I64d\n",i,temp);
return ;
}
}
}
int main()
{
ll n;scanf("%I64d",&n);
get_g(n);
return 0;
}
NTT: (质数是随便找的,一般来说题目给的质数原根是3,但保险起见建议先打个找原根的程序)
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const ll maxn = 410000;
const ll Mod = 469762049;
int an,bn,n,ln,id[maxn];
ll a[maxn],b[maxn],c[maxn],N;
ll w[maxn],g=3;
ll pw(ll x,int k)
{
x%=Mod;
ll ret=1,tmp=x;
int tk=1,nowk=0;
while(nowk!=k)
{
if(tk&k)
{
ret=ret*tmp%Mod;
nowk|=tk;
}
tk<<=1; tmp=tmp*tmp%Mod;
}
return ret;
}
void NTT(ll *s,int sig)
{
for(int i=0;i<n;i++) if(i<id[i]) swap(s[i],s[id[i]]);
for(int m=2;m<=n;m<<=1)
{
int t=m>>1,tmp=n/m;
for(ll i=0;i<t;i++)
{
ll wn=sig==1?w[i*tmp]:w[n-i*tmp];
for(int j=i;j<n;j+=m)
{
ll tx=s[j],ty=s[j+t]*wn%Mod;
s[j]=(tx+ty)%Mod;
s[j+t]=(tx-ty)%Mod;
}
}
}
if(sig==-1) for(int i=0;i<n;i++) s[i]=((s[i]*N%Mod)+Mod)%Mod;
}
int main()
{
scanf("%d%d",&an,&bn);an++;bn++;
for(int i=0;i<an;i++) scanf("%I64d",&a[i]);
for(int i=0;i<bn;i++) scanf("%I64d",&b[i]);
n=1;ln=0;
while(n<(an+bn)) {n<<=1;ln++;}
w[0]=1; w[1]=pw(g,(Mod-1)/n);
for(int i=1;i<=n;i++) w[i]=w[i-1]*w[1]%Mod;
N=pw(n,Mod-2);
for(int i=0;i<n;i++) id[i]=(id[i>>1]>>1)|((i&1)<<ln-1);
NTT(a,1); NTT(b,1);
for(int i=0;i<n;i++) c[i]=a[i]*b[i]%Mod;
NTT(c,-1);
printf("%I64d",c[0]);
for(int i=1;i<an+bn-1;i++) printf(" %I64d",c[i]);
printf("\n");
return 0;
}