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
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using pil = pair<int, long long>;
using pli = pair<long long, int>;
using ll = long long;
#define X first
#define Y second
#define pb push_back
#define mp make_pair
const int P=1000000007;
int n,a,t[25000007],h=1,wyn,suma=1;
vector<int> v;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    while(n--){
        cin >> a;
        v.pb(a);
    }

    sort(v.begin(),v.end());
    for(auto i:v){
        for(int j = suma; j-i+1>=0; j--){
            t[j+i]=(t[j+i]+t[j])%P;
        }
        if(i==1) t[1]++;
        suma=suma+i;
    }
    for(int i = 1; i<=suma; i++){
        wyn=(wyn+t[i])%P;
    }
    cout << wyn;
    return 0;
}