D - I Hate Non-integer Number

• dp：
• f[j][k][l]表示在一共选择i个数的情况下，在前j个数中选择了k个数，且已经选择的数之和%i的余数为l的方案数
• 答案就是f[n][i][0]之和
• 注意这里因为要加上一个数再取模，因此我们逆推dp

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#define endl '\n'
#define _(a) cout << #a << ": " << (a) << "    "
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 105;
const ll mod = 998244353;

int n;
int a[N];

void chk(ll &u, ll v) {
    u = (u + v) % mod;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; ++ i) cin >> a[i];
    ll ans = 0;
    for (int i = 1; i <= n; ++ i) {
        vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(i + 1, vector<ll>(i + 1, 0)));
        dp[0][0][0] = 1ll;
        for (int j = 0; j < n; ++ j) {
            for (int k = 0; k <= i; ++ k) {
                for (int l = 0; l < i; ++ l) {
                    chk(dp[j + 1][k][l], dp[j][k][l]);
                    if (k < i) chk(dp[j + 1][k + 1][(l + a[j]) % i], dp[j][k][l]);
                }
            }
        }
        chk(ans, dp[n][i][0]);
    }
    cout << ans;
}

• 记忆化搜索版本：
• 整数 -> 选的数之和除以选的数的个数等于0 -> 和%个数=0 -> 选的过程中，和每一次累加后都可以取模
• 当前搜索第几位，这次一共选择多少个数，已经选了多少个数，已经选了的数之和%模数
• 注意搜索结束的条件：首先是判断当前已经选了的数大于一共应该选择的数；然后如果搜索完所有的数了，判断应该返回的是0还是1

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <unordered_set>
#include <unordered_map>
#define endl '\n'
#define _(a) cout << #a << ": " << (a) << "    "
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 105;
const ll mod = 998244353;

int n;
ll a[N];
ll f[N][N][N][N];

void chk(ll &u, ll v) {
    u = (u + v) % mod;
}
ll dfs(int pos, int mode, int sel, int sum) {
    if (sel > mode) return 0ll;
    if (pos == n + 1) {
        if (sum != 0 || sel != mode) return 0ll;
        return 1ll;
    }
    if (f[pos][mode][sel][sum] != -1) return f[pos][mode][sel][sum];
    ll ans1 = dfs(pos + 1, mode, sel, sum);
    ll ans2 = dfs(pos + 1, mode, sel + 1, (sum + a[pos]) % mode);
    return (f[pos][mode][sel][sum] = (ans1 + ans2) % mod);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++ i) cin >> a[i];
    for (int i = 0; i <= n; ++ i) {
        for (int j = 0; j <= n; ++ j) {
            for (int k = 0; k <= n; ++ k) {
                for (int u = 0; u <= n; ++ u) {
                    f[i][j][k][u] = -1;
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++ i) {
        chk(ans, dfs(1, i, 0, 0));
    }
    cout << ans;
}