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
demon8778: 2018-11-22 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?

kalyanavuthu: 2018-08-02 16:52:36

One minor bug fu***d me left and right for an hour. OMG finally AC in one go..!

paroaro: 2018-07-19 17:30:54


vishwanath_26: 2018-07-15 12:11:20

Learnt a lot from this one !

sharansh12: 2018-07-12 13:43:12

maximum number of test cases?

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

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