HUDOJ 5673 Robot

思路：枚举0到n/2的卡塔兰数，再上乘组合系数。
先预处理出阶乘及其逆元以及卡塔兰数。

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 1000005
#define maxm 500005
#define MOD  1000000007
#define INF 1e18
using namespace std;
//-------------------------CHC------------------------------//
LL Cata[maxn], f[maxn], fn[maxn];

LL qpow(LL a, LL b) {
	LL ret = 1;
	while (b) {
		if (b & 1) ret = ret*a%MOD;
		a = a*a%MOD;
		b >>= 1;
	}
	return ret;
}

LL C(int n, int m) {
	return f[n] * fn[m] % MOD * fn[n - m] % MOD;
}

void pre() {
	fn[0] = fn[1] = f[0] = f[1] = 1;
	FOR(i, 2, maxn) {
		f[i] = i*f[i - 1], f[i] %= MOD;
		fn[i] = qpow(f[i], MOD - 2), fn[i] %= MOD;
	}
	Cata[0] = 1;
	FOR(i, 1, maxn/2) Cata[i] = C(2 * i, i)*qpow(i + 1, MOD - 2)%MOD;
	//FOR(i, 0, 10) printf("f = %lld, Cata = %lld\n", f[i], Cata[i]);
}

int main() {
	int T;
	pre();
	SF(T);
	while (T--) {
		int n;
		SF(n);
		LL ans = 0;
		FOR(i, 0, n / 2+1) {
			ans += C(n, i * 2)*Cata[i];
			ans %= MOD;
		}
		printf("%lld\n", ans);
	}
	return 0;
}