【CodeForces 598A Tricky Sum】

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 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.

Examples
input
2
4
1000000000
output
-4
499999998352516354

#include<cstdio>
int main()
{
    int T;
    long long ans,kl,N,sum;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lld",&N);
        ans=(N*(N+1))/2;
        //printf("---%lld---\n",ans);
        kl=1;sum=0;
        while(kl<=N)
        {
            sum+=kl;
            kl*=2;
        }
        ans-=sum*2;
        printf("%lld\n",ans);
    }
    return 0;
}