B - Tricky Sum 【水题】【数学】

B - Tricky Sum

 

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 1, 2 and 4 are2⁰, 2¹ and 2² 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 ≤ 10⁹).

Output

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

Example

Input

2
4
1000000000

Output

-4
499999998352516354

这道题我看完样例2我以为数据错了，，，，我以为这么大的数long long也放不下，就一直没敢写，哎~是我傻逼了。

#include<stdio.h>
int main()
{
	int T;
	scanf("%d",&T);
	long long sum1,sum2,n,ant; 
	while(T--)
	{
		scanf("%lld",&n);
		sum1=n*(1+n)/2;			//等差数列前n项和 
		int t = 1; 
		ant=0; 
		//	找出不大于n的最大的2的幂 
        while (t <= n)  
        {  
            ant++;  		//幂的次数 
            t <<= 1;  
        }  
        sum2= ( (long long) 1 << ant ) - 1; //位运算求2的ant次方  sum2为等比数列前n项和 
        sum1=sum1-2*sum2;
        printf("%lld\n",sum1);
	} 
	
	return 0;
}