您的位置:首页 > 其它

【CodeForces】598A - Tricky Sum(计数)

2016-07-21 20:13 465 查看
点击打开题目

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

The answer for the first sample is explained in the statement.

以前做过类似题,不是很难,注意数据类型。

代码如下:

#include <cstdio>
int main()
{
int u;
__int64 n;
__int64 sum,ans;
__int64 ant; //次数
scanf ("%d",&u);
while (u--)
{
scanf ("%I64d",&n);
ans = (1 + n) * n / 2;
ant = 0;
int t = 1;
while (t <= n)
{
ant++;
t <<= 1;
}
sum = ((__int64)1 << ant) - 1;
ans -= sum;
ans -= sum;
printf ("%I64d\n",ans);

}
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: