MAIN72  Subset sum
You are given an array of N integers. Now you want to find the sum of all those integers which can be expressed as the sum of at least one subset of the given array.
Input
First line contains T the number of test case. then T test cases follow, first line of each test case contains N (1 <= N <= 100) the number of integers, next line contains N integers, each of them is between 0 and 1000 (inclusive).
Output
For each test case print the answer in a new line.
Example
Input: 2 2 0 1 3 2 3 2 Output: 1 21
hide comments
loser_404:
20210103 07:47:42
AC in one go.


robosapien:
20200910 23:16:38
dp: 0.03s


lakshya1st:
20200828 15:58:25
AC in one go!! Simple recursive DP implementation of subset sum 

vidit1400:
20200505 19:24:49
If going for recursive solu treat dp as visited array ie 1 if visited and 1 if not . Last edit: 20200505 19:25:10 

auler_:
20200407 15:55:45
Subset sum problem! 

dkkv0000:
20200121 11:05:32
wow topdown(dp+unordered_set) 

pratiyush_05:
20190805 15:15:42
My first dp problem.....accepted ...yeah Last edit: 20190805 15:16:03 

sky_scraper:
20190605 09:30:44
Iterative  set/unordered set > AC


abhinav_kr:
20190522 20:01:04
Unordered_set + Memoization + fast I/O : AC 0.06s 

demon8778:
20181122 08:59:19
Guys!! Need help here. I have solved this problem but it took me about 4 hours. can anyone please help how do I improve my speed for solving problems?

Added by:  Mahesh Chandra Sharma 
Date:  20110313 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem used for NSITIIITA main contest #7 