模板,有标号无向连通图计数
用EGF和组合数学的知识得到有标号无向图的个数为
f
(
x
)
=
∑
i
≥
0
2
(
2
i
)
x
i
i
!
f(x)=\sum_{i\ge0}\frac{2^{(^i_2)}x^i}{i!}
f(x)=∑i≥0i!2(2i)xi
然后设
g
(
x
)
g(x)
g(x)表示有标号无向连通图的生成函数,因为一个无向图是由多个无向连通子图构成,所以有
f
(
x
)
=
e
g
(
x
)
f(x)=e^{g(x)}
f(x)=eg(x),这个好像要用麦克劳林级数证明,我并不会
所以
g
(
x
)
=
l
n
f
(
x
)
g(x)=ln{f(x)}
g(x)=lnf(x),多项式求ln就行了
Code:
#include<bits/stdc++.h>
#define ll long long
#define poly vector<int>
#define mod 1004535809
using namespace std;
inline int read(){
int res=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
return res*f;
}
const int N=2e5+5;
inline int add(int x,int y){x+=y;if(x>=mod) x-=mod;return x;}
inline int dec(int x,int y){x-=y;if(x<0) x+=mod;return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
inline void inc(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void Mul(int &x,int y){x=1ll*x*y%mod;}
inline int ksm(int a,ll b){int res=1;for(;b;b>>=1,Mul(a,a)) if(b&1) Mul(res,a);return res;}
namespace Ntt{
int *w[22],rev[N<<2];
inline void init_rev(int n){for(int i=0;i<n;i++) rev[i]=(rev[i>>1]>>1)|((i&1)*(n>>1));}
inline void init_w(){
for(int i=1;i<=21;i++) w[i]=new int[1<<(i-1)];
int wn=ksm(3,(mod-1)/(1<<21));
w[21][0]=1;
for(int i=1;i<(1<<20);i++) w[21][i]=mul(w[21][i-1],wn);
for(int i=20;i;i--)
for(int j=0;j<(1<<(i-1));j++) w[i][j]=w[i+1][j<<1];
}
inline void ntt(poly &f,int n,int kd){
for(int i=0;i<n;i++) if(i>rev[i]) swap(f[i],f[rev[i]]);
for(int mid=1,l=1;mid<n;mid<<=1,l++){
for(int i=0;i<n;i+=(mid<<1)){
for(int j=0,a0,a1;j<mid;j++){
a0=f[i+j],a1=mul(f[i+j+mid],w[l][j]);
f[i+j]=add(a0,a1),f[i+j+mid]=dec(a0,a1);
}
}
}
if(kd==-1 && (reverse(f.begin()+1,f.begin()+n),1))
for(int inv=ksm(n,mod-2),i=0;i<n;i++) Mul(f[i],inv);
}
inline poly operator *(poly a,poly b){
int m=a.size()+b.size()-1,n=1;
if(m<=128){
poly c(m,0);
for(int i=0;i<a.size();i++)
for(int j=0;j<b.size();j++)
inc(c[i+j],mul(a[i],b[j]));
return c;
}
while(n<m) n<<=1;
init_rev(n);
a.resize(n);ntt(a,n,1);
b.resize(n);ntt(b,n,1);
for(int i=0;i<n;i++) Mul(a[i],b[i]);
ntt(a,n,-1);a.resize(m);
return a;
}
}
using namespace Ntt;
inline poly Inv(poly a,int n){
poly c,b(1,ksm(a[0],mod-2));
for(int lim=4;lim<(n<<2);lim<<=1){
init_rev(lim);
c=a;c.resize(lim>>1);
c.resize(lim);ntt(c,lim,1);
b.resize(lim);ntt(b,lim,1);
for(int i=0;i<lim;i++) Mul(b[i],dec(2,mul(b[i],c[i])));
ntt(b,lim,-1);b.resize(lim>>1);
}
b.resize(n);return b;
}
inline poly deriv(poly a){
for(int i=0;i<a.size()-1;i++) a[i]=mul(a[i+1],i+1);
a.pop_back();return a;
}
ll inv[N];
inline poly integ(poly a){
a.push_back(0);
for(int i=a.size()-1;i;i--) a[i]=mul(a[i-1],inv[i]);
a[0]=0;
return a;
}
inline poly ln(poly a,int n){
a=integ(deriv(a)*Inv(a,n));a.resize(n);
return a;
}
int fac[N],ifac[N];
inline void init(){
init_w();
inv[0]=inv[1]=1;
for(int i=2;i<N;i++) inv[i]=((mod-mod/i)*inv[mod%i])%mod;
fac[0]=fac[1]=1;ifac[0]=1;
for(int i=2;i<N;i++) fac[i]=mul(fac[i-1],i);
ifac[N-1]=ksm(fac[N-1],mod-2);
for(int i=N-2;i;i--) ifac[i]=mul(ifac[i+1],i+1);
}
poly a,ans;
int main(){
int n=read();
init();int m=1;
while(m<=n) m<<=1;a.resize(m);
for(int i=0;i<m;i++) a[i]=mul(ksm(2,(ll)i*(i-1)/2),ifac[i]);
ans=ln(a,m);
cout<<mul(ans[n],fac[n]);
return 0;
}