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
#include <bits/stdc++.h>
using namespace std;
#define mk make_pair
#define fi first
#define sz(x) x.size()
#define se second
#define pb push_back
#define VAR(v) #v << " = " << v << " "
#define debug if(0)
#define M_PI 3.14159265358979323846
typedef complex<long double> C;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> Matrix;
const int maxn = (int)1e6 + 9;
const int INF = (int)1e9 + 7;
int mod = (int)1e9 + 7;
int n;
int tab[maxn];
int dp[5001][5002];

int main(int argc, char* argv[])
{
    ios::sync_with_stdio(false);
    debug; else cin.tie(NULL), cout.tie(NULL);
    dp[0][0] = 1;
    cin>>n;
    int mx = 0;
    for(int i = 0; i < n; i++)
    {
        cin>>tab[i];
        mx = max(mx, tab[i]);
    }
    sort(tab, tab + n);
    for(int k = 1; k <= n; k++){
        debug cout << VAR(tab[k-1]) << VAR(mx) << VAR(k) << endl;
        for(int i = 0; i <= mx+1; i++)
            dp[k][i] = dp[k-1][i];
        for(int i = tab[k-1] - 1; i <= mx + 1; i++)
            dp[k][min(mx + 1, i+tab[k-1])] = (dp[k][min(mx + 1, i+tab[k-1])] + dp[k-1][i])%mod;
    }
    ll ans = 0;
    for(int i = 1 ; i <= mx + 1; i++)
    {
        ans = (ans + dp[n][i])%mod;
        debug cout << VAR(dp[n][i])<<endl;
    }
    cout<<ans<<"\n";
    return 0;
}