SP32192 SUMMATION - SUMMATION

Description

You are given an array of integer. You have to find the sum of all possible subsuquences sum of the array. For example: The given array of length n = 3 is {1,2,3}. All the sequence of this array with the corresponding array Summations are: Subsequence Summation {} 0 {1} 1 {2} 2 {3} 3 {1,2} 3 {1,3} 4 {2,3} 5 {1,2,3} 6 Total 24 The answer is 24. **Input** The first line of input will contain the test case **T (1

Input Format

N/A

Output Format

N/A