SUBSUMS  Subset Sums
Given a sequence of N (1 ≤ N ≤ 34) numbers S_{1}, ..., S_{N} (20,000,000 ≤ S_{i} ≤ 20,000,000), determine how many subsets of S (including the empty one) have a sum between A and B (500,000,000 ≤ A ≤ B ≤ 500,000,000), inclusive.
Input
The first line of standard input contains the three integers N, A, and B. The following N lines contain S_{1} through S_{N}, in order.
Output
Print a single integer to standard output representing the number of subsets satisfying the above property. Note that the answer may overflow a 32bit integer.
Example
Input: 3 1 2 1 2 3 Output: 5
The following 5 subsets have a sum between 1 and 2:
 0 = 0 (the empty subset)
 1 = 1
 1 + (2) = 1
 2 + 3 = 1
 1 + (2) + 3 = 2
hide comments
mahak_rawat:
20210405 17:33:21
Getting wrong answer in 14th test case. Can anyone help? 

aviral_tiwari:
20210218 12:05:10
Take Care of duplicates in array....Use lower and upper bound accordingly.. 

reaped_juggler:
20210214 09:48:53
Be Careful on the condition while applying STL :) cost me 3 WA 

nil_s:
20210213 13:57:39
Getting WA on 14th testcase . Anybody can help?? 

hackerbhaiya:
20210102 16:07:01
starter of meet in the middle algorithm :) 

daddys_home:
20201228 16:39:53
learn meet in the middle coz of this problem.


matias222:
20200824 06:21:29
Finally after 1 week of trying AC, it is a meet in the middle problem, just focus on doing a right bs


goa_baba:
20200616 21:04:11
very poor test cases!


bhati_r45:
20200516 07:27:20
the first 14 test cases are very weak and finally got ac


scolar_fuad:
20191220 07:43:44
my first meet in the middle dp ... bitmask + binary search ...

Added by:  Neal Wu 
Date:  20090119 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 