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 1, 2 and 4 are 20, 21 and 22 respectively.
Calculate the answer for t values of n.
InputThe 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).
OutputPrint the requested sum for each of t integers n given in the input.
Sample Input
Input
2 4 1000000000
Output
-4 499999998352516354
<span style="font-family:SimSun;font-size:18px;">#include<cstdio>
#include<cmath>
int main()
{
int t;
long long n,sum;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
sum=0;
sum=n*(n+1)/2;
long long sum2=0;
for(int i=0;pow(2,i)<=n;i++)
sum2+=pow(2,i);
printf("%lld\n",sum-2*sum2);
}
return 0;
}</span><span style="font-family: 'Times New Roman', Times, serif; font-size: 17px;">
</span>