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.


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).  


For each test case print the answer in a new line.


0 1
2 3 2


hide comments
hacker920: 2018-03-05 14:43:10

easy dp

mark42: 2017-12-30 12:17:07

nice dp :) took a while but worth it

esshuvo: 2017-09-03 22:28:05

Problem is ambiguous!You have to caculate total sum of each subset whose sum is distinct :)

code_aim: 2017-07-04 17:15:19


coolio_1: 2017-06-24 08:17:50

Direct application of subset sum using dp concept!!
Without I/O optimizations= AC 0.03
With I/O optimization= AC 0.02

heisenberg0820: 2017-06-22 20:07:18

Just DP...No need for unordered set whatsoever :)

aman_9899: 2017-06-21 11:02:41

dp + unordered set ...!!!
AC in 1 go

shahzada: 2017-03-06 15:27:52

Nice dp.

madhavgaba: 2016-12-29 18:00:39

printf-scanf AC 0.01
cin-cout AC 0.02
ios::sync_with_stdio(false) AC 0.01

Last edit: 2016-12-29 18:01:20
aegon_c: 2016-12-06 08:21:39

tighter constraints.. so use InputReader in case of java..

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