链接
题解
这个问题可以转化成,在直角坐标系上,从 ( 0 , 0 ) (0,0) (0,0)开始走,从 ( x , y ) (x,y) (x,y)只能走到 ( x + 1 , y ) (x+1,y) (x+1,y)或者 ( x , y + 1 ) (x,y+1) (x,y+1),不能穿过直线 y = x y=x y=x,前两步只能往上走,问走到 ( n , n ) (n,n) (n,n)有多少种方案
构造方式和卡特兰数的证明类似,推导出答案为:
( 2 n − 2 n ) − ( 2 n − 2 n + 1 ) \binom{2n-2}{n} - \binom{2n-2}{n+1} (n2n−2)−(n+12n−2)
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 200010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
struct EasyMath
{
ll prime[maxn], phi[maxn], mu[maxn];
bool mark[maxn];
ll fastpow(ll a, ll b, ll c)
{
ll t(a%c), ans(1ll);
for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
return ans;
}
void shai(ll N)
{
ll i, j;
for(i=2;i<=N;i++)mark[i]=false;
*prime=0;
phi[1]=mu[1]=1;
for(i=2;i<=N;i++)
{
if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
for(j=1;j<=*prime and i*prime[j]<=N;j++)
{
mark[i*prime[j]]=true;
if(i%prime[j]==0)
{
phi[i*prime[j]]=phi[i]*prime[j];
break;
}
mu[i*prime[j]]=-mu[i];
phi[i*prime[j]]=phi[i]*(prime[j]-1);
}
}
}
ll inv(ll x, ll p) //p是素数
{return fastpow(x%p,p-2,p);}
}em;
#define mod 998244353ll
ll fact[maxn], _fact[maxn];
ll C(ll n, ll m)
{
if(m>n or m<0)return 0;
return fact[n]*_fact[m]%mod*_fact[n-m]%mod;
}
int main()
{
ll T=read(), i, kase;
fact[0]=_fact[0]=1;
rep(i,2e5)fact[i]=fact[i-1]*i%mod, _fact[i]=em.inv(fact[i],mod);
rep(kase,T)
{
ll n = read(), ans;
ans =( ( C(2*n-2,n) - C(2*n-2,n+1) ) %mod +mod )%mod;
printf("Case #%lld: %lld\n",kase,ans);
}
return 0;
}