hdu5730 Shell Necklace

题解

这题就是让你求

$$1+A(x)+A^2(x)+A^3(x)+\cdots =\frac{1}{1-A(x)}$$

所以就是个裸的多项式求逆

注意这个模数比较特别，所以要用两个模数分别作NTT，然后再用CRT合并

代码

#include <bits/stdc++.h>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll mod1=998244353, mod2=1004535809ll, mod, m=313;
struct EasyMath
{
    ll prime[maxn], phi[maxn], mu[maxn];
    bool mark[maxn];
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
    void exgcd(ll a, ll b, ll &x, ll &y)
    {
        if(!b){x=1,y=0;return;}
        ll xx, yy;
        exgcd(b,a%b,xx,yy);
        x=yy, y=xx-a/b*yy;
    }
    ll inv(ll x, ll p)  //p是素数
    {return fastpow(x%p,p-2,p);}
    ll inv2(ll a, ll p)
    {
        ll x, y;
        exgcd(a,p,x,y);
        return (x+p)%p;
    }
    void shai(ll N)
    {
        ll i, j;
        for(i=2;i<=N;i++)mark[i]=false;
        *prime=0;
        phi[1]=mu[1]=1;
        for(i=2;i<=N;i++)
        {
            if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
            for(j=1;j<=*prime and i*prime[j]<=N;j++)
            {
                mark[i*prime[j]]=true;
                if(i%prime[j]==0)
                {
                    phi[i*prime[j]]=phi[i]*prime[j];
                    break;
                }
                mu[i*prime[j]]=-mu[i];
                phi[i*prime[j]]=phi[i]*(prime[j]-1);
            }
        }
    }
	ll mult(ll a, ll b, ll c)
	{
		ll t=a, ans=0;
		for(;b;b>>=1,t=(t+t)%c)if(b&1)(ans+=t)%=c;
		return ans;
	}
    ll CRT(vector<ll> a, vector<ll> m) //要求模数两两互质
    {
        ll M=1, ans=0, n=a.size(), i;
        for(i=0;i<n;i++)M*=m[i];
        for(i=0;i<n;i++)
		{
			ll x = mult(a[i],M/m[i],M);
			ll y = mult(x,inv2(M/m[i],m[i]),M);
			(ans+=y)%=M;
		}
        return ans;
    }
}em;
struct NTT
{
    ll n;
    vector<ll> R;
    void init(ll bound)    //bound是积多项式的最高次幂
    {
        ll L(0);
        for(n=1;n<=bound;n<<=1,L++);
        R.resize(n);
        for(ll i=0;i<n;i++)R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    }
    void ntt(vector<ll>& a, int opt)
    {
        ll i, j, k, wn, w, x, y, inv(em.fastpow(n,mod-2,mod));
        for(i=0;i<n;i++)if(i>R[i])swap(a[i],a[R[i]]);
        for(i=1;i<n;i<<=1)
        {
            if(opt==1)wn=em.fastpow(3,(mod-1)/(i<<1),mod);
            else wn=em.fastpow(3,(mod-1-(mod-1)/(i<<1)),mod);
            for(j=0;j<n;j+=i<<1)
                for(w=1,k=0;k<i;k++,w=w*wn%mod)
                {
                    x=a[k+j], y=a[k+j+i]*w%mod;
                    a[k+j]=(x+y)%mod, a[k+j+i]=(x-y)%mod;
                }
        }
        if(opt==-1)for(i=0;i<n;i++)(a[i]*=inv)%=mod;
    }
};
struct Poly
{
    vector<ll> v;
    ll n;	//n是最高次项的次数
    Poly(ll N){v.resize(N+1);n=N;}
    Poly(const Poly& p){v=p.v; n=p.n;}
    void resize(ll N){n=N; v.resize(N+1);}
    ll& operator[](ll id){return v[id];}
    void show()
    {
        printf("n=%lld\n",n);
        ll i; rep(i,0,n-1)printf("%lldx^%lld + ",(v[i]+m)%m,i);
        printf("%lldx^%lld\n",(v[n]+m)%m,n);
    }
};
Poly operator+(Poly A, Poly B)
{
    ll i;
    Poly C(max(A.n,B.n));
	A.resize(C.n), B.resize(C.n);
    rep(i,0,C.n)C[i]=(A[i]+B[i])%m;
    return C;
}
Poly operator*(Poly A, Poly B)
{
    NTT ntt;
    ll i, n=A.n+B.n;
	
	mod = mod1;
	ntt = *(new NTT);
    ntt.init(n);
    A.resize(ntt.n-1), B.resize(ntt.n-1);
    ntt.ntt(A.v,1), ntt.ntt(B.v,1);
    Poly C(ntt.n-1);
    rep(i,0,C.n)C[i]=(A[i]*B[i])%mod;
	ntt.ntt(A.v,-1), ntt.ntt(B.v,-1);
	rep(i,0,A.n)(A[i]+=mod)%=mod, (B[i]+=mod)%=mod;
    ntt.ntt(C.v,-1);
    C.resize(n);
	
	mod = mod2;
	ntt = *(new NTT);
    ntt.init(n);
    A.resize(ntt.n-1), B.resize(ntt.n-1);
    ntt.ntt(A.v,1), ntt.ntt(B.v,1);
    Poly D(ntt.n-1);
    rep(i,0,D.n)D[i]=(A[i]*B[i])%mod;
    ntt.ntt(D.v,-1);
    D.resize(n);
	
	Poly E(n);
	rep(i,0,n)E[i]=(em.CRT({(C[i]+mod1)%mod1,(D[i]+mod2)%mod2},{mod1,mod2}))%m;
	
    return E;
}
Poly operator*(ll x, Poly A)
{
    x%=m;
    ll i; rep(i,0,A.n)(A[i]*=x)%=m;
    return A;
}
Poly operator~(Poly F)
{
    Poly H(0), f(0);
    ll i, j;
    H[0]=em.inv(F[0],m);
    for(i=2;(i>>1)<=F.n;i*=2)
    {
        f.resize(i-1);
        rep(j,0,min(i-1,F.n))f[j]=F[j];
        Poly t=H*H*f; t.resize(i-1);
        H=2*H+(-1)*t;
		rep(j,0,H.n)(H[j]+=m)%=m;
    }
    H.resize(F.n);
    return H;
}
int main()
{
	ll n;
	while(n=read())
	{
		ll i, j;
		Poly a(n);
		a[0]=1;
		rep(i,1,n)a[i]=(-read()%m+m)%m;
		auto ans = ~a;
		printf("%lld\n",(ans[n]+m)%m);
	}
}