Summing Subsets

Problem code: RESN05

All submissions for this problem are available.

Let G(S) denote the sum of the elements of set S and F(n) be the sum of G(s) for all subsets of the set consisting of the first n natural numbers. For example, F(3) = (1) + (2) + (3) + (1 + 2) + (1 + 3) + (2 + 3) + (1 + 2 + 3) = 24. Given n, calculate F(1) + F(2) + ... + F(n).

Input

The first line contains the number of test cases T (<= 1000). Each of the next T lines contains an integer n. (1 <= n <= 1000000000).

Output

Output T lines, one corresponding to each test case. Since the answers can get very big, output the answer modulo 8388608

Example

Input:
3
1
2
3
Output:
1
7
31

Author: admin
Date Added: 18-12-2009
Time Limit: 5 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC


Comments

</b> This is my soultion to

coolnirdh @ 29 May 2010 01:24 PM

[code removed by admin]

This is my soultion to the question, but the time limit exceeds everytime. Can anyone please help me?

Do not post code here; please

triplem @ 29 May 2010 03:33 PM

Do not post code here; please read the FAQ. Simple testing of your program will outline why your solution has no hope of running within the time limit (or even giving the correct answer).

can u plzzzz details of

aayush123 @ 2 Oct 2010 12:54 PM

can u plzzzz details of chinese theorm???

@senior members: Please

rajneesh2k10 @ 31 Jan 2011 10:26 AM

@senior members:

Please explain this solution: http://www.codechef.com/viewsolution/153323

can anyone plz tell me the

amnsinghl @ 18 Apr 2011 06:12 PM

can anyone plz tell me the meaning of output the answer modulo 8388608

without knowing the fact that

mpossible @ 30 Jul 2011 03:54 AM
without knowing the fact that ans reapeats after 22... plz nebody tell that how did (n*n-n+2) come from... the general fn of the series can be generalised as (2^n-1)*n*(n+1)/2... but summing these terms without knowing that we need only till 22 how it can be done. ????

what does output the answer

workhard @ 8 Oct 2011 03:07 PM
what does output the answer modulo 8388608 mean?

@Workhard: answer modulo

vipul4vb @ 20 Mar 2012 08:54 AM
@Workhard: answer modulo 8388608 means that take remainder of your answer by 8388608 (since answer can go considerably big). e.g. if you answer comes 8388712, then output will be ( 8388712 % 8388608 = 104)... Keep working hard. ;)

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

HELP

Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

 

  • Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
  • Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
  • Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
  • Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
  • Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

    • If you are still having problems, see a sample solution here.

CodeChef is a global programming communityCodeChef hosts online programming competitions