550B.md (1972B)
1 Source: https://codeforces.com/problemset/problem/550/B 2 3 B. Preparing Olympiad 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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. 22 23 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*. 24 25 Find the number of ways to choose a problemset for the contest. 26 27 Input 28 29 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. 30 31 The second line contains *n* integers *c*1, *c*2, ..., *c**n* (1 ≤ *c**i* ≤ 106) — the difficulty of each problem. 32 33 Output 34 35 Print the number of ways to choose a suitable problemset for the contest. 36 37 Examples 38 39 Input 40 41 ``` 42 3 5 6 1 43 1 2 3 44 ``` 45 46 Output 47 48 ``` 49 2 50 ``` 51 52 Input 53 54 ``` 55 4 40 50 10 56 10 20 30 25 57 ``` 58 59 Output 60 61 ``` 62 2 63 ``` 64 65 Input 66 67 ``` 68 5 25 35 10 69 10 10 20 10 20 70 ``` 71 72 Output 73 74 ``` 75 6 76 ``` 77 78 Note 79 80 In the first example two sets are suitable, one consisting of the second and third problem, another one consisting of all three problems. 81 82 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. 83 84 In the third example any set consisting of one problem of difficulty 10 and one problem of difficulty 20 is suitable.