J.Easy Integration

题目积分后可得答案为 $n{!}^2/(2\ast n+1)!$

#include <iostream>
#define Mod 998244353
#define Maxn 2000010
using namespace std;
typedef long long ll;
ll pow2(ll base,ll n) {
    ll ans = 1;
    base %= Mod;
    while (n) {
        if (n & 1) ans = (ans*base) % Mod;
        base = (base*base) % Mod;
        n >>= 1;
    }
    return ans%Mod;
}
int a[Maxn];
int main(){
    int n;
    a[0]=1;
    for(int i = 1 ; i <= 2000003 ; i ++ ) a[i]=(1ll*a[i-1]*i)%Mod;
    while(~scanf("%d",&n)){
        printf("%lld\n",1ll*a[n]*a[n]%Mod*pow2(a[2*n+1],Mod-2)%Mod);
    }
    return 0;
}

今天看了二分图。