（二） Q - Q tricky sum

Q - Q
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

In this problem you are to calculate the sum of all integers from 1 to n, but you should take all powers of two with minus in the sum.

For example, for n = 4 the sum is equal to  - 1 - 2 + 3 - 4 =  - 4, because 12 and 4 are 2021 and 22 respectively.

Calculate the answer for t values of n.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 100) — the number of values of n to be processed.

Each of next t lines contains a single integer n (1 ≤ n ≤ 109).

Output

Print the requested sum for each of t integers n given in the input.

Sample Input

Input
2
4
1000000000

Output
-4
499999998352516354


Hint

The answer for the first sample is explained in the statement.

先把n内2的次幂数加起来，1-n的和减去2*上面的和

#include <cstdio>
int main()
{
int t;
long long n,sum1,sum2;
scanf("%d",&t);
while(t--)
{
sum1=0;
sum2=0;
scanf("%lld",&n);
for(int i=1;i<=n;i*=2)
{
sum1+=i;
}
sum2=(1+n)*n/2;
sum2=sum2-2*sum1;
printf("%lld\n",sum2);
}
return 0;
}


05-27 2484

09-11 1173

07-16 1693

09-04 3333

06-16 1万

飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q飞Q

2011年04月15日 1.25MB 下载

10-20 2160

01-07 1094

04-25 250