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;

void test_case() {
    int n;
    cin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    vector<int> dp(5001);
    int p = 1e9 + 7;
    for (int i = 1; i <= n; i++) {
        for (int j = 5000; j >= 1; j--) {
            if (dp[j] >= 1 && j >= a[i] - 1) {
                dp[min(5000, j + a[i])] = (dp[min(5000, j + a[i])] + dp[j]) % p;
            }
        }
        if (a[i] == 1) {
            dp[1]++;
        }
    }
    int sum = 0;
    for (int i = 1; i <= 5000; i++) {
        sum = (sum + dp[i]) % p;
    }
    if (sum < 0)
        sum += p;
    cout << sum << '\n';
}

void solve() {
    test_case();
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}