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
#include <bits/stdc++.h>


using namespace std;


const int N = 5000;
const int MOD = 1000 * 1000 * 1000 + 7;


int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <int> a(n);
    for (int &x : a) {
        cin >> x;
    }

    sort(a.begin(), a.end());

    vector <int> dp(N, 0);
    dp[0] = 1;

    for (int x : a) {
        for (int s = N - 1; s >= x - 1; s--) {
            int sNew = min(N - 1, s + x);
            dp[sNew] = (dp[sNew] + dp[s]) % MOD;
        }
    }

    int ans = 0;
    for (int x : dp) {
        ans = (ans + x) % MOD;
    }

    ans = (ans + MOD - 1) % MOD;

    cout << ans << '\n';

    return 0;
}