CODEM5  Problem5
You are given an array of weights of n objects and your task is to select minimum number of objects whose sum of weights is exactly equals to some given k.
Input
Input:
Line 1  Number of test cases T(<=10) followed by 2 lines for each test case
Line 2  Number of objects n(<=20) and total weight k(<=10^4)
Line 3  weights(<=10^4) of n objects(each separated by space)
Output
Minimum number of objects whose weights sums to k.
Example
Input: 2
5 9
10 9 4 3 5
3 7
1 2 3 Output: 1
impossible
Explanation: For 1st case the two combinations are possible:
(9),(4,5) hence minimum no of objects is 1
For 2nd case there is no combination possible hence impossible.
hide comments
asifalim:
20210427 11:56:16
after(6) keeping a visited array got accepted!


scolar_fuad:
20191012 19:44:42
knapsake in enough to solve this problem ...


subhikhalifeh:
20190504 00:43:44
D:


kaneki0530:
20180606 11:10:31
Backtracking!!! AC in one go 

thanos_tapras:
20180427 12:47:27
Tried with subset sum, but always WA. Tried again with bitmasks and got AC 

prince_batra:
20180324 18:57:50
I try this problem Just like subset sum problem of DP with minimum coins to form the sum but still getting WA?


chetan4060:
20171208 19:51:20
try bitmask if rte


mahilewets:
20170909 15:33:50
Knapsack 

pradeep_yadav:
20170826 15:44:33
Take n about 105


kshubham02:
20170823 09:28:51
Buggy question, take n=100. 
Added by:  Bhavik 
Date:  20140204 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  own problem(for CODE MARATHON) 