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

unsigned long long printPowerSet(int *set, int n)
{
    bool dziala;
    uint64_t wynik = 0, suma;
    unsigned int pow_n = pow(2, n);
    for (int i = 1; i < pow_n; ++i)
    {
        suma = 0;
        dziala = 1;
        for (int j = 0; j < n; ++j)
        {
            if (i & (1 << j))
            {
                if (set[j] <= suma + 1)
                {
                    suma += set[j];
                }
                else
                {
                    dziala = 0;
                    break;
                }
            }
        }
        if (dziala)
            ++wynik;
    }
    return wynik;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int set[n];
    for (int i = 0; i < n; ++i)
        cin >> set[i];
    sort(set, set + n);
    uint64_t podzbiory = printPowerSet(set, n);
    while(podzbiory > 1000000007)
    {
        podzbiory -= 1000000007;
    }
    cout << podzbiory;
}