P3223 [HNOI2012] 排队

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int p = 10000000000ll;
int fj,ans[10000], n,m,len(1);
void mul(int x) {
    int pre(0), tem;
    for (int i = 1; i <= len; i ++ )
        tem = ans[i] * x,
        ans[i] = tem % p + pre,
        pre = tem / p;
    if (pre) len ++ , ans[len] = pre;
}
signed main() {
    scanf("%lld%lld", &n, &m);
    ans[1] = 1;
    mul(n + 1);
    mul(n * (n + 3) + 2 * m);
    for (int i = 1; i <= n; i ++ ) mul(i);
    for (int i = n - m + 4; i <= n + 2; i ++ ) mul(i);
    printf("%lld", ans[len]);
    while ( -- len) printf("%010lld", ans[len]);
}