1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>

using namespace std;

const int N = 5005;
const int MOD = 1e9+7;
int dp[N];

void solve() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    dp[0] = 1;
    int mx = 0;
    for (int x : v) {
        for (int j = mx; j >= x - 1; j--) {
            int q = j+x;
            if (q >= N) {
                q = N-1;
            }
            dp[q] += dp[j];
            if (dp[q] >= MOD) {
                dp[q] -= MOD;
            }
        }
        mx += x;
        if (mx >= N) {
            mx = N-1;
        }
    }
    int ans = 0;
    for (int i = 1; i <= mx; i++) {
        ans += dp[i];
        ans %= MOD;
    }
    cout << ans << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cout.precision(15);
    cout << fixed;
    cin.tie(0);

    int T = 1;
    //cin >> T;
    for (int tst = 0; tst < T; tst++) {
        solve();
    }

    return 0;
}