“华为杯“华南理工大学程序设计竞赛 F-松鼠

题目

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
const int maxn = 1e6 + 5;
const int inf = 1e9 + 5;
const int mod = 998244353;
const int N = 3e3;

using namespace std;

int n, m;
int f[3005][3005];//f[n][k]表示用数字1,2,...,n拼成若干个长度都小于等于k的环有多少种方案（环间的顺序不重要，即两个环交换位置也是同一种方案）
int fac[maxn], inv[maxn];
int pw[3005][3005], invp[3005][3005];//pw[i][j]为i^j, invp为逆元

int qpow(int a, int b){
	int res = 1;
	while(b){
		if(b & 1) res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

void solve(){
    int res = 0;
	int q;
    string s;
    int k;
// 	cin >> k >> n;
//     cout << f[k][n] % mod << '\n';
    cin >> n >> k;
    cout << f[k][n] * inv[n] % mod << '\n';
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

    fac[0] = 1;
	for(int i = 1; i <= N; i++){
		fac[i] = fac[i - 1] * i % mod;
	}
	inv[N] = qpow(fac[N], mod - 2);
	for(int i = N - 1; i >= 0; i--){
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
    for(int i = 1; i <= N; i++){
        pw[i][0] = 1;
    }
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= N; j++){
            pw[i][j] = pw[i][j - 1] * i % mod; 
        }
    }
    for(int i = 1; i <= N; i++){
        invp[i][N] = qpow(pw[i][N], mod - 2);
    }
    for(int i = 1; i <= N; i++){
        for(int j = N - 1; j >= 0; j--){
            invp[i][j] = invp[i][j + 1] * i % mod;
        }
    }

    for(int n = 0; n <= N; n++){
        f[1][n] = 1;
    }
//     f[0][0] = 1;
    for(int k = 2; k <= N; k++){
        for(int n = 0; n <= N; n++){//必须从0开始，从1开始也不行，f[n][k](n < k)也是有效状态
            for(int i = 0; i * k <= n; i++){
                f[k][n] = (f[k][n] + f[k - 1][n - i * k] * invp[k][i] % mod * inv[i] % mod * fac[n] % mod * inv[n - i * k] % mod) % mod;
            }
//             cout << k << ' ' << n << ' ' << f[k][n] << '\n';
        }
    }
	int T = 1;
	cin >> T;
	while(T--){
		solve();
	}

	return 0;
}