96pts求调

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 998244353;
const int MAXN = 5005;
int n;
int a[MAXN];
int f[MAXN];
signed main() {
    cin >> n; 
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a + 1, a + n + 1);
    int t = 1;
    for (int i = 1; i <= n; i++) t = (t * 2) % mod;
    t = (t - 1 + mod) % mod;
    int z = (1 + n + 1LL * n * (n - 1) / 2) % mod;
    int v = 0;
    f[0] = 1;
    for (int i = 1; i <= n; i++) {
        int tmp = 0;
        for (int j = 0; j <= a[i]; j++) {
            tmp = (tmp + f[j]) % mod;
        }
        v = (v + tmp - 1 - (i - 1) + mod) % mod;
        for (int j = 5000; j >= a[i]; j--) {
            f[j] = (f[j] + f[j - a[i]]) % mod;
        }
    }
    int ans = (t - z - v + mod) % mod;
    ans = (ans + mod) % mod;
    cout << ans + 1 << endl;
    return 0;
}