A. Tricky Sum
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
Note
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
Note
The answer for the first sample is explained in the statement.
题意:考公式的,求1~n的和,但是要是一个数是2的次方那它的值为负。。。。
思路:推算几组数据后发现求出1~n的正数和,再算出2的次方数的和,用后者乘以2后减去前者即为结果,,,(小菜鸡的见解吧,毕竟水题)注意数的范围要用long long;
下面附上代码:
#include<cstdio>
#include<cmath>
int d(int n)
{
int i=1,m=0;
while(1)
{
if(n<i)
break;
m++;
i*=2;
}
return m;
}
int main()
{
int t;
long long n,p;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
p=d(n);
long long sum=pow(2,p);
printf("%lld\n",n*(n+1)/2-2*(sum-1));
}
return 0;
}