通过位运算枚举

原来位运算还能这么用！

原题链接：CodeForces - 550B

You have n problems. You have estimated the difficulty of the i-th one as integer c**i. Now you want to prepare a problemset for a contest, using some of the problems you’ve made.

A problemset for the contest must consist of at least two problems. You think that the total difficulty of the problems of the contest must be at least l and at most r. Also, you think that the difference between difficulties of the easiest and the hardest of the chosen problems must be at least x.

Find the number of ways to choose a problemset for the contest.

Input

The first line contains four integers n, l, r, x (1 ≤ n ≤ 15, 1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ 106) — the number of problems you have, the minimum and maximum value of total difficulty of the problemset and the minimum difference in difficulty between the hardest problem in the pack and the easiest one, respectively.

The second line contains n integers c1, c2, …, c**n (1 ≤ c**i ≤ 106) — the difficulty of each problem.

Output

Print the number of ways to choose a suitable problemset for the contest.

Example

Input

5 25 35 10
10 10 20 10 20

Output

6

代码如下：

#include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int c[20];

int main()
{
    int n,l,r,x;
    cin >> n >> l >> r >> x;
    for (int i = 0; i < n; i++)
        cin >> c[i];
    int ans = 0;
    for (int i = 0; i < pow(2,n); i++)
    {
        int sum = 0,m = 99999999,M = -1;
        for (int j = 0; j < n; j++)
        {
            if (i & 1 << j)
            {
                sum += c[j];
                m = min(m,c[j]);
                M = max(M,c[j]);
            }
        }
        if (sum >= l && sum <= r && (M - m) >= x)
            ans++;
    }
    cout << ans << endl;
    return 0;
}