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

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

hide comments
2015-12-26 10:59:31 sneh sajal
good Dp :)
2015-11-06 00:40:08
AC in 1 go..learned concept of subset sum using dp :) century 100th ;)
2015-10-26 16:31:08 eightnoteight
TLE for set; AC for unordered_set
2015-09-29 23:02:40
Easy
2015-08-17 15:28:03 aeon
Power of dp works again.. But careful with array size :)
2015-07-19 15:25:46 utkarsh agarwal
any tricky cases??
2015-06-18 00:07:47
good problem
worth the time

Last edit: 2015-06-18 00:08:43
2015-06-16 15:12:56
AC at first go :D
2015-05-30 08:31:08 i_am_looser
2 tle 2 wa but finally done using set.....stl rocks....
2015-05-27 06:26:28 Anirudh Gupta
sigsegv on spoj but its running fyn on spoj.....plz help :(
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.