关于矩阵树定理,见论文:portal
关于递推式推导,见:portal
我们可以得到
f[n]=3∗f[n−1]−f[n−2]+2
,需要高精度。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 110
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(S==T) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n;
struct bigint{
int a[51],n;
bigint(){memset(a,0,sizeof(a));n=0;}
friend bigint operator-(bigint a,bigint b){
for(int i=1;i<=a.n;++i){
a.a[i]-=b.a[i];
if(a.a[i]<0) a.a[i]+=10,a.a[i+1]--;
}while(a.n&&!a.a[a.n]) --a.n;a.a[1]+=2;int now=1;
while(a.a[now]>=10) a.a[now+1]++,a.a[now]-=10,++now;
return a;
}friend bigint operator*(bigint a,int x){
for(int i=1;i<=a.n;++i) a.a[i]*=x;
for(int i=1;i<=a.n;++i) a.a[i+1]+=a.a[i]/10,a.a[i]%=10;
while(a.a[a.n+1]) ++a.n,a.a[a.n+1]+=a.a[a.n]/10,a.a[a.n]%=10;
return a;
}
}f[N];
int main(){
// freopen("a.in","r",stdin);
n=read();f[1].n=1;f[1].a[1]=1;f[2].n=1;f[2].a[1]=5;
for(int i=3;i<=n;++i)
f[i]=f[i-1]*3-f[i-2];//+2
for(int i=f[n].n;i>=1;--i)
printf("%d",f[n].a[i]);
return 0;
}