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
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " " << x << endl;

// #define int long long // uważaj

const int N = 5005;
const int mod = (1000 * 1000 * 1000)+ 7;
int dp[N];

void solve() {
    int n;
    cin >> n;
    vector<int> vek;

    for(int i = 0; i < n; i++) {
        int a;
        cin >> a;
        vek.push_back(a);
    }

    sort(vek.begin(), vek.end());
    dp[0] = 1;

    for(auto x : vek) {
        for(int i = 5000; i >= x - 1; i--) {
            if(i == 0 and x > 1) continue;
            int v = min(5000, i + x);
            dp[v] = (dp[v] + dp[i]) % mod;
        }

        // for(int i = 0; i < 20; i++) {
        //     cout << i << ": " << dp[i] << endl;
        // }
        // cout << endl;
    }

    int ans = 0;
    for(int i = 1; i < N; i++) {
        ans = (ans + dp[i]) % mod;
    }

    cout << ans << "\n";
}

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

	int test = 1;

	while(test--) {
		solve();
	}

	return 0;
}