64pts求调

#include <bits/stdc++.h>
using namespace std;

const int N = 5005;
const int mod = 998244353; 

int n;
int a[N], dp[N];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i ++) scanf("%d", &a[i]);
    sort(a, a + n);

    dp[0] = 1;
    int ans = 0, pre = 0;
    for (int i = 0; i < n; i ++) {
        int need = a[i] + 1;
        if (need <= pre) 
            for (int j = need; j <= pre; j ++)
                ans = (ans + dp[j]) % mod;

        for (int j = pre; j >= 0; j --) 
            dp[j + a[i]] = (dp[j + a[i]] + dp[j]) % mod;

        pre += a[i];
    }

    printf("%d\n", ans);
    return 0;
}