Codeforces Round #306 (Div. 2)——B暴力——Preparing Olympiad

You have n problems. You have estimated the difficulty of the i-th one as integer ci. 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, ..., cn (1 ≤ ci ≤ 106) — the difficulty of each problem.

Output

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

Sample test(s)

input

3 5 6 1
1 2 3

output

2

input

4 40 50 10
10 20 30 25

output

2

input

5 25 35 10
10 10 20 10 20

output

6

Note

In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems.

In the second example, two sets of problems are suitable — the set of problems with difficulties 10 and 30 as well as the set of problems with difficulties 20 and 30.

In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.

大意：给你n个数，x为最大值最小值之间最起码的差值，l,r分别是所有数之和所应该要在的范围，问有多少种组合

一开始想用全排列做，赛后发现全排列的话会有重复比如 1 2 4 5 6 ， 1 2 5 4 6 当k为2的时候就重复了只选了1 2

没想到位运算暴力

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
int main()
{
    int n,x,l,r;
    int a[16];
    while(~scanf("%d%d%d%d",&n,&l,&r,&x)){
        int count = 0;
        for(int i = 0; i < n ;i++)
            scanf("%d",&a[i]);
        for(int cout = 1; cout <= 1 << n ;cout++){
        int max1 = 0;
        int min1 = inf;
        int sum = 0;
        for(int i = 0 ; i < n; i++){
            if(cout>>i&1){
                min1 = min(min1,a[i]);
                max1 = max(max1,a[i]);
                sum += a[i];
            }
        }
        if(max1 - min1 >= x && sum >= l && sum <= r) count++;
        }
        printf("%d\n",count);
    }
    return 0;
}

　　

转载于:https://www.cnblogs.com/zero-begin/p/4555069.html