f[i]表示深度<=i的严格n元树的数目,则我们有
f[i]=f[i−1]n+1
(一个点当根,然后n棵子树分别有f[i-1]种形态,再加上一个只有根的情况)
答案就是f[d]-f[d-1]
需要高精,题目保证答案不超过200位。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,d;
struct bigint{
int a[N],n;
bigint(){}
bigint(bool t){memset(a,0,sizeof(a));n=0;if(t) a[1]=1,n=1;}
int& operator[](int x){return a[x];}
friend bigint operator+(bigint a,int x){
a[1]+=x;
for(int i=1;i<=a.n;++i) a[i+1]+=a[i]/10,a[i]%=10;
while(a[a.n+1]) ++a.n,a[a.n+1]+=a[a.n]/10,a[a.n]%=10;
return a;
}friend bigint operator*(bigint a,bigint b){
bigint res(0);res.n=a.n+b.n-1;
for(int i=1;i<=a.n;++i)
for(int j=1;j<=b.n;++j)
res[i+j-1]+=a[i]*b[j];
for(int i=1;i<=res.n;++i) res[i+1]+=res[i]/10,res[i]%=10;
while(res[res.n+1]) ++res.n,res[res.n+1]+=res[res.n]/10,res[res.n]%=10;
return res;
}friend bigint operator^(bigint a,int k){
bigint res(1);
for(;k;k>>=1,a=a*a) if(k&1) res=res*a;return res;
}friend bigint operator-(bigint a,bigint b){
bigint res(0);res.n=a.n;
for(int i=1;i<=res.n;++i) res[i]=a[i]-b[i];
for(int i=1;i<=res.n;++i) if(res[i]<0) res[i]+=10,res[i+1]--;
while(!res[res.n]) --res.n;return res;
}
}f[20];
inline void print(bigint x){
for(int i=x.n;i>=1;--i) printf("%d",x.a[i]);puts("");
}
int main(){
// freopen("a.in","r",stdin);
n=read();d=read();f[1].a[1]=2;f[1].n=1;
if(d==0||d==1){puts("1");return 0;}
for(int i=2;i<=d;++i) f[i]=(f[i-1]^n)+1;
print(f[d]-f[d-1]);
return 0;
}