Tricky Sum
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 1, 2 and 4 are 20, 21 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.
AC-code:
#include<cstdio>
int main()
{
int t,temp;
long long n,ans;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
ans=(n+1)*n/2;
temp=1;
while(n)
{
ans-=2*temp;
temp*=2;
if(n==1)
break;
n/=2;
}
printf("%lld\n",ans);
}
}