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
#include <bits/stdc++.h>

using namespace std;
int n, *tab, sum;
void dfs(int res, int poz)
{
    if(poz==n-1)
    {
        if(poz!=-1)
        {
            sum++;
            sum%=1000000007;
            //cout<<tab[poz]<<endl;
        }
        return;
    }
    for(int i=poz+1;i<n;i++)
    {
        if(tab[i]<=res)
        {
            dfs(res+tab[i], i);
        }
        else
        {
            break;
        }
    }
    if(poz!=-1)
    {
        sum++;
        sum%=1000000007;
        //cout<<tab[poz]<<endl;
    }
    return;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n;
    tab=new int[n];
    for(int i=0;i<n;i++)
    {
        cin>>tab[i];
    }
    sort(tab, tab+n);
    dfs(1, -1);
    cout<<sum;
    delete [] tab;
    return 0;
}