题目描述
题解
答案就是卡特兰数
没觉得这个搭建的方法很像二叉树?
拒绝学Python
代码
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define N 1000
int n;
struct data{int a[N];}ans;
int p[N+1],prime[N+1],num[N+1],cnt[N+1];
void get()
{
for (int i=2;i<=N;++i)
{
if (!p[i]) prime[++prime[0]]=i,num[i]=prime[0];
for (int j=1;j<=prime[0]&&i*prime[j]<=N;++j)
{
p[i*prime[j]]=1;
if (i%prime[j]==0) break;
}
}
}
data cheng(data a,int b)
{
data ans;memset(ans.a,0,sizeof(ans.a));
int len=a.a[0];
for (int i=1;i<=len;++i)
ans.a[i]=a.a[i]*b;
for (int i=1;i<=len;++i)
{
ans.a[i+1]+=ans.a[i]/10;
ans.a[i]%=10;
}
while (ans.a[len+1])
{
++len;
ans.a[len+1]+=ans.a[len]/10;
ans.a[len]%=10;
}
ans.a[0]=len;
return ans;
}
int main()
{
get();
scanf("%d",&n);
for (int i=n+1;i<=2*n;++i)
{
int x=i;
for (int j=1;j<=prime[0]&&x>1&&prime[j]*prime[j]<=x;++j)
while (x%prime[j]==0) ++cnt[j],x/=prime[j];
if (x>1) ++cnt[num[x]];
}
for (int i=1;i<=n+1;++i)
{
int x=i;
for (int j=1;j<=prime[0]&&x>1&&prime[j]*prime[j]<=x;++j)
while (x%prime[j]==0) --cnt[j],x/=prime[j];
if (x>1) --cnt[num[x]];
}
ans.a[0]=ans.a[1]=1;
for (int i=1;i<=prime[0];++i)
while (cnt[i]) ans=cheng(ans,prime[i]),--cnt[i];
for (int i=ans.a[0];i>=1;--i)
putchar('0'+ans.a[i]);putchar('\n');
}