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
57
58
59
60
61
62
63
#include <bits/stdc++.h>
using namespace std;

void __print(int x) { cerr << x; }
void __print(int64_t x) { cerr << x; }
void __print(uint32_t x) { cerr << x; }
void __print(uint64_t x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template<typename T, typename V>
void __print(const pair<T, V> &x) { cerr << '('; __print(x.first); cerr << ", "; __print(x.second); cerr << ')'; }
template<typename T>
void __print(const T &x) { int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#define debug(x...) cerr << " > [" << #x << "] = ["; _print(x)

const int64_t mod = 1e9 + 7;

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

    int n;
    cin >> n;
    vector<int> a(n);
    int sum_a = 0;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        sum_a += a[i];
    }
    sort(a.begin(), a.end());
    int64_t dp[n][sum_a + 1];
    for(int i = 1; i <= sum_a; i++) {
        dp[0][i] = 0;
    }
    dp[0][0] = 0;
    if(a[0] == 1) dp[0][1] = 1;
    for(int i = 1; i < n; i++) {
        for(int j = 0; j <= sum_a; j++) {
            dp[i][j] = 0;
        }
        if(a[i] == 1) dp[i][1] = 1;
        for(int j = 0; j <= sum_a; j++) {
            if(j + a[i] <= sum_a and a[i] <= j + 1) dp[i][j + a[i]] = (dp[i][j + a[i]] + dp[i - 1][j]) % mod;
            dp[i][j] = (dp[i][j] + dp[i - 1][j]) % mod;
        }
    }
    int64_t res = 0;
    for(int i = 0; i <= sum_a; i++) {
        res = (res + dp[n - 1][i]) % mod;
    }
    cout << res;

    return 0;
}