和老黄人一起切的这道题
打个表,然后发现是Catalan数
答案就是Catalan数第n位
注意需要特殊的技巧防止超时
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define N 2000050
#define tp 2000000
using namespace std;
typedef long long LL;
int F[N],p[N],ys[N],n,mod,cnt;
bool pr[N];
inline void calc(int x,int t) {
while (ys[x]) {
F[ys[x]]+=t; x/=ys[x];
}
F[x]+=t;
}
LL qp(LL a,LL b) {
LL r = 1LL;
while (b) {
if (b&1) r=(r*a) % mod;
a=a*a; b>>=1;
}
return r;
}
LL C(int a,int b) {
memset(F,0,sizeof(F));
LL r = 1LL;
for (int i=a;i>=a-b+1;i--) calc(i,1);
for (int i=1;i<=b;i++) calc(i,-1);
for (int i=1;i<=cnt;i++)
r = (r*qp(p[i],F[p[i]]))%mod;
return r;
}
int main()
{
for (int i=2;i<=tp;i++) {
if (!pr[i]) p[++cnt] = i;
for (int j=1;j<=cnt&&i*p[j]<=tp;j++) {
pr[i*p[j]] = 1; ys[i*p[j]]=p[j];
if (i%p[j] == 0) break;
}
}
scanf("%d%d",&n,&mod);
LL ans = ( C(2*n,n) - C(2*n,n-1) ) % mod;
if (ans < 0) ans += mod;
printf("%d\n",(int)ans);
return 0;
}