J Easy Integration

题目

思路

1.分步求导

2.
3.要打阶乘表，同时取模
4.逆元可得到：

代码

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll F[2000020],F_1[2000020];
ll n,up,down;
ll pow(ll a,ll b){
	ll ans = 1;
	for(;b;b >>= 1){
		if(b & 1){
			ans = (ans*a)%mod;
		}
		a = a*a%mod;
	}
	return ans;
}
int main(){
	F[0]=1;
	for(int i=1;i<=2000005;i++){
		F[i] = F[i-1] * i % mod; 
	}

	while(scanf("%lld",&n)!=EOF){
		up = F[n]*F[n] % mod;
		down = pow(F[2*n+1],mod-2)%mod;
		printf("%lld\n",up*down%mod);
	}
	return 0;
}