Problem hidden
SUMIT - Sum It
A number n will be given which actually means a set consists of all the numbers from 1 to n. As this set can have a power set, you have to calculate sum of all elements of all the subsets from this power set.
Input
Input starts with an integer T (<= 50), denoting the number of test cases. Each case starts with a line containing one integer n (1 <= n <= 23).
Output
For every test case, output the expected result.
See explanation for clarification.
Example
Input: 1 3
Output: 24
Explanation
In sample input a number n = 3 is given which means a set {1, 2, 3} is available. Power set of this set consists of different subsets which are {1, 2, 3}, {1, 2}, {2, 3}, {1, 3}, {1}, {2}, {3}. Sum of all the elements of these subsets are 1 + 2 + 3 + 1 + 2 + 2 + 3 + 1 + 3 + 1 + 2 + 3 = 24.
Added by: | imranziad |
Date: | 2016-04-07 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 GOSU JS-MONKEY |
Resource: | Rawnak Sarker (ACC Beginners Contest) |