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.
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).
Print the requested sum for each of t integers n given in the input.
2 4 1000000000
-4 499999998352516354
The answer for the first sample is explained in the statement.
题目大意:给你一个数n,计算从1加到n的结果,只不过在1~n中,是2^0,2^1,2^2...的前面的符号得是负的。。。
解题思路:先用n*(n+1)/2这个公式计算从1加到n的结果,然后减去2倍的2^0,2倍的2^1,2倍的2^2....(PS:注意用long long)
代码如下:
#include <stdio.h>
#include <math.h>
int main()
{
int t;
scanf("%d",&t);
long long n,ans;
while(t--)
{
scanf("%lld",&n);
ans=n*(n+1)/2;
long long i=1;
while(i<=n)
{
ans=ans-2*i;//减去2倍的2的多少次幂
i=i*2;
}
printf("%lld\n",ans);
}
return 0;
}